loading...
A Generalization of the Face Routing
San Diego, California July 17-July 21
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MOBIQUITOUS.2005.3The Second Annual International Confe ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Sabeel Ansari, Lata Narayanan, Jaroslav Opatrny, "A Generalization of the Face Routing," Mobile and Ubiquitous Systems, Annual International Conference on, pp. 213-224, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services, 2005.
 
 
BibTex
x
 
@article{ 10.1109/MOBIQUITOUS.2005.3,
author = {Sabeel Ansari and Lata Narayanan and Jaroslav Opatrny},
title = {A Generalization of the Face Routing},
journal ={Mobile and Ubiquitous Systems, Annual International Conference on},
volume = {0},
year = {2005},
isbn = {0-7695-2375-7},
pages = {213-224},
doi = {http://doi.ieeecomputersociety.org/10.1109/MOBIQUITOUS.2005.3},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Mobile and Ubiquitous Systems, Annual International Conference on
TI - A Generalization of the Face Routing
SN - 0-7695-2375-7
SP213
EP224
A1 - Sabeel Ansari,
A1 - Lata Narayanan,
A1 - Jaroslav Opatrny,
PY - 2005
KW - Wireless networks
KW - ad hoc networks
KW - MANET
KW - routing algorithms
KW - planar graphs
KW - geometric graphs
KW - crossing edges
KW - position-based routing.
VL - 0
JA - Mobile and Ubiquitous Systems, Annual International Conference on
ER -
 
Sabeel Ansari, Concordia University
Lata Narayanan, Concordia University
Jaroslav Opatrny, Concordia University

We consider the problem of routing with guaranteed delivery in ad-hoc wireless networks using the positions of the mobile hosts. Such networks can be modeled as geometric graphs. FACE ROUTING [4], [9] is a position-based routing algorithm for planar geometric graphs that guarantees delivery of messages without flooding control packets throughout the network. For general ad hoc networks, FACE ROUTING can use a planar sub-graph of the original graph; many local and distributed algorithms have been proposed to extract such a planar sub-graph. However, these planarization algorithms may fail in some situations, such as when the transmission ranges are not the same, for example, due to the presence of obstacles, which in turn may cause a routing failure. In this paper, we describe a generalization of FACE ROUTING that can guarantee delivery in planar graphs with disjoint crossing edges added. Our algorithm needs O

Index Terms:
Wireless networks, ad hoc networks,MANET, routing algorithms, planar graphs, geometric graphs, crossing edges, position-based routing.
Citation:
Sabeel Ansari, Lata Narayanan, Jaroslav Opatrny, "A Generalization of the Face Routing," mobiquitous, pp.213-224, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services, 2005
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions