Expected Multi-Hop Power Consumption in Mobile Ad-Hoc Networks

Published

March 1, 2003

Author(s)

Camillo A. Gentile

Abstract

Mobile Ad-Hoc Networks provide the means to reduce significantly the power required for routing from source to destination through multi-hops between other nodes in the network. In the presence of mobility, only continuous updating can guarantee routes which minimize this power. This paper performs a theoretical study, establishing closed-form lower and upper bounds on the expected power corresponding respectively to continuous updating and to routes never updated. We introduce a mobility model which allows examining the behavior of the expected power between the two extrema as a function of the update period. The derived expressions vary according to the number of nodes in the network, their roaming area, the mobility of the nodes, the power exponent which governs their consumption, and time. This analysis of a one-dimension network in addition provides the basic equations which enable its extension to two dimensions, currently under investigation.

Proceedings Title

2003 Conference on Information Sciences and Systems

Conference Dates

March 12-14, 2003

Conference Location

March 124,

Conference Title

(The Johns Hopkins University)

Pub Type

Conferences

Download Paper

Local Download

Keywords

energy, manet, mobility, update period

Citation

Gentile, C. (2003), Expected Multi-Hop Power Consumption in Mobile Ad-Hoc Networks, 2003 Conference on Information Sciences and Systems, March 12-14, , [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=50713 (Accessed June 2, 2024)