IEEE 802.11a Throughput Performance with Hidden Nodes

Ekici, Özgür; Yongaçoğlu, Abbas

doi:10.1109/lcomm.2008.080209

Cited by 72 publications

(56 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Simulation [39] shows that Bianchi's model [9] is not valid for the analysis of DCF networks with the presence of hidden terminals. Several studies [40,41,42,43,44,45] were proposed to model the eect of hidden terminals on the overall network performance. These studies can be divided into two groups: The rst group [40,46,41] considers networks with small numbers of nodes and only two contending stations.…”

Section: Performance Analysis Of Dcf In Single-cell Wireless Networkmentioning

confidence: 99%

“…These studies can be divided into two groups: The rst group [40,46,41] considers networks with small numbers of nodes and only two contending stations. The second group [42,43,44,45] performs the analysis for large numbers of contending nodes in the network. The rst group of models are fairly accurate; however, they cannot be used for realistic network scenarios because of lack of clarity in terms of how they may be extended to networks with large number of active nodes (e.g.…”

Section: Performance Analysis Of Dcf In Single-cell Wireless Networkmentioning

confidence: 99%

“…A model was presented by Ekici and Yongacoglu [42], which was concerned with the calculation of the collision probability between contending nodes and hidden terminals in a centralised WLAN. Similarly, Tsertou et al [43] presented a model based on conditional collision probability between two contending pairs in the context of an ad hoc network.…”

Section: Performance Analysis Of Dcf In Single-cell Wireless Networkmentioning

confidence: 99%

“…However, their model can only be used in a network with hidden terminals present. 7 If P τ i denote the channel access probability in a randomly chosen slot time, then based on [42,43] the probability that a hidden terminal will not transmit during the vulnerable period τ V is (1 − P…”

Section: Performance Analysis Of Dcf In Single-cell Wireless Networkmentioning

confidence: 99%

See 3 more Smart Citations

Game theoretic approach to medium access control in wireless networks

Najafabadi

Constantinou

2013

2013 IEEE Wireless Communications and Networking Conference (WCNC)

View full text Add to dashboard Cite

Wireless networking is fast becoming the primary method for people to connect to the Internet and with each other. The available wireless spectrum is increasingly congested, with users demanding higher performance and reliability from their wireless connections. This thesis proposes a game-theoretic random access model, compliant with the IEEE 802.11 standard, that can be integrated into the distributed coordination function (DCF). The objective is to design a game theoretic model that potentially optimizes throughput and fairness in each node independently and, therefore, minimise channel access delay. This dissertation presents a game-theoretic MAC layer implementation for single-cell networks and centralised DCF in the presence of hidden terminals to show how game theory can be applied to improve wireless performance. A utility function is proposed, such that it can decouple the protocol's dynamic adaptation to channel load from collision detection. It is demonstrated that the proposed model can reach a Nash equilibrium that results in a relatively stable contention window, provided that a node adapts its behaviour to the idle rate of the broadcast channel, coupled with observation of its own transmission activity.This dissertation shows that the proposed game-theoretic model is capable of achieving much higher throughput than the standard IEEE 802.11 DCF with better short-time fairness and signicant improvements in the channel access delay.To my parents and my sister

show abstract

Section: Performance Analysis Of Dcf In Single-cell Wireless Networkmentioning

confidence: 99%

Section: Performance Analysis Of Dcf In Single-cell Wireless Networkmentioning

confidence: 99%

Section: Performance Analysis Of Dcf In Single-cell Wireless Networkmentioning

confidence: 99%

Section: Performance Analysis Of Dcf In Single-cell Wireless Networkmentioning

confidence: 99%

See 2 more Smart Citations

Game theoretic approach to medium access control in wireless networks

Najafabadi

Constantinou

2013

2013 IEEE Wireless Communications and Networking Conference (WCNC)

View full text Add to dashboard Cite

show abstract

“…In [2], the author introduces a two-dimensional Markov chain to represent backoff behavior, and derives the throughput in the saturated situation. In [3,4], the authors extend [2] so as to consider the influence of hidden nodes. These work can describe accurate behavior of 802.11 DCF, but the derived formula is complex and it is difficult to understand the characteristics easily from the formula.…”

Section: Introductionmentioning

confidence: 99%

Simple analytical method for wireless distributed networks considering contending and hidden nodes

Okada

Mase

2012

IEICE ComEX

View full text Add to dashboard Cite

Abstract:In this letter, we introduce a simple analytical model for wireless distributed networks (WDNs) using IEEE 802.11 distributed coordination function (DCF), which considers contending and hidden nodes. Furthermore, we derive simple formulas of throughput for maximum and saturated cases, and discuss the characteristics of the influence of the contending and hidden nodes. We also compare the analytical results with the simulation of 802.11 DCF. Although our analytical model simplifies the behavior of 802.11 DCF, analytical results coincide with the simulation. Keywords: wireless distributed network, queueing model, exposed node problem, hidden node problem Classification: Terrestrial Wireless Communication/Broadcasting Technologies References

show abstract