• Title/Summary/Keyword: contention resolution

Search Result 44, Processing Time 0.028 seconds

CRP-CMAC: A Priority-Differentiated Cooperative MAC Protocol with Contention Resolution for Multihop Wireless Networks

  • Li, Yayan;Liu, Kai;Liu, Feng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2636-2656
    • /
    • 2013
  • To improve the cooperative efficiency of node cooperation and multiple access performance for multihop wireless networks, a priority-differentiated cooperative medium access control protocol with contention resolution (CRP-CMAC) is proposed. In the protocol, the helper selection process is divided into the priority differentiation phase and the contention resolution phase for the helpers with the same priority. A higher priority helper can choose an earlier minislot in the priority differentiation phase to send a busy tone. As a result, the protocol promptly selects all the highest priority helpers. The contention resolution phase of the same priority helpers consists of k round contention resolution procedures. The helpers that had sent the first busy tone and are now sending the longest busy tone can continue to the next round, and then the other helpers that sense the busy tone withdraw from the contention. Therefore, it can select the unique best helper from the highest priority helpers with high probability. A packet piggyback mechanism is also adopted to make the high data rate helper with packet to send transmit its data packets to its recipient without reservation. It can significantly decrease the reservation overhead and effectively improve the cooperation efficiency and channel utilization. Simulation results show that the maximum throughput of CRP-CMAC is 74%, 36.1% and 15% higher than those of the 802.11 DCF, CoopMACA and 2rcMAC protocols in a wireless local area network (WLAN) environment, and 82.6%, 37.6% and 46.3% higher in an ad hoc network environment, respectively.

Burst Sending Rate Control Scheme to Improve the Performance of Optical Burst Switching Networks (광 버스트 교환 망의 성능향상을 위한 버스트 전송률 제어 방식)

  • Lee Su kyoung;Kim Lae young
    • 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.

Pre-reservation of Resources and Controlled Loops for Contention Resolution in OBS Networks

  • Comellas, Jaume;Conesa, Josep;Padaro, Salvatore;Junyent, Gabriel
    • ETRI Journal
    • /
    • v.29 no.5
    • /
    • pp.682-684
    • /
    • 2007
  • A new scheme to alleviate contention in optical burst switching networks is proposed. It consists of preventively reserving resources in a node, to be used if resources are busy on the next hop node. The burst is sent back to the preceding node and then resent forward. Simulations are carried out to assess the feasibility of the proposed scheme. Its performance is compared with that of contention resolution based on deflection routing.

  • PDF

A Developed Collision Resolution Algorithm in MAC Protocol for IEEE 802.11b Wireless LANs (ICEIC'04)

  • Chung Kyung Taek;Pan Ce;Park Hyun;Kim Byun Gon;Chon Byoung Sil
    • Proceedings of the IEEK Conference
    • /
    • 2004.08c
    • /
    • pp.681-685
    • /
    • 2004
  • Design of efficient Medium Access Control (MAC) protocols with both high throughput performances is a major focus in distributed contention-based MAC protocol research. In this paper, we propose an efficient contention-based MAC protocol for wireless Local Area Networks, namely, the Developed Collision Resolution (DCR) algorithm. This algorithm is developed based on the following innovative ideas: to speed up the collision resolution, we actively redistribute the backoff timers for all active nodes; to reduce the average number of idle slots, we use smaller contention window sizes for nodes with successful packet transmissions and reduce the backoff timers exponentially fast when a fixed number of consecutive idle slots are detected. We show that the proposed DCR algorithm provides high throughput performance and low latency in wireless LANs.

  • PDF

New Contention Resolution algorithm for Optical Burst Switch (광 버스트 스위치를 위한 새로운 충돌 해결 알고리즘)

  • Jeong Myoung Soon;Eom Jin seob
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.12A
    • /
    • pp.1285-1290
    • /
    • 2004
  • In this paper, a new algorithm for contention resolution in optical burst switched network is proposed and simulated. The proposed algorithm is made from the all mixing of wavelength conversion, deflection routing, segmentation, and optical fiber delay line buffering. We analysis the performance of the proposed contention resolution algorithm by using ns-2. The application of the algorithm into Korea backbone network shows the superior performance of a low burst loss probability.

Analysis of Three-Phase Multiple Access with Continual Contention Resolution (TPMA-CCR) for Wireless Multi-Hop Ad Hoc Networks

  • Choi, Yeong-Yoon;Nosratinia, Aria
    • Journal of Communications and Networks
    • /
    • v.13 no.1
    • /
    • pp.43-49
    • /
    • 2011
  • In this paper, a new medium access control (MAC) protocol entitled three-phase multiple access with continual contention resolution (TPMA-CCR) is proposed for wireless multi-hop ad hoc networks. This work is motivated by the previously known three-phase multiple access (TPMA) scheme of Hou and Tsai [2] which is the suitable MAC protocol for clustering multi-hop ad hoc networks owing to its beneficial attributes such as easy collision detectible, anonymous acknowledgment (ACK), and simple signaling format for the broadcast-natured networks. The new TPMA-CCR is designed to let all contending nodes participate in contentions for a medium access more aggressively than the original TPMA and with continual resolving procedures as well. Through the systematical performance analysis of the suggested protocol, it is also shown that the maximum throughput of the new protocol is not only superior to the original TPMA, but also improves on the conventional slotted carrier sense multiple access (CSMA) under certain circumstances. Thus, in terms of performance, TPMA-CCR can provide an attractive alternative to other contention-based MAC protocols for multi-hop ad hoc networks.

The Performance Comparison for the Contention Resolution Policies of the Input-buffered Crosspoint Packet Switch

  • Paik, Jung-Hoon;Lim, Chae-Tak
    • Journal of Electrical Engineering and information Science
    • /
    • v.3 no.1
    • /
    • pp.28-35
    • /
    • 1998
  • In this paper, an NxN input-buffered crosspoint packet switch which selects a Head of the Line, HOL, packet in contention randomly is analyzed with a new approach. The approach is based on both a Markov chain representation of the input buffer and the probability that a HOL packet is successfully served. The probability as a function of N is derived, and it makes it possible to express the average packet delay and the average number of packets in the buffer as a function of N. The contention resolution policy based on the occupancy of the input buffer is also presented and analyzed with this same approach and the relationship between two selection policies is analyzed in terms of the occupancy of the input buffer.

  • PDF

A machine learning assisted optical multistage interconnection network: Performance analysis and hardware demonstration

  • Sangeetha Rengachary Gopalan;Hemanth Chandran;Nithin Vijayan;Vikas Yadav;Shivam Mishra
    • ETRI Journal
    • /
    • v.45 no.1
    • /
    • pp.60-74
    • /
    • 2023
  • Integration of the machine learning (ML) technique in all-optical networks can enhance the effectiveness of resource utilization, quality of service assurances, and scalability in optical networks. All-optical multistage interconnection networks (MINs) are implicitly designed to withstand the increasing highvolume traffic demands at data centers. However, the contention resolution mechanism in MINs becomes a bottleneck in handling such data traffic. In this paper, a select list of ML algorithms replaces the traditional electronic signal processing methods used to resolve contention in MIN. The suitability of these algorithms in improving the performance of the entire network is assessed in terms of injection rate, average latency, and latency distribution. Our findings showed that the ML module is recommended for improving the performance of the network. The improved performance and traffic grooming capabilities of the module are also validated by using a hardware testbed.

Statistical Estimation of the Number of Contending Stations and its Application to a Multi-round Contention Resolution Scheme

  • Jang, Seowoo;Choi, Jin-Ghoo;Yoon, Sung-Guk
    • 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.