Kumar, Dinesh and Venkatesh, Ramaiyan and Kumar, Anurag and Altman, Eitan (2006) Capacity Optimizing Hop Distance in a Mobile Ad Hoc Network with Power Control. In: 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, , 03-06 April 2006, Boston, MA.
Capacity_Optimizing.pdf - Published Version
Restricted to Registered users only
Download (354Kb) | Request a copy
In a dense multi-hop network of mobile nodes capable of applying adaptive power control, we consider the problem of finding the optimal hop distance that maximizes a certain throughput measure in bit-metres/sec, subject to average network power constraints. The mobility of nodes is restricted to a circular periphery area centered at the nominal location of nodes. We incorporate only randomly varying path-loss characteristics of channel gain due to the random motion of nodes, excluding any multi-path fading or shadowing effects. Computation of the throughput metric in such a scenario leads us to compute the probability density function of random distance between points in two circles. Using numerical analysis we discover that choosing the nearest node as next hop is not always optimal. Optimal throughput performance is also attained at non-trivial hop distances depending on the available average network power.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||10 Nov 2011 05:19|
|Last Modified:||10 Nov 2011 05:19|
Actions (login required)