By Topic

Scaling laws for capacity and delay in wireless ad hoc networks with random mobility

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sharma, G. ; Sch. of Electr. & Comput. Eng., Purdue Univ., West Lafayette, IN, USA ; Mazumdar, R.R.

We study the asymptotic throughput capacity and delay in mobile ad hoc networks following the 2-hop relaying algorithm proposed by Grossglauser and Tse (2001). We assume the nodes to be uniformly distributed on a sphere, and consider two canonical mobility models: the Brownian mobility model (BMM), and the random way-point mobility model (RWMM). We show that for an ad hoc network formed by n mobile nodes the delay scales as O (log2n/σ2(n)) under the BMM, and, Θ (1/r(n)v(n)) under the RWMM, where σ2(n) is the variance parameter of the BMM, v(n) is the average speed of nodes under the RWMM, and r(n) is the communication radius of the nodes.

Published in:

Communications, 2004 IEEE International Conference on  (Volume:7 )

Date of Conference:

20-24 June 2004