Routing Algorithm Exploits Spatial Relations

TBMG-615

02/01/2004

Abstract
Content

A recently developed routing algorithm for broadcasting in an ad hoc wireless communication network takes account of, and exploits, the spatial relationships among the locations of nodes, in addition to transmission power levels and distances between the nodes. In contrast, most prior algorithms for discovering routes through ad hoc networks rely heavily on transmission power levels and utilize limited graph-topology techniques that do not involve consideration of the aforesaid spatial relationships. The present algorithm extracts the relevant spatial-relationship information by use of a construct denoted the relative-neighborhood graph (RNG).

Meta TagsDetails
Citation
"Routing Algorithm Exploits Spatial Relations," Mobility Engineering, February 1, 2004.
Additional Details
Publisher
Published
Feb 1, 2004
Product Code
TBMG-615
Content Type
Magazine Article
Language
English