Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Kinetic Minimum-Power Routing and Clustering in Mobile Ad-Hoc Networks

Published

Author(s)

Camillo Gentile, R E. Van Dyck, J Haerri

Abstract

We have previously developed a distributed routing algorithm which minimizes the number of overhead messages necessary to maintain the minimum-power multi-hop routes in a mobile ad-hoc network, assuming a piece-wise linear model for the motion of the nodes. In this paper we extend the routing algorithm to include clustering as well, to reduce further the number of overhead messages at the expense of sub-optimal routes. A single parameter controls the degree of clustering, and consequently the degree of sub-optimality, rather than arbitrary parameters such as maximum cluster size or maximum distance between nodes. The proposed algorithm converges in a finite number of iterations to both stable routes and stable clusters, and by setting the cluster parameter to 0 collapses to the original routing algorithm with no clusters and optimum routes.
Proceedings Title
Vehicular Technology Conference
Conference Location
Sept. 25-27
Conference Title
(Vancouver, Canada)

Keywords

mobile ad-hoc networks

Citation

Gentile, C. , Van dyck, R. and Haerri, J. (2002), Kinetic Minimum-Power Routing and Clustering in Mobile Ad-Hoc Networks, Vehicular Technology Conference, Sept. 25-27, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=50714 (Accessed June 16, 2024)

Issues

If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.

Created August 31, 2002, Updated October 12, 2021