Capacity Optimizing Hop Distance in a Mobile Ad Hoc Network with Power Control

Dinesh  Kumar; Ramaiyan  Venkatesh; Anurag  Kumar; Eitan  Altman

4th International ICST Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks

Research Article

Capacity Optimizing Hop Distance in a Mobile Ad Hoc Network with Power Control

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/WIOPT.2006.1666452,
    author={Dinesh  Kumar and Ramaiyan  Venkatesh and Anurag  Kumar and Eitan  Altman},
    title={Capacity Optimizing Hop Distance in a Mobile Ad Hoc Network with Power Control},
    proceedings={4th International ICST Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks},
    publisher={IEEE},
    proceedings_a={WIOPT},
    year={2006},
    month={8},
    keywords={},
    doi={10.1109/WIOPT.2006.1666452}
}

Dinesh Kumar
Ramaiyan Venkatesh
Anurag Kumar
Eitan Altman
Year: 2006
Capacity Optimizing Hop Distance in a Mobile Ad Hoc Network with Power Control
WIOPT
IEEE
DOI: 10.1109/WIOPT.2006.1666452

Dinesh Kumar^1,2^,*, Ramaiyan Venkatesh^3,4^,*, Anurag Kumar^3,4^,*, Eitan Altman^5,2^,*

1: INRIA, B.P. 93, 2004 Route des Lucioles
2: 06902 Sophia Antipolis, France.
3: ECE Dept. Indian Institute of Science
4: Bangalore, India.
5: INRIA B.P. 93, 2004 Route des Lucioles

*Contact email: dkumar@sophia.inria.fr, rvenkat@ece.iisc.ernet.in, anurag@ece.iisc.ernet.in, altman@sophia.inria.fr

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.

Published: 2006-08-07
Publisher: IEEE

: http://dx.doi.org/10.1109/WIOPT.2006.1666452