An analytical model of delay in multi-hop wireless ad hoc networks

Ghadimi, Euhanna; Khonsari, Ahmad; Diyanat, Abolfazl; Farmani, Mojtaba; Yazdani, Nasser

doi:10.1007/s11276-011-0372-5

Cited by 33 publications

(21 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors have calculated the various probabilities and throughput performance of the system with saturated nodes by providing the Markov chain model for back‐off window size. In another work, a Markov chain model for single node using IEEE 802.11 has been presented by Ghadimi et al This model is established on Bianchi's work . The authors have measured end‐to‐end delay for multi‐hop wireless ad hoc networks by considering hidden and exposed terminal conditions under unsaturated traffic.…”

Section: Related Workmentioning

confidence: 99%

Throughput and delay analysis of directional‐location aided routing protocol for vehicular ad hoc networks

Pandey

Raina

Raw

et al. 2016

Int J Communication

View full text Add to dashboard Cite

Summary Vehicular ad hoc networks is an integral component of intelligent transportation systems and it is an important requisite for smarter cities. Network formation and deformation among the vehicles are very frequent because of the variation in speed. Furthermore, for safety applications, messages should not face any kind of delay or collision. Therefore, establishing communication between the vehicles becomes even more challenging. Position‐based routing protocols work productively in vehicular ad hoc networks. Only finding an efficient routing protocol does not solve our purport. We need to carefully examine the effect of media access control layer parameters additionally. In the event of collisions, a large number of nodes would be re‐transmitting rather than sending fresh packets. A node busy in sending the retransmitted packet is called a backlog node. With an increase in the number of collisions, number of backlog nodes also increases, which affects the delay and throughput. In this article, we present the mathematical modeling of delay and throughput with IEEE 802.11 distributed coordination function (at media access control layer) for directional‐location aided routing (D‐LAR) position based routing protocol. For performance evaluation, simulation has been done in realistic environment created with SUMO (traffic simulator) and NS‐2 (network simulator). Simulation results show the comparison between D‐LAR and location aided routing (LAR) on various metrics in terms of delay, packet delivery ratio, routing overhead, throughput, and collision probability. To validate the mathematical model, analytical results has been compared with simulation results. The results confirm that performance of D‐LAR is better than LAR in terms of increasing the throughput and reduction in routing overhead and delay.

show abstract

Section: Related Workmentioning

confidence: 99%

Throughput and delay analysis of directional‐location aided routing protocol for vehicular ad hoc networks

Pandey

Raina

Raw

et al. 2016

Int J Communication

View full text Add to dashboard Cite

show abstract

“…Thus each terminal always sends a packet when its backoff counter value becomes zero. To investigate the impact of the selection distribution on the medium access delay, we further assume that the payload size of each packet is fixed as in earlier works in the literature (Dai and Sun 2013;Felemban and Ekici 2011;Ghadimi et al 2011;Liu et al 2010).…”

Section: The Medium Access Delay Of the Rapmentioning

confidence: 99%

“…However, the recent proliferation of real-time applications such as voice over IP on WLANs has made delay and short-term fairness become more important performance metrics. Regarding the delay issue, most works have concentrated on the accurate modeling and analysis of the delay performance of the IEEE 802.11 DCF (Carvalho and Garcia-LunaAceves 2003;Chatzimisios et al 2003;Dai and Sun 2013;Engelstad and Osterbo 2006;Felemban and Ekici 2011;Foh et al 2007;Garetto and Chiasserini 2005;Ghadimi et al 2011;Kang et al 2007;Liu et al 2010;Sakurai and Vu 2007;Tadayon et al 2012;Tickoo and Sikdar 2008;Zanella and De Pellegrini 2005), but relatively few works have been done for its enhancement (Bi and Zhang 2012). On the other hand, regarding the fairness issue, works on theoretical analysis have been scarce due to complexity, and most of the previous works in the literature have used simulation to analyze the short-term fairness of the IEEE 802.11 DCF (Aad and Castelluccia 2001;Barrett et al 2002;Choi et al 2005;Heusse et al 2005;Kwon et al 2004;Nandagopal et al 2000;Qiao and Shin 2002;Vaidya et al 2005).…”

Section: Introductionmentioning

confidence: 99%

“…For unsaturated condition, to handle the variation in the number of contending terminals, fixed point analysis (Dai and Sun 2013;Felemban and Ekici 2011;Garetto and Chiasserini 2005;Tickoo and Sikdar 2008) and Markovian framework (Foh et al 2007;Liu et al 2010) were utilized. The queueing delay of the IEEE 802.11 DCF was analyzed in Engelstad and Osterbo (2006), Ghadimi et al (2011), Tickoo and Sikdar (2008).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Delay analysis and optimality of the renewal access protocol

Kim

Hwang

2015

Ann Oper Res

View full text Add to dashboard Cite

For many years, the IEEE 802.11 distributed coordination function (DCF) has been widely used as a dominant medium access control (MAC) protocol in wireless networks and a large number of works have been done for analyzing and improving its performance. In our earlier work, as a substitute of the IEEE 802.11 DCF, a simple MAC protocol, called the renewal access protocol (RAP), is proposed. The RAP adopts all of the legacy 802.11 standard but the backoff stage feature. Each terminal selects its backoff counter value from a fixed sized window according to a priori given selection distribution in the RAP, regardless of the packet transmission result. It is shown that, if a Poisson distribution is used as the selection distribution, then the resulting RAP achieves high short-term fairness as well as optimal throughput. In this work, we analyze the relation between delay performance and the selection distribution of the RAP. With the help of effective bandwidth theory, we derive the conditions for the selection distribution of the RAP that optimizes the queue overflow probability. We also construct the delay optimal selection distribution satisfying the optimal conditions for throughput and delay. However, we show that the use of the delay optimal selection distribution results in an extremely slow convergence to steady state compared with that of the Poisson selection distribution. Moreover, we show that the Poisson selection distribution provides near-optimal delay performance. Therefore, we conclude that the use of a Poisson selection distribution is still recommended even from the delay perspective.

show abstract

“…We will discuss it in detail later. A model was proposed in [14] considering unsaturated traffic condition and hidden node effect, which presented a way to predict accurate delay. Here in this paper, we also consider the effect of unsaturated traffic and hidden node but focus on the consumed bandwidth.…”

mentioning

confidence: 99%

Bandwidth mapping model for IEEE 802.11 DCF in unsaturated condition

et al. 2012

View full text Add to dashboard Cite

In multi-hop ad hoc networks, sources may pump more traffic into the networks than that can be supported, resulting in high end-to-end delay and packet-loss rate. Controlling the offered load at the sources can eliminate this problem. To conduct traffic control, the throughput of the network is necessary. In addition, the authors propose a concept of bandwidth mapping to analyse how much traffic in application can be injected to make the network supporting the maximum throughput. A multi-dimensional Markov model is built to analyse the performance of IEEE 802.11 DCF in unsaturated condition, in which M/G/1/K queuing model is used to analyse the service condition of the packet queue inside the node. The effects of carrier sensing property, hidden-node problem and signal capture property are considered together to analyse the contention experienced by the nodes in the network. Furthermore, the bandwidth mapping situation of voice and video traffic is analysed in string topology of a multi-hop ad hoc network. This analysis can provide a theoretical guide for the traffic admission control.

show abstract

An analytical model of delay in multi-hop wireless ad hoc networks

Cited by 33 publications

References 14 publications

Throughput and delay analysis of directional‐location aided routing protocol for vehicular ad hoc networks

Throughput and delay analysis of directional‐location aided routing protocol for vehicular ad hoc networks

Delay analysis and optimality of the renewal access protocol

Bandwidth mapping model for IEEE 802.11 DCF in unsaturated condition

Contact Info

Product

Resources

About