Capacity optimizing hop distance in a mobile ad hoc network with power control

Abstract— 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.

• Type: Conference
• Year: 2006
• Where: WIOPT
• Authors: Dinesh Kumar 0002, Venkatesh Ramaiyan, Anurag Kumar, Eitan Altman
• Keywords: Average Network Power, Hop Distances, Optimal Hop Distance, WIOPT 2006, Wireless Networks