Please use this identifier to cite or link to this item:
|Title:||Practical 3D geographic routing for wireless sensor networks||Authors:||Zhou, J.
|Keywords:||3D geographic routing
|Issue Date:||2010||Citation:||Zhou, J.,Chen, Y.,Leong, B.,Sundaramoorthy, P.S. (2010). Practical 3D geographic routing for wireless sensor networks. SenSys 2010 - Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems : 337-350. ScholarBank@NUS Repository. https://doi.org/10.1145/1869983.1870016||Abstract:||Geographic routing is of interest for sensor networks because a point-to-point primitive is an important building block for data-centric applications. While there is a significant body of work on geographic routing algorithms for twodimensional (2D) networks, geographic routing for practical three-dimensional (3D) sensor networks is relatively unexplored. We show that existing 2D geographic routing algorithms like CLDP/GPSR and GDSTR perform poorly in practical 3D sensor network deployments and describe GDSTR-3D, a new 3D geographic routing algorithm that uses 2-hop neighbor information in greedy forwarding and 2D convex hulls to aggregate node location information. We compare GDSTR-3D to existing algorithms, including CLDP/GPSR, GDSTR, AODV, VRR and S4, both in a real wireless sensor testbed and with TOSSIM simulations to show that GDSTR-3D is highly scalable, requires only a modest amount of storage and achieves routing stretch close to 1. Copyright 2010 ACM.||Source Title:||SenSys 2010 - Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems||URI:||http://scholarbank.nus.edu.sg/handle/10635/41538||ISBN:||9781450303446||DOI:||10.1145/1869983.1870016|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.