Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Queuing Delay and Achievable Throughput in Random Access Wireless Ad Hoc Networks
 

Summary: 1
Queuing Delay and Achievable Throughput in
Random Access Wireless Ad Hoc Networks
Nabhendra Bisnik, Alhussein Abouzeid
Rensselaer Polytechnic Institute
Troy, NY 12180
bisnin@rpi.edu, abouzeid@ecse.rpi.edu
Abstract-- In this paper we focus on characterizing the average
end-to-end delay and maximum achievable per-node throughput in
random access multihop wireless ad hoc networks with stationary
nodes. We present an analytical model that 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. We model random access
multihop wireless networks as open G/G/1 queuing networks and
use diffusion approximation to evaluate closed form expressions
for the average end-to-end delay. The mean service time of nodes
is derived and used to obtain the maximum achievable per-node
throughput. The analytical results obtained here from the queuing
network analysis are discussed with regard to similarities and

  

Source: Abouzeid, Alhussein A. - Department of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute

 

Collections: Engineering; Computer Technologies and Information Sciences