• Title/Summary/Keyword: Contention Area

Search Result 71, Processing Time 0.026 seconds

A New Backoff algorithm considering Hop Count for the IEEE 802.11 Distributed Coordination Function

  • Nam, Jae-Hyun
    • 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.

DF(Dynamic and Flexible)-MAC : A Flexible MAC Protocol for WBAN (DF(Dynamic and Flexible)-MAC : WBAN을 위한 유연한 MAC 프로토콜)

  • Seo, Young-Sun;Kim, Dae-Young;Kim, Beom-Seok;Cho, Jin-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.8A
    • /
    • pp.712-722
    • /
    • 2011
  • Wireless body area network(WBAN) provide communication service in the vicinity of the body. Since WBANs utilize both MICS frequency band for implant medical applications and ISM frequency band for medical and consumer electronics(CE) applications. Therefore, MAC protocols in WBAN should be designed considering flexibility between medical and CE applications. In this paper, we identify the requirements of WBAN MAC protocols and propose a WBAN MAC protocol which satisfies the requirements. In other to provide transmission flexibility for various applications. we present the dynamic CFP allocation and opportunity period. Extensive simulation result show that the proposed protocol achieves improved throughput and latency in WEAN environment cimpared with IEEE 802.15.4.

Contention-Free Access Protocol Based Energy-Efficient Transmission for Wireless PANs (비경쟁 접근 프로토콜 기반 WPAN을 위한 에너지 효율적인 전송기법)

  • Joo, Yang-Ick;Lee, Yeon-Woo;Jung, Min-A;Choi, Myeong-Soo;Kim, Seo-Gyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4A
    • /
    • pp.450-457
    • /
    • 2008
  • One of very essential techniques for enlarging lifetime of energy-constrained wireless personal area network (WPAN) devices is energy-efficient transmission technique. If the WPAN is operated based on a TDMA protocol, the satisfaction of QoS requirements at each allocated time slot is another important factor to be considered. We therefore propose an energy-efficient transmission scheme for WPANs operating with a contention-free medium access protocol such as TDMA, as well as satisfying QoS requirement. The proposed algorithm determines the optimum combination of transmit power, physical data rate and fragment size required to simultaneously minimize the energy consumption and satisfy the required QoS in each assigned time duration, considering all the possible energy-minimization related parameters. The proposed algorithm demonstrated the improved performance results in terms of throughput and energy consumption via computer simulation.

Tiered-MAC: An Energy-Efficient Hybrid MAC Protocol for Wireless Sensor Networks (Tiered-MAC: 무선 센서 네트워크를 위한 에너지 효율적인 하이브리드 MAC 프로토콜)

  • Lee, Han-Sun;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.1
    • /
    • pp.42-49
    • /
    • 2010
  • Because sensor nodes operate with the limited power based on battery which cannot be easily replaced, energy efficiency is a fundamental issue pervading the design of communication protocols developed for wireless sensor networks. In wireless networks, energy efficient MAC protocols can usually be described as being either a contention-based protocol or a schedule-based protocol. It is suitable to use combination of both contention-based protocol and schedule-based protocol, because the strengths and weaknesses of these protocols are contrary to each other. In this paper, in order to minimize energy consumption of sensor nodes and maximize network lifetime, we propose a new MAC protocol called "Tiered-MAC" The Tiered-MAC uses a schedule-based TDMA inside maximum transmission range of sink node and a contention-based CSMA otherwise. Therefore, by efficiently managing the congested traffic area, the Tiered-MAC reduces the unnecessary energy consumption. Based on the ns-2 simulation result, we prove that the Tiered-MAC improves the energy-efficiency of sensor network nodes.

A Developed Collision Resolution Algorithm in MAC Protocol for IEEE 802.11b Wireless LANs (IEEE 802.11b 무선 LAN의 MAC 프로토콜을 위한 개선된 충돌 해결 알고리즘)

  • Pan Ce;Park Hyun;Kim Byun-Gon;Chung Kyung-Taek;Chon Byoung-Sil
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.6 s.324
    • /
    • pp.33-39
    • /
    • 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.

