Issue No. 05 - May (2009 vol. 8)

ISSN: 1536-1233

pp: 590-605

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TMC.2008.158

Neal E. Young , University of California, Riverside, Riverside

Ece Gelal , University of California, Riverside, Riverside

Gentian Jakllari , BBN Technologies, St. Cambridge

Srikanth V. Krishnamurthy , University of California, Riverside, Riverside

ABSTRACT

With fully directional communications, nodes must track the positions of their neighbors so that communication with these neighbors is feasible when needed. Tracking process introduces an overhead, which increases with the number of discovered neighbors. The overhead can be reduced if nodes maintain only a subset of their neighbors; however, this may increase the length of paths between node pairs in the network. In this work, we study the tradeoffs between node degree and path stretch. We first design a topology control algorithm to optimize this tradeoff. Assuming that nodes communicate with their directional neighbors using circular directional transmissions, we model the original graph as a unit disk graph (UDG). Given a UDG G, our algorithm finds a sparse subgraph G' with a maximum degree of 6, and connecting each node pair u,v by a path of length hops_{G'}(u,v)=O(\hops_G(u,v)+\log\Delta), where Delta is the maximum degree in G, hops_{G}(u,v) denotes length of the shortest path between u, v in G. We show that this result is near-optimal. Based on the insights gained from this design, we next construct a simpler, more practical scheme that integrates fully-directional neighbor discovery and maintenance with topology control strategy. We simulate both algorithms and compare their performances.

INDEX TERMS

Network Protocols, Wireless communication

CITATION

Neal E. Young, Ece Gelal, Gentian Jakllari, Srikanth V. Krishnamurthy, "Topology Management in Directional Antenna-Equipped Ad Hoc Networks",

*IEEE Transactions on Mobile Computing*, vol. 8, no. , pp. 590-605, May 2009, doi:10.1109/TMC.2008.158SEARCH