MAC layer performance analysis of multi-hop ad hoc networks

Alizadeh-Shabdiz, F.; Subramaniam, Suresh

doi:10.1109/glocom.2004.1378861

Cited by 16 publications

(4 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Apart from the assumption explained above, previous research papers [8,12] are based on the variable slot and use the relevant equation for the transmission probability τ and an expression of the form p = 1 − (1 − τ ) Tv (where Tv is the duration of the vulnerable period normalised to σ) for the conditional collision probability p. We claim that these modeling techniques have an important limitation. In fact, in the conventional modeling it is implied that if we discretised time into these variable slots, then the channel state would be described as a succession of 1/τ − 1 non-transmitting backoff slots followed by a transmitting slot (with collision or success) and the same pattern being repeated.…”

Section: Motivationmentioning

confidence: 96%

“…11, there has been much research effort put into the theoretical analysis of one-hop wireless LANs, with the most prominent paper being [7]. However, as we will show in Section 2, a simple extension of [7] which is followed by many researchers in the field [8,12] is not appropriate for a network exhibiting hidden terminals. Another frequent assumption is the one of synchronisation among the nodes which simplifies the analysis by the use of renewal theory [10,12].…”

Section: Introductionmentioning

confidence: 98%

See 1 more Smart Citation

Insights into the hidden node problem

Tsertou

Laurenson

2006

Proceedings of the 2006 International Conference on Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

A promising new class of wireless networks has recently emerged, the so-called Wireless Mesh Networks (WMNs). WMNs inherit many advantages from both wired infrastructure and also ad-hoc networks. However, in spite of their distinct characteristics, they also face many technical problems that were present in older classes of wireless networks, such as wireless LANs or pure ad-hoc networks. The much discussed hidden terminal problem is one of them. We argue that an accurate analysis of the effect of hidden nodes in the performance of a random access protocol is still an open issue. In this paper we show the problems and the limitations stemming from common assumptions used in the literature and propose a novel method of modeling time that uses a fixed size channel slot as the unit of time in order to take into account the desynchronisation of nodes. Finally we apply our general method to the classic hidden terminal problem incorporating an iterative step. The proposed analytical model is shown to have a very good match to simulation results for an IEEE 802.11 MAC protocol.

show abstract

Section: Motivationmentioning

confidence: 96%

Section: Introductionmentioning

confidence: 98%

Insights into the hidden node problem

Tsertou

Laurenson

2006

Proceedings of the 2006 International Conference on Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…Models in refs. [13][14][15] investigated the throughput with non-saturated traffic in multi-hop ad hoc networks. However, there has been no solution to present the end-to-end delay under non-saturated traffic in a multi-hop scenario to the best of our knowledge.…”

Section: Introductionmentioning

confidence: 99%

Packet delay analysis on IEEE 802.11 DCF under finite load traffic in multi-hop ad hoc networks

Dong

Shu

Chen

et al. 2008

Sci. China Ser. F-Inf. Sci.

View full text Add to dashboard Cite

In this paper, the average packet delay on IEEE 802.11 DCF under finite load traffic in multi-hop ad hoc networks is analyzed. We employ a Markov chain model to analyze the probability of transmission at each node in an arbitrary slot and derive the channel access delay. We model each node using an M/G/1 queue and derive the queueing delay. The model is extended from analyzing the single-hop average packet delay to evaluating the end-to-end packet delay in multi-hop ad hoc networks without assuming the traffic to be in a saturation state. To validate our analytic results, we have done extensive simulation. The analytic and the simulation results match very well. IEEE 802.11 DCF, packet delay, multi-hop, finite load

show abstract

“…A wireless ad hoc network does not require any infrastructure support in order to provide any type of communication among nodes [1]. MAC protocols are used for multiple nodes to share scarce wireless bandwidth in an orderly and efficient manner [2]. Recently, quality-of-service (QoS) is more and more important and necessary for real-time traffic such as voice and video [3].…”

Section: Introductionmentioning

confidence: 99%