• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.77-83
• /
• 2009

In this parer, an improved backoff algorithm is proposed by supplementing a multiple of persistence factor for IEEE 802.11 Wireless LAN MAC. This algorithm is proposed to complement the shortcomings of the conventional BEB (Binary Exponential Backoff) algorithm which is used for retransmission to control a new contention window in DCF/EDCF MAC. In channel utilization, collision rate and Goodput viewpoint, we analysis the improved backoff algorithm and compared the result with that of the conventional algorithm In this result, we showed that the performance for PFA backoff algorithm is 10% higher than that for the conventional BEB algorithm when the number of station is 40.

• Journal of Animal Science and Technology
• /
• v.52 no.2
• /
• pp.125-130
• /
• 2010

This study was conducted to investigate the effects of blended feeding essential oils on meat quality improvement for branded pork. A total of one-hundred pigs ($66.24\;{\pm}\;0.83\;kg$, average initial BW) were used for 10 weeks study. Dietary treatments included: 1) CON (basal diet), 2) NBE (basal diet + 75 ppm of blended essential oil), 3) NBA (basal diet + 0.3% Benzoic acid) and 4) BEB [basal diet + 75 ppm of blended essential oil (with 0.3% Benzoic acid)]. The marbling value was improved in NBE treatment compared to NC and PC treatments (P<0.05). Hardness was higher in NBA treatment than NC and PC treatments (P<0.05). The pH value was higher in BEB treatment than PC and NBE treatments (P<0.05). In fatty acid content of lean, total UFA/SFA was higher in NBA treatment than BEB treatment (P<0.05). In conclusion, the results of this study indicated that dietary supplementation with blended essential oils improve fatty acid content of meat.

• Journal of information and communication convergence engineering
• /
• v.5 no.3
• /
• pp.205-208
• /
• 2007

The IEEE 802.11 is a MAC protocol which has been standardized by IEEE for Wireless Local Area Networks (WLANs). In the IEEE 802.11 WLANs, network nodes experiencing collisions on the shared channel need to backoff for a random period of time, which is uniformly selected from the Contention Window (CW). This contention window is dynamically controlled by the Binary Exponential Backoff (BEB) algorithm. However, the BEB scheme suffers from a fairness problem; some nodes can achieve significantly larger throughput than others. This paper proposes a new backoff algorithm for the IEEE 802.11 DCF scheme. This algorithm uses the hop count for considering fairness. It causes flows with high hop count to generate short backoff interval than those with low hop count, thus getting high priority. Therefore, when a collision occurs, the modified IEEE 802.11 DCF assigns higher priority to flow to be close to a destination.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3446-3464
• /
• 2017

Backoff mechanism serves as one of the key technologies in the MAC-layer of wireless mobile networks. The traditional Binary Exponential Backoff (BEB) mechanism in IEEE 802.11 Distributed Coordination Function (DCF) and other existing backoff mechanisms poses several performance issues. For instance, the Contention Window (CW) oscillations occur frequently; a low delay QoS guarantee cannot be provided for real-time transmission, and services with different priorities are not differentiated. For these problems, we present a novel Multi-Priority service differentiated and Adaptive Backoff (MPAB) algorithm over IEEE 802.11 DCF for wireless mobile networks in this paper. In this algorithm, the backoff stage is chosen adaptively according to the channel status and traffic priority, and the forwarding and receding transition probability between the adjacent backoff stages for different priority traffic can be controlled and adjusted for demands at any time. We further employ the 2-dimensional Markov chain model to analyze the algorithm, and derive the analytical expressions of the saturation throughput and average medium access delay. Both the accuracy of the expressions and the algorithm performance are verified through simulations. The results show that the performance of the MPAB algorithm can offer a higher throughput and lower delay than the BEB algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7A
• /
• pp.727-734
• /
• 2004

Collision Management Protocol (CMP) efficiently resolves collisions when data frames are transmitted in networks consisting of HomPNA 3.0 asynchronous MAC mode device with random access. Unlike Distributed Fair Priority Queueing (DFPQ) algorithm in HomePNA 2.0 or Binary Exponential Backoff (BEB) algorithm in IEEE 802.11, order of retransmission is decided according to Collision Signaling Sequence (CSS) values allocated to each device. Thus, CMP can minimize the number of mean collisions because order of retransmission is decided in a deterministic way. In this paper. we evaluate the saturation performance of CMP in HomePNA 3.0 using an analytic method.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2010.08a
• /
• pp.131-131
• /
• 2010

원자의 여기 및 천이에 의한 플라즈마에서의 빛 방출은 일차적으로 여기를 위한 특정 문턱값 이상의 에너지 공급이 전제 된다. 진공 플라즈마에서 대부분의 에너지 전달 과정은 전자와의 물리적 충돌에 의해 일어나므로 충돌 여기의 결과 발생한 광신호 세기는 전자 에너지 분포에 대한 정보를 내포하고 있다. 전자는 입자들 간의 에너지 전달 매개가 되는 동시에 플라즈마 구성 입자 중 가장 가벼워 빠르게 주변 환경 변화에 응답하여 열평형을 이루므로 EEDF는 플라즈마의 미세한 변동까지도 보여줄 수 있는 인자가 된다. 플라즈마의 열평형 이동에 관한 정보를 광신호로부터 EEDF의 형태로 추출해내기 위해 BEB (Binary - Encounter - Bethe) 모델을 근거로 충돌 반응 단면적을 함수로 나타내어 신호를 분석하였다. EEDF의 꼴을 $f(E)=AEexp(-E^b)$의 임의의 형태로 두고 아르곤의 427nm, 763nm 두 빛의 세기 비를 BEB 모델을 적용하여 전개한 결과 b factor 의 값을 구할 수 있었다. b factor 가 1인 경우는 Maxwellian, 2인 경우는 압력이 높은 조건에서 잦은 충돌에 의한 에너지 손실 때문에 고에너지 전자군이 현격하게 감소된 Druyvesteyn 분포를 의미하므로 광신호에 모델을 적용하여 얻은 b factor의 변화는 EEDF의 형태 자체의 변화가 감지되었음을 보여준다. 실제로 13.56MHz - 1kW ICP 장치에서 아르곤 플라즈마를 발생시켰을 때, 압력이 낮아 Maxwellian 분포가 예상되는 10mTorr 조건에서는 b=1.13, Druyvesteyn 분포에 가까워지는 100mTorr 조건에서는 b=1.502 로 관측되었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.782-785
• /
• 2006

