• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5A
• /
• pp.460-466
• /
• 2007

There are two coordination functions in IEEE 802.11 standard. One is PCF, polling based function, and the other is DCF, contention based function. DCF is simpler than PCF but the performance is similar with the latter. That's the reason why DCF is more popular than PCF. However, DCF has a risk of collision with other nodes in the network because the function is a distributed contention based one. CSMA/CA of DCF has collision avoidance algorithm in it, but the performance of avoidance algorithm has limitations. In this paper we proposed a new scheme called TAR(Tone-based Access scheme with Repetitive conention). In TAR, there is narrow contention-only channel other than original data transmitting channel, so that both a data transmission and the contention can be performed simultaneously. The TAR uses the same contention concept with the CSMA/CA, but it has the originality for the narrow contention channel and the repetitive contention scheme which greatly reduce the collision probability. We proved the performance of TAR by some simulations, and it showed good results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3A
• /
• pp.178-183
• /
• 2005

In Optical Burst Switching(OBS) networks, burst loss due to contention significantly affects the performance of networks. Even if many contention resolution schemes have been proposed, most of them have focused mainly on passively resolving contentions instead of avoiding them. In this paper, we propose an active contention avoidance scheme which controls a burst sending rate according to traffic load and burst loss in a network. Simulation results show that the proposed scheme can more effectively reduce the burst loss rate compared to existing OBS model with and without burst sending rate control, and at the same time guarantees throughput.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.6
• /
• pp.28-39
• /
• 2010

The study aims at offering a solution to the problems of transmission delay and data throughput decrease as the number of contending On-Board Units (OBU) increases by applying CSMA medium access control protocol based upon IEEE 802.11p. In a competition-based medium, contention probability becomes high as OBU increases. In order to improve the performance of this medium access layer, the author proposes EDCA which a adaptive adjustment of the Contention Windows (CW) considering traffic density and data type. EDCA applies fixed values of Minimum Contention Window (CWmin) and Maximum Contention Window (CWmax) for each of four kinds of Access Categories (AC) for channel-specific service differentiation. EDCA does not guarantee the channel-specific features and network state whereas it guarantees inter-AC differentiation by classifying into traffic features. Thus it is not possible to actively respond to a contention caused by network congestion occurring in a short moment in channel. As a solution, CWminAS(CWmin Adaptation Scheme) and ACATICT(Adaptive Contention window Adjustment Technique based on Individual Class Traffic) are proposed as active CW control techniques. In previous researches, the contention probabilities for each value of AC were not examined or a single channel based AC value was considered. And the channel-specific demands of IEEE 802.11p and the corresponding contention probabilities were not reflected in the studies. The study considers the collision number of a previous service section and the current network congestion proposes a dynamic control technique ACCW(Adaptive Control of Contention windows in considering the WAVE situation) for CW of the next channel.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.69-72
• /
• 2007

DOCSIS 3.0 Protocol is proposed to make the advance of HFC network. In the DOCSIS based network, the upstream frame is divided into contention section reservation section. CMs to have packets send request messages through the contention section. That two or more CMs sends Request message at the same contention slot makes collison. In this paper, are propose the contention section establlish at algorithm considering of channel-bonding mechanism that is the primary technique of DOCSIS 3.0. Results of simulation display better performance int the number of contention slots and the utilization of contention section.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4259-4271
• /
• 2016

With the increased popularity of IEEE 802.11 WLAN, the density of the WLAN devices per access point has also increased, resulting in throughput performance degradation. One of the solutions to the problem is improving the protocol efficiency by a using multi-round contention scheme. This paper first discusses how to estimate the number of contending stations in a WLAN network by using minimum elapsed backoff counter values that can be easily monitored by each station. An approximate closed form expression is derived for the number of active contending stations using the smallest backoff counter value in the network. We then apply this result to adapt the number of contending rounds according to the network loading level to enhance the throughput performance of a multi-round contention scheme. Through simulation, we show that the accuracy of the estimation algorithm depends on the contention parameters of W and the number of backoff counter observing samples, and found a reasonable value for each parameter. We clearly show that our adaptive multi-round contention scheme outperforms the standard contention scheme that uses a fixed number of rounds.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7B
• /
• pp.455-462
• /
• 2007

