Mathematical and simulation analysis of contention resolution mechanism for IEEE 802.11ah networks

Gopinath, A.; Nithya, B.

doi:10.1016/j.comcom.2018.04.006

Cited by 25 publications

(20 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…There are some drawbacks in BEB that are worth to be mentioned. Firstly, the rapid growth in the value of CW can cause the average delay to increase exponentially [6]. Besides, BEB deals with any noise corruption as a frame collision, so this increases its vulnerability to more frame collision.…”

Section: Plos Onementioning

confidence: 99%

“…From Eq 14, we may consider several events that may occur in a shared medium. The first case is the probability where no station is using the shared medium, or an idle status of the channel can be determined with P idle [6]. The second case is the indication of at least a single station within a randomly selected slot of time transmits a data packet can be determined through the probability of P tr [7,42,43].…”

Section: Plos Onementioning

confidence: 99%

“…Fig 10 [ 6 ] illustrates the 2-D discrete-time Markov chain model. There are a finite number of transition states in certain time slot duration, and the moving probability of each state to the subsequent state relies on the prior state event.…”

Section: Proposed Prsca Backoff Algorithmmentioning

confidence: 99%

“…Nonetheless, the RAW protocol is depending on the traditional distributed coordination function (DCF) and the enhanced distributed channel access (EDCA) [5]. Both channel access methods of DCF and EDCA utilize the algorithm of binary exponential backoff (BEB) despite the fact that many researchers have shown and proved that BEB has a major drawback of very high collision probability [6].…”

Section: Introductionmentioning

confidence: 99%

“…The PRS is used due to its better characteristics comparing to the exponential sequence of traditional BEB in terms of rate of growth, fast integers generation, and high quality of sequence that can adapt with various congestion scenarios. Thereafter, a discrete 2-D Markov model is developed with inspiration from the well-known model of Bianchi [7] and similar to that of Gopinath et al [6].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Pseudorandom sequence contention algorithm for IEEE 802.11ah based internet of things network

et al. 2020

View full text Add to dashboard Cite

The IEEE 802.11ah standard relies on the conventional distributed coordination function (DCF) as a backoff selection method. The DCF is utilized in the contention-based period of the newly introduced medium access control (MAC) mechanism, namely restricted access window (RAW). Despite various advantages of RAW, DCF still utilizes the legacy binary exponential backoff (BEB) algorithm, which suffers from a crucial disadvantage of being prone to high probability of collisions with high number of contending stations. To mitigate this issue, this paper investigates the possibility of replacing the existing exponential sequence (i.e., as in BEB) with a better pseudorandom sequence of integers. In particular, a new backoff algorithm, namely Pseudorandom Sequence Contention Algorithm (PRSCA) is proposed to update the CW size and minimize the collision probability. In addition, the proposed PRSCA incorporates a different approach of CW freezing mechanism and backoff stage reset process. An analytical model is derived for the proposed PRSCA and presented through a discrete 2-D Markov chain model. Performance evaluation demonstrates the efficiency of the proposed PRSCA in reducing collision probability and improving saturation throughput, network throughput, and access delay performance.

show abstract

Section: Plos Onementioning

confidence: 99%

Section: Plos Onementioning

confidence: 99%

Section: Proposed Prsca Backoff Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Pseudorandom sequence contention algorithm for IEEE 802.11ah based internet of things network

et al. 2020

View full text Add to dashboard Cite

show abstract

An energy‐efficient priority‐based packet scheduling mechanism for enhancing quality of service in mobile ad hoc network

Bhavadharini¹,

Karthik²,

Sabitha

2021

Concurrency and Computation

View full text Add to dashboard Cite

In today's world, a mobile ad hoc network plays a predominant role for numerous applications such as education, entertainment, emergency services, tactical services, and home applications. The performance of IEEE 802.11 based wireless ad hoc networks degrades due to high contention for the shared medium among multiple ad hoc nodes.However, the shared medium can be accessed by multiple nodes, which causes link collisions and packet drop at the link level. These kinds of packet drops have a direct impact on the overall performance of the transmission control protocol (TCP). In this article, a new robust prioritized packet scheduling with adaptive backoff window (PPSAB) mechanism has been proposed to enhance the quality of service of TCP in the wireless scenario. In order to determine the congestion in the network, the proposed PPSAB mechanism anticipates the cross-layer parameters instead of transport layer parameters. The proposed access scheme assures minimized collisions and energy by setting the node level access to prevailing network parameters. The performance of the proposed PPSAB has been evaluated using an NS-2 environment and the results manifest that the normalized overhead is reduced by 20% and network throughput is increased by 17% than the existing methods. K E Y W O R D Senergy consumption, mobile ad hoc network, prioritized packet scheduling, quality of service INTRODUCTIONThe rapid development of wireless communication demands uninterrupted network connectivity among the communicating. Typically, mobile ad hoc network (MANET) is the collection of self-organizing and self-configuring mobile nodes which is not dependent on any stable and central coordinating infrastructure. The mobility of the nodes makes the topology of the network changes dynamically and the nodes may join and leave the network at any instance. 1 IEEE 802.11 ascertains single-hop reliability at medium access control (MAC) layer in MANETs.Two types of medium access techniques are generally utilized in IEEE 802.11. The first method, the distributed coordinated function enables the data flow among communicating devices while requiring no control infrastructure. Second, point coordinated function in which a central coordinator controls access to the shared wireless channel. 2,3 The basic channel access method exploited in distributed coordinated function is carrier sense multiple access collision and avoidance by the nodes. Every time, the shared channel is sensed by the node before data transmission and the node can transmit data if the medium is free or defer transmission until the medium becomes free.

show abstract

Performance analysis of randomized arbitration interframe space tuning algorithm for enhanced distributed channel access in IEEE 802.11p based vehicular network

Antony

Balasubramanian

2020

Trans Emerging Tel Tech

View full text Add to dashboard Cite

The Internet of Vehicle (IoV) aims to provide efficient vehicular communication by enhancing connectivity and user safety. IEEE 802.11p, a medium access control protocol, plays a vital role in the IoV protocol stack, which uses the enhanced distributed channel access (EDCA) method for channel contention. To deal with safety and nonsafety vehicular applications, EDCA adopts four access categories (AC), and each AC manages the channel access based on the priority of packets along with the contention window size and arbitration interframe spacing number (AIFSN). However, these contention parameters are fixed for each AC, and it does not account the real‐time network traffic. Hence, the fine‐tuning of AIFSN values and maintaining strict priority are challenging tasks for the highly dynamic vehicular network. To address these issues, this article proposes a novel probabilistic approach, namely, the randomized AIFSN tuning (RAT) algorithm for EDCA. It updates AIFSN value for every retransmission based on the vehicle density and contention intensity by preserving the strict priority behavior of the AC queues. A three‐dimensional Markov model is developed to analyze the proposed algorithm in terms of collision probability and throughput. The proposed RAT algorithm is simulated using the NS3 network simulator along with simulations for urban mobility (SUMO) for the real‐time traffic, and results are compared with other related algorithms in terms of packet loss, goodput, packet delivery ratio, and delay of each AC queue. These results reveal that the proposed RAT algorithm outperforms related algorithms under varying vehicle density.

show abstract

Mathematical and simulation analysis of contention resolution mechanism for IEEE 802.11ah networks

Cited by 25 publications

References 12 publications

Pseudorandom sequence contention algorithm for IEEE 802.11ah based internet of things network

Pseudorandom sequence contention algorithm for IEEE 802.11ah based internet of things network

An energy‐efficient priority‐based packet scheduling mechanism for enhancing quality of service in mobile ad hoc network

Performance analysis of randomized arbitration interframe space tuning algorithm for enhanced distributed channel access in IEEE 802.11p based vehicular network

Contact Info

Product

Resources

About