DocumentCode
2758464
Title
A Geo-Routing Algorithm in Planar Graph for Ad Hoc Wireless Networks
Author
Muhammad, Rashid Bin
Author_Institution
Dept. of Comput. Sci., Kent State Univ., Kent, OH
Volume
2
fYear
2007
fDate
21-23 May 2007
Firstpage
685
Lastpage
689
Abstract
This paper presented a fully distributed algorithm to compute a planar subgraph for geo-routing in ad hoc wireless networks. 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.
Keywords
ad hoc networks; communication complexity; computational geometry; distributed algorithms; graph theory; telecommunication network routing; ad hoc wireless network; distributed algorithm; geo-routing algorithm; planar subgraph; unit disk graph model; Ad hoc networks; Computer networks; Computer science; Costs; Distributed algorithms; Distributed computing; Mobile ad hoc networks; Peer to peer computing; Routing; Wireless networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Information Networking and Applications Workshops, 2007, AINAW '07. 21st International Conference on
Conference_Location
Niagara Falls, Ont.
Print_ISBN
978-0-7695-2847-2
Type
conf
DOI
10.1109/AINAW.2007.23
Filename
4224183
Link To Document