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

Abstract

The authors 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, they extend this routing algorithm to include clustering 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 2002
Accession Number
ADA512221

Entities

People

  • Camillo Gentile
  • Jerome Haerri
  • Robert E. Vandyck

Organizations

  • National Institute of Standards and Technology

Tags

DTIC Thesaurus Topics

  • Ad Hoc Networks
  • Algorithms
  • Clustering
  • Copyrights
  • Governments
  • Information Operations
  • Iterations
  • Mesh Networks
  • Military Operations
  • Mobile Ad Hoc Networks
  • Networks
  • Organizational Realignment
  • Probability
  • Self Organizing Systems
  • Simulations
  • Standards
  • Trajectories

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Neural Network Machine Learning.
  • Operations Research