• Title/Summary/Keyword: Contention Area

Search Result 71, Processing Time 0.021 seconds

A Study on the Contention Area Establish of Algorithm from Cable Network based on DOCSIS 3.0 (DOCSIS 3.0 기반 케이블망에서의 경쟁구간 설정 알고리즘에 관한 연구)

  • Kim, Young-Sung;Song, Jae-Jun;Roh, Sun-Sik
    • 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.

  • PDF

CDASA-CSMA/CA: Contention Differentiated Adaptive Slot Allocation CSMA-CA for Heterogeneous Data in Wireless Body Area Networks

  • Ullah, Fasee;Abdullah, Abdul Hanan;Abdul-Salaam, Gaddafi;Arshad, Marina Md;Masud, Farhan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.12
    • /
    • pp.5835-5854
    • /
    • 2017
  • The implementation of IEEE 802.15.6 in Wireless Body Area Network (WBAN) is contention based. Meanwhile, IEEE 802.15.4 MAC provides limited 16 channels in the Superframe structure, making it unfit for N heterogeneous nature of patient's data. Also, the Beacon-enabled Carrier-Sense Multiple Access/Collision-Avoidance (CSMA/CA) scheduling access scheme in WBAN, allocates Contention-free Period (CAP) channels to emergency and non-emergency Biomedical Sensors (BMSs) using contention mechanism, increasing repetition in rounds. This reduces performance of the MAC protocol causing higher data collisions and delay, low data reliability, BMSs packet retransmissions and increased energy consumption. Moreover, it has no traffic differentiation method. This paper proposes a Low-delay Traffic-Aware Medium Access Control (LTA-MAC) protocol to provide sufficient channels with a higher bandwidth, and allocates them individually to non-emergency and emergency data. Also, a Contention Differentiated Adaptive Slot Allocation CSMA-CA (CDASA-CSMA/CA) for scheduling access scheme is proposed to reduce repetition in rounds, and assists in channels allocation to BMSs. Furthermore, an On-demand (OD) slot in the LTA-MAC to resolve the patient's data drops in the CSMA/CA scheme due to exceeding of threshold values in contentions is introduced. Simulation results demonstrate advantages of the proposed schemes over the IEEE 802.15.4 MAC and CSMA/CA scheme in terms of success rate, packet delivery delay, and energy consumption.

Limited Contention Scheme(LCS) to Reduce Collision in LR-WPAN (LR-WPAN에서 충돌을 줄이기 위한 제한경쟁 기법)

  • Ko, Su-Hwan;Lee, Jong-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.5B
    • /
    • pp.310-317
    • /
    • 2008
  • Data collision in LR-WPAN(Low Rate Wireless Personal Area Network) causes retransmission of which energy consumption may reduce life of the entire network. Furthermore LR-WPAN is very sensitive to collision as it has relatively fewer frequencies of backoff retries. LCS(Limited Contention Scheme) suggested in this study is a way to transmit data by certain groups of the total nodes so that it can reduce possibilities of data collision and retransmission by decreasing the number of competing nodes. As a result LCS can increase a throughput and the life of the entire network. As using LCS in designing LR-WPAN in the future can extend battery life, LCS can be useful in any application that requires low energy consumption.

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.

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

Contention Free Period Allocation by Axiomatic Bargaining Game in Multi-WBAN Overlapped Environment (중첩된 다수의 WBAN 환경에서 공리적 Bargaining Game를 이용한 비경쟁구간 할당방안)

  • Su, Wei-Dong;Shin, Sang-Bae;Cho, Jin-Sung
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06d
    • /
    • pp.246-248
    • /
    • 2012
  • In this paper, we recommend some game theoretical schemes try to get reliability transmission and resource allocation of the contention free period in overlapped WBAN(Wireless Body Area Net works) environment. Cooperative bargaining game is considered to guarantee a reliability conflict-free transmission. We study it by considering the priorty of device and the demand number of allocated timeslots in the CFP (Contention Free Period), and guarantee the least requested timeslots through bargaining between each user.

