By Topic

Distributed construction of planar graph for position-based routing in ad hoc wireless networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Bin Muhammad, R. ; Dept. of Comput. Sci., Kent State Univ., OH

In this paper, we presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. We considered the idealized unit disk graph model in which nodes are assumed to be connected if and only if nodes are within their transmission range. The main contribution of this work is a fully distributed algorithm to extract the connected, planar graph for routing in the wireless networks. The communication cost of the proposed algorithm is O(d log d) bits, where d is the degree of a node. In addition, this paper also presented a geometric routing algorithm and established its lower bound. The algorithm is fully distributed and nodes know only the position of other nodes and can communicate with neighboring nodes in their transmission range.

Published in:

SoutheastCon, 2007. Proceedings. IEEE

Date of Conference:

22-25 March 2007