The GTS(Guaranteed Time Slot) of IEEE802.15.4 standard, which is the contention free access mechanism, has some problems such as the limited number of deployed devices, the low channel utilization and the service confirm delay. The proposed Cyclic-CFA(Contention Free Access) scheme is a modified polling algorithm that allows a large number of devices to be served Contention Free Access without polling packets. The Cyclic-CFA scheme improves the channel utilization dramatically and also reduces service delay time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.9
• /
• pp.1883-1890
• /
• 2009

Existing MAC protocol can not show good performance in WMN environment. New MAC protocols is proposed because of Mobile Point's mobility, entire distributed environment, heavy traffic problems. This thesis proposes new channel contention method fur Mesh DCF. Mesh DCF uses ACH phase in TDMA frame to perform selection and elimination. Prioritized phases's count m and Fair Elimination phases's count n is determine contention level and make string probability to only one win the contention. Contention Number group's count K to determine the contention level in Fair Elimination Phase gives Fairness but make low probability to only one win the contention. It is sure that enough size of n and K can improve entire performance as result.

• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.56-66
• /
• 2008

Contention-based forwarding in wireless ad-hoc networks reduces transmission failure rate by selecting one receiver with good channel among multiple receivers. However, contention-based forwarding may increase transmission latency due to the collision problem caused by the simultaneous transmission among multiple receivers. In this paper, we present an analytic model that reflects the delay and collision rate of contention-based forwarding in lossy wireless links. Through the analytic model, we calculate the expected delay and progress in one-hop transmission under given wireless link model and delay model. Based on the analytic results, we observe that delay model should be adapted to wireless link model for optimal performance in contention-based forwarding.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.2
• /
• pp.33-43
• /
• 1993

Lock mechanism is essential for synchronization on the multiprocessor systems. Lock mechanism needs to reduce the time for lock operation in low lock contention. Lock mechanism must consider the case of the high lock contention. The conventional lock control scheme in memory results in the increase of bus traffic and memory utilization in lock operation. This paper suggests a lock scheme which stores the lock data in cache and manages it efficiently to reduce the time spent in lock operation when the lock contention is low on a multiprocessor system built on HiPi-bus(Highly Pipelined bus). This paper also presents the design of the HIPi-CLOCK (Highly Pipelined bus Cache LOCK mechanism) which transfere the data from on cache to another when the lock contention is high. The designed simulator compares the conventional lock scheme which controls the lock in memory with the suggested HiPi-CLOCK scheme in terms of the RMW(Read-Modify-Write) operation time using simulated trace. It is shown that the suggested lock control scheme performance is over twice than that of the conventional method in low lock contention. When the lock contention is high, the performance of the suggested scheme increases as the number of the shared lock data increases.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.842-849
• /
• 2000

In this paper, We analyzed the protocol to improve the performance of the multicast traffic processing in WDM networks. In the protocol, control channels are devided into contention-less minislots and contention minislots. And the packets which fail to have successful reservation in the present time slot have priority to have successful reservation in the contention-less minislots of the next time slot. Therefore, control channel contentions and destination conflicts can be reduced with the use of contention-less minislots. For the multicast traffic processing, the theoretical analysis and computer simulation are important to estimate the network performance and to calculate the optimized number of contention-less minislots. In this paper, the state transition probability of the number of contention-less minislots and arrival packets are calculated using 4-dimension matrix. The maximum number of contention-less minislots is equal to the number of channels for maximum performance improvement of the system. It is theoretical analysis and prove to computer simulation the performance of the protocol.