Topology Management in Directional Antenna-Equipped Ad Hoc Networks

Date Added: Aug 2009
Format: PDF

With fully directional communications, nodes must track and periodically update the positions of their discovered neighbors, so that communication with these neighbors is feasible when needed. If tracking fails, neighbors that move out of the directional footprint will need to be rediscovered. The tracking process introduces an overhead, which increases with the number of discovered neighbors. The overhead can be reduced if each node maintains only a subset of its neighbors; however, this may increase the hop count of paths between nodes, i.e., causes a hop stretch. In this paper, the authors study the tradeoffs between node degrees and hop stretch. They first design a topology control algorithm to optimize this tradeoff.