셀 내의 모바일 노드들의 수가 많고 셀 간의 이동이 빈번한 고속 모바일 네트워크에서는 기존 802.11 프로토콜로는 좋은 성능을 보장할 수 없다. 셀 내에 새로 진입한 노드들은 네트워크에 참여하기 위해 자신의 존재 여부를 알려야 한다. 802.11 표준에서는 이러한 선행되어야 할 작업을 스캐닝, 인증, 결합의 3가지 단계로 규정한다. 이 등록 작업은 셀 내의 다른 데이터 패킷을 보내려는 노드들과의 경쟁을 통해 이루어진다. 그러므로 셀 내의 노드 수가 많을 경우 기본적인 통신을 위해 선행되어야 할 등록 작업이 지연될 수 있다. 802.11 표준에서는 DCF 방식을 기본 매체 접근 프로토콜로 한다. DCF는 BEB (Binary Exponential Backoff) 알고리즘을 기반으로 한다. BEB 알고리즘의 여러 문제점[5]으로 이를 대체할 알고리즘이 연구되어왔으며, 그룹화를 통해 경쟁하는 노드의 수를 줄이는 방법도 고려되었다. 본 논문에서는 802.11의 성능 평가를 위한 모델링에 Markov chain을 이용한 논문[1]을 기반으로 하나의 노드가 등록 작업에 소요하는 평균 시간을 해석적으로 계산하였다. 셀 내의 전체 노드 수에 증가함에 따라 등록 시간을 계산하고, 직접 시뮬레이션을 통해 수식으로 얻어진 결과와 비교하였다. 또한 그룹화를 시뮬레이션 하여 전체 노드 수에 따라서 적절한 그룹 수의 조정이 그룹화하지 않았을 경우보다 더 나은 성능을 보여줄 수 있다는 것을 보였다.

• Journal of Digital Contents Society
• /
• v.12 no.3
• /
• pp.299-307
• /
• 2011

The MAC of IEEE 802.11 WLAN to control data transmission uses two control methods called DCF and PCF. The DCF controls the transmission based on CSMA/CA The BEB backoff algorithm of DCF shows relatively excellent performance in situation that the number of competing station is less, but has a problem that performance of throughput and delay is degraded in situation that the number of competing station is increased. This paper mathematically analyzes an MIMD backoff algorithm considering retry limit that increases the CW to doubled after collision and decreases smoothly the CW to halves after successful transmission in order to reduce the collision probability. To prove efficiency of the MIMD backoff algorithm, lots of simulations are conducted and analyzed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.10
• /
• pp.4754-4773
• /
• 2018

In sensor medium access control (SMAC) protocol, sensor nodes can only access the channel in the scheduling and listening period. However, this fixed working method may generate data latency and high conflict. To solve those problems, scheduling duty in the original SMAC protocol is divided into multiple small scheduling duties (micro duty MD). By applying different micro-dispersed contention channel, sensor nodes can reduce the collision probability of the data and thereby save energy. Based on the given micro-duty, this paper presents an adaptive duty cycle (DC) and back-off algorithm, aiming at detecting the fixed duty cycle in SMAC protocol. According to the given buffer queue length, sensor nodes dynamically change the duty cycle. In the context of low duty cycle and low flow, fair binary exponential back-off (F-BEB) algorithm is applied to reduce data latency. In the context of high duty cycle and high flow, capture avoidance binary exponential back-off (CA-BEB) algorithm is used to further reduce the conflict probability for saving energy consumption. Based on the above two contexts, we propose an improved SMAC protocol, micro duty adaptive SMAC protocol (MDA-SMAC). Comparing the performance between MDA-SMAC protocol and SMAC protocol on the NS-2 simulation platform, the results show that, MDA-SMAC protocol performs better in terms of energy consumption, latency and effective throughput than SMAC protocol, especially in the condition of more crowded network traffic and more sensor nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.2
• /
• pp.137-145
• /
• 1986

The contention resolution algorithm with the limited packet delay time as well stable distribution as the packet delay time is proposed and implementes for improving the mean packet delay time in the network employing CSMA/CD as the access method. The implementation of node controller is based on IEEE 802.2 standard logical link control(LLC) and IEEE 802.3 standard medium access control(MAC). Some portion of IEEE 802.3 Standard MAC, and the Binary Exponential Back-off(BEB) algorithm is replaced by the proposed algorithm. From the view of normalized mean packet transmission delay time, the controller implemented here can be applicable to the office-automation system, and the factory-and laboratory-automation environment where the limited time criterion is very significant.