loading...
A Geo-Routing Algorithm in Planar Graph for Ad Hoc Wireless Networks
Niagara Falls, Ontario, Canada May 21-May 23
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AINAW.2007.2321st International Conference on Adva ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Rashid Bin Muhammad, "A Geo-Routing Algorithm in Planar Graph for Ad Hoc Wireless Networks," Advanced Information Networking and Applications Workshops, International Conference on, vol. 2, pp. 685-689, 21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07), 2007.
 
 
BibTex
x
 
@article{ 10.1109/AINAW.2007.23,
author = {Rashid Bin Muhammad},
title = {A Geo-Routing Algorithm in Planar Graph for Ad Hoc Wireless Networks},
journal ={Advanced Information Networking and Applications Workshops, International Conference on},
volume = {2},
year = {2007},
isbn = {0-7695-2847-3},
pages = {685-689},
doi = {http://doi.ieeecomputersociety.org/10.1109/AINAW.2007.23},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Advanced Information Networking and Applications Workshops, International Conference on
TI - A Geo-Routing Algorithm in Planar Graph for Ad Hoc Wireless Networks
SN - 0-7695-2847-3
SP685
EP689
A1 - Rashid Bin Muhammad,
PY - 2007
KW - null
VL - 2
JA - Advanced Information Networking and Applications Workshops, International Conference on
ER -
 
Rashid Bin Muhammad, Kent State University, USA
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.
Citation:
Rashid Bin Muhammad, "A Geo-Routing Algorithm in Planar Graph for Ad Hoc Wireless Networks," ainaw, vol. 2, pp.685-689, 21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.