Design and Evaluation of a Contention-Based High Throughput MAC with Delay Guarantee for Infrastructured IEEE 802.11WLANs

  • Kuo, Yaw-Wen;Tsai, Tung-Lin
    • Journal of Communications and Networks
    • /
    • v.15 no.6
    • /
    • pp.606-613
    • /
    • 2013
  • This paper proposes a complete solution of a contention-based medium access control in wireless local networks to provide station level quality of service guarantees in both downstream and upstream directions. The solution, based on the mature distributed coordination function protocol, includes a new fixed contention window backoff scheme, a tuning procedure to derive the optimal parameters, a super mode to mitigate the downstream bottleneck at the access point, and a simple admission control algorithm. The proposed system guarantees that the probability of the delay bound violation is below a predefined threshold. In addition, high channel utilization can be achieved at the same time. The numerical results show that the system has advantages over the traditional binary exponential backoff scheme, including efficiency and easy configuration.

A Model for Analyzing the Performance of Wireless Multi-Hop Networks using a Contention-based CSMA/CA Strategy

  • Sheikh, Sajid M.;Wolhuter, Riaan;Engelbrecht, Herman A.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.5
    • /
    • pp.2499-2522
    • /
    • 2017
  • Multi-hop networks are a low-setup-cost solution for enlarging an area of network coverage through multi-hop routing. Carrier sense multiple access with collision avoidance (CSMA/CA) is frequently used in multi-hop networks. Multi-hop networks face multiple problems, such as a rise in contention for the medium, and packet loss under heavy-load, saturated conditions, which consumes more bandwidth due to re-transmissions. The number of re-transmissions carried out in a multi-hop network plays a major role in the achievable quality of service (QoS). This paper presents a statistical, analytical model for the end-to-end delay of contention-based medium access control (MAC) strategies. These strategies schedule a packet before performing the back-off contention for both differentiated heterogeneous data and homogeneous data under saturation conditions. The analytical model is an application of Markov chain theory and queuing theory. The M/M/1 model is used to derive access queue waiting times, and an absorbing Markov chain is used to determine the expected number of re-transmissions in a multi-hop scenario. This is then used to calculate the expected end-to-end delay. The prediction by the proposed model is compared to the simulation results, and shows close correlation for the different test cases with different arrival rates.

A Fair Contention Channel Assignment Scheme for Emergency data -First-Priority MAC in Wireless Body Area Networks (WBAN에서 응급데이타 퍼스트 우선순위 MAC을 위한 공정한 경쟁 채널 할당 방법)

  • Lee, Jung-Jae
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.13 no.5
    • /
    • pp.995-1002
    • /
    • 2018
  • A Contention Access Period(: CAP) with high contention in priority-based MAC protocols can result in higher number of collisions and retransmissions. High-Priority traffic dominates low-priority traffic during CAP depleting low-priority traffic, adversely affecting WBAN throughput, delay, and energy consumption. This paper proposes a Emergency data-First-Priority MAC(: EFP-MAC) superframe structure that is able to reduce contention in the CAP period, and provides a fair chance for low-priority traffic. As a result, the proposed Emergency data-First Priority MAC(; EFP-MAC) The Simulation results show that the proposed MAC achieves lower energy consumption, higher throughput and low latency than the IEEE 802.15.4 standard.

Design and Performance Analysis of a Contention-Based Reservation Protocol for a Local Area Optical Internet

  • Choi, Jin-Seek;Lee, Jang-Won;Kang, Min-Ho
    • ETRI Journal
    • /
    • v.24 no.2
    • /
    • pp.142-152
    • /
    • 2002
  • In this paper, we propose and analyze a new multiple access protocol for a local area optical Internet based on a wavelength division multiplexing technique which uses a passive star coupler. The proposed contention-based reservation protocol can support variable-length as well as fixed-length messages for transporting Internet packets with one reservation of a minislot at the beginning of a packet transmission. The minislot is used to reserve the data channel on the basis of the slotted ALOHA protocol and the control node ensures subsequent message transmission on the same wavelength. Thus, all messages need not be broken down to many fixed-length packets, and consecutive messages are transmitted through the same wavelength. Moreover, the proposed protocol reduces the collision probability of minislots and improves wavelength utilization. We determine the maximum throughput and verify the results with simulation.

  • PDF