# A Queueing Network Model for Delay and Throughput Analysis in Multi-hop Wireless Ad Hoc Networks

@inproceedings{Deepak2017AQN, title={A Queueing Network Model for Delay and Throughput Analysis in Multi-hop Wireless Ad Hoc Networks}, author={T. G. Deepak}, year={2017} }

In this paper we present a queueing network model for computing average end-to-end delay, and maximum throughput that can be attained in random access multi-hop wireless ad hoc networks with stationary nodes under two popular contention resolution schemes namely, Binary Exponential Back-off (BEB) and Double Increment Double Decrement (DIDD) rules. This model takes into consider some realistic features of the system like (i) the generation of different classes of packets at nodes, and (ii) theβ¦Β Expand

#### One Citation

A matrix analytic approach to study the queuing characteristics of nodes in a wireless network

- Computer Science
- OPSEARCH
- 2019

A model to study the queueing characteristics of nodes in a wireless network in which the channel access is governed by the well known binary exponential back off rule is proposed, representing the model as a quasi birth death process and analysed by using matrix analytic methods. Expand

#### References

SHOWING 1-10 OF 13 REFERENCES

Queuing network models for delay analysis of multihop wireless ad hoc networks

- Computer Science
- Ad Hoc Networks
- 2009

An analytical model takes into account the number of nodes, the random packet arrival process, the extent of locality of traffic, and the back off and collision avoidance mechanisms of random access MAC to derive the average end-to-end delay and maximum achievable per-node throughput in random access multihop wireless ad hoc networks with stationary nodes. Expand

Towards the performance analysis of IEEE 802.11 in multi-hop ad-hoc networks

- Computer Science
- IEEE Wireless Communications and Networking Conference, 2005
- 2005

Key to the modeling of the multi-hop networks is a treatment of the upper layer routing protocols that can affect the network performance through the way they forward packets and the impact of that on the traffic load. Expand

Modeling the Throughput and Delay in Wireless Multihop Ad Hoc Networks

- Computer Science
- GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference
- 2009

This analysis reveals how the throughput and delay in wireless multihop ad hoc networks are affected by the hidden-terminals and by the transmission and interference ranges of wireless devices. Expand

Distance Distributions in Finite Uniformly Random Networks: Theory and Applications

- Computer Science, Mathematics
- IEEE Transactions on Vehicular Technology
- 2010

A more-realistic network model where a known and fixed number of nodes are independently distributed in a given region is considered and the distribution of the Euclidean internode distances follows a generalized beta distribution. Expand

A performance comparison of multi-hop wireless ad hoc network routing protocols

- Computer Science
- MobiCom '98
- 1998

The results of a derailed packet-levelsimulationcomparing fourmulti-hopwirelessad hoc networkroutingprotocols, which cover a range of designchoices: DSDV,TORA, DSR and AODV are presented. Expand

Achieving performance enhancement in IEEE 802.11 WLANs by using the DIDD backoff mechanism

- Computer Science
- Int. J. Commun. Syst.
- 2007

This paper develops an alternative mathematical analysis for the proposed DIDD scheme that is based on elementary conditional probability arguments rather than bi-dimensional Markov chains that have been extensively utilized in the literature. Expand

Application of the Diffusion Approximation to Queueing Networks I: Equilibrium Queue Distributions

- Computer Science
- JACM
- 1974

A vector-valued normal process and its diffusion equation are introduced in order to obtain an approximate solution to the joint distribution of queue lengths in a general network of queues. Expand

Packet Switching in Radio Channels: Part II - The Hidden Terminal Problem in Carrier Sense Multiple-Access and the Busy-Tone Solution

- Computer Science
- IEEE Transactions on Communications
- 1975

The busy-tone multiple-access mode is introduced and analyzed as a natural extension of CSMA to eliminate the hidden-terminal problem and results show that BTMA with hidden terminals performs almost as well as CSMA without hidden terminals. Expand

A Review of Techniques to Resolve the Hidden Node Problem in Wireless Networks

- Computer Science
- Smart Comput. Rev.
- 2012

This paper discusses the design factors of some existing mechanisms to deal with hidden node avoidance, and presents a timeline of the development of these mechanisms, and classify and characterize the existing mechanisms into three categories. Expand

Introduction to Matrix Analytic Methods in Stochastic Modeling

- Computer Science, Mathematics
- ASA-SIAM Series on Statistics and Applied Mathematics
- 1999

This chapter discusses quasi-Birth-and-Death Processes, a large number of which are based on the Markovian Point Processes and the Matrix-Geometric Distribution, as well as algorithms for the Rate Matrix. Expand