|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems
Efficient Graph Planarization in Sensor Networks and Local Routing Algorithm
Hangzhou, Zhejiang P.R. China
May 16-May 18
ISBN: 978-0-7695-4707-7
| ASCII Text | x | ||
| Florian Huc, Aubin Jarry, Pierre Leone, Jose Rolim, "Efficient Graph Planarization in Sensor Networks and Local Routing Algorithm," Distributed Computing in Sensor Systems and Workshops, International Conference on, pp. 140-149, 2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems, 2012. | |||
| BibTex | x | ||
| @article{ 10.1109/DCOSS.2012.64, author = {Florian Huc and Aubin Jarry and Pierre Leone and Jose Rolim}, title = {Efficient Graph Planarization in Sensor Networks and Local Routing Algorithm}, journal ={Distributed Computing in Sensor Systems and Workshops, International Conference on}, volume = {0}, year = {2012}, isbn = {978-0-7695-4707-7}, pages = {140-149}, doi = {http://doi.ieeecomputersociety.org/10.1109/DCOSS.2012.64}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Distributed Computing in Sensor Systems and Workshops, International Conference on TI - Efficient Graph Planarization in Sensor Networks and Local Routing Algorithm SN - 978-0-7695-4707-7 SP140 EP149 A1 - Florian Huc, A1 - Aubin Jarry, A1 - Pierre Leone, A1 - Jose Rolim, PY - 2012 VL - 0 JA - Distributed Computing in Sensor Systems and Workshops, International Conference on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCOSS.2012.64
Abstract-In this paper, we propose an efficient planarization algorithm and a routing algorithm dedicated to Unit Disk Graphs whose nodes are localized using the Virtual Raw Anchor Coordinate system (VRAC). Our first algorithm computes a planar 2-spanner under light constraints on the edge lengths and induces a total exchange of at most 6n node identifiers. Its total complexity is O(n?, with ? the maximum degree of the communication graph. The second algorithm that we present is a simple and efficient algorithm to route messages in this planar graph that requires routing tables with only three entries. We support these theoretical results by simulations showing the robustness of our algorithms when the coordinates are inaccurate.
Citation:
Florian Huc, Aubin Jarry, Pierre Leone, Jose Rolim, "Efficient Graph Planarization in Sensor Networks and Local Routing Algorithm," dcoss, pp.140-149, 2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems, 2012
Usage of this product signifies your acceptance of the Terms of Use.