A Design of Parallel Turbo Decoder based on Double Flow Method Using Even-Odd Cross Mapping (짝·홀 교차 사상을 이용한 Double Flow 기법 기반 병렬 터보 복호기 설계)

  • Jwa, Yu-Cheol;Rim, Chong-Suck
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.7
    • /
    • pp.36-46
    • /
    • 2017
  • The turbo code, an error correction code, needs a long decoding time since the same decoding process must be repeated several times in order to obtain a good BER performance. Thus, parallel processing may be used to reduce the decoding time, in which case there may be a memory contention that requires additional buffers. The QPP interleaving has been proposed to avoid such case, but there is still a possibility of memory contention when a decoder is constructed using the so-called double flow technique. In this paper, we propose an even-odd cross mapping technique to avoid memory conflicts even in decoding using the double-flow technique. This method uses the address generation characteristic of the QPP interleaving and can be used to implement the interleaving circuit between the decoding blocks and the LLR memory blocks. When the decoder implemented by applying the double flow and the proposed methods is compared with the decoder by the conventional MDF techniques, the decoding time is reduced by up to 32% with the total area increase by 8%.

Group Node Contention Algorithm for Avoiding Continuous Collisions in LR-WPAN (무선 저속 PAN에서 연속된 충돌 회피를 위한 그룹 노드 경쟁 알고리즘)

  • Lee, Ju-Hyun;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12B
    • /
    • pp.1066-1074
    • /
    • 2008
  • In this paper, we proposed an efficient algorithm using pulse signal based on group-node-contention in LR-WPAN. The purpose of IEEE 802.15.4 is low speed, low cost and low power consumption. Recently, as applications of LR-WPAN have been extended, there is a strong probability of collision as well and almost collision occurs because of hidden node problem. Moreover, if the collision continuously occurs due to hidden node collision, network performance could be decreased. Nowadays, although several papers focus on the hidden node collision, algorithms waste the channel resource if continuous collisions frequently occur. In this paper, we assume that PAN has been already formed groups, and by using pulse signal, coordinator allocates channel and orders, and then, nodes in the allocated group can compete each other. Hence, contention nodes are reduced significantly, channel wastage caused by collision is decreased, and data transmission rate is improving. Finally, this algorithm can protect the network from disruption caused by frequent collisions. Simulation shows that this algorithm can improve the performance.

The IEEE 802.11 MAC Protocol to solve Unfairness Problem in Multihop Wireless Ad Hoc Networks (다중 무선 에드혹 네트워크에서 불공정 문제를 해결하기 위한 802.11 MAC 프로토콜)

  • Nam, Jae-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.6
    • /
    • pp.229-234
    • /
    • 2007
  • In the IEEE 802.11 Wireless Local Area Networks (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. The BEB scheme suffers from a unfairness problem and low throughput under high traffic load. In this paper, I propose a new backoff algorithm for use with the IEEE 802.11 Distributed Coordination Function.

  • PDF

IEEE 802.11 MAC based Multi-hop Reservation and Backoff Scheme in MIMC Tactical Ad Hoc Networks (전술 애드 혹 네트워크에서 다중 홉 전송을 위한 자원 예약 및 백오프 기법)

  • Cho, Youn-Chul;Yoon, Sun-Joong;Ko, Young-Bae
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.15 no.1
    • /
    • pp.16-27
    • /
    • 2012
  • In multi-interface multi-channel(MIMC) based tactical ad hoc networks, QoS support for required operational capacity is one of the main challenging issues for multi-hop transmissions. To support QoS in such a harsh environment, we propose a novel MAC scheme to minimize multi-hop as well as per-hop delay. The current IEEE 802.11 MAC protocols should contend to reserve the channel resource at every hop by each sender. The every-hop channel contention results in a degradation of end-to-end delay for multi-hop transmissions. The basic idea of our scheme is to make a "multi-hop reservation" at the MAC layer by using the modified RTS frame. It contains additional information such as destination information, packet priority, and hop count, etc. In addition, we differentiate the contention window area according to the packet priority and the number of hops to deliver packets in the predefined allowed latency. Our scheme can minimize the multi-hop delay and support the QoS of the critical data in real time(i.e., VoIP, sensing video data, Video conference between commanders). Our simulation study and numerical analysis show that the proposed scheme outperforms the IEEE 802.11 MAC.

The IEEE 802.11 MAC Protocol to solve Unfairness Problem in Multihop Wireless Ad Hoc Networks (다중 무선 에드혹 네트워크에서 불공정 문제를 해결하기 위한 802.11 MAC 프로토콜)

  • Nam, Jae-Hyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.91-94
    • /
    • 2007
  • In the IEEE 802.11 Wireless Local Area Networks (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. The BEB scheme suffers from a fairness problem and low throughput under high traffic load. In this paper, I propose a new backoff algorithm for use with the IEEE 802.11 Distributed Coordination Function.

  • PDF