Please use this identifier to cite or link to this item:
https://doi.org/10.1109/LCN.2008.4664163
Title: | Spherical coordinate routing for 3D wireless ad-hoc and sensor networks | Authors: | Tao, S. Ananda, A.L. Mun, C.C. |
Keywords: | Failure recovery Geometric routing Guaranteed delivery Hop count vector Path stretch |
Issue Date: | 2008 | Citation: | Tao, S.,Ananda, A.L.,Mun, C.C. (2008). Spherical coordinate routing for 3D wireless ad-hoc and sensor networks. Proceedings - Conference on Local Computer Networks, LCN : 144-151. ScholarBank@NUS Repository. https://doi.org/10.1109/LCN.2008.4664163 | Abstract: | While wireless networks are generally deployed in three dimensional environments, most geometric routing protocols are designed and evaluated with a focus on two dimensional space. In this paper, we present a connectivity based routing protocol in 3D space named Spherical Coordinate Routing(SCR), which exploits connectivity-based greedy forwarding for efficient routing paths and a spherical coordinate tree based recovery method to guarantee packet delivery. SCR can deploy multiple recovery trees simultaneously to enhance the routing efficiency and resilience against network dynamics. Simulation results show that the packet delivery ratio of SCR is 22%-63% higher than that of BVR, LCR and NoGeo, at the critical node density range of 4 to 8. The amount of forwarding traffic required per packet delivery is considerably lower than protocols relying on scoped flooding based recovery. The SCR protocol can efficiently recover from topology changes due to clustered node failures, while maintaining excellent path stretch and traffic load performance in a 3D network topology. ©2008 IEEE. | Source Title: | Proceedings - Conference on Local Computer Networks, LCN | URI: | http://scholarbank.nus.edu.sg/handle/10635/41848 | ISBN: | 9781424424139 | DOI: | 10.1109/LCN.2008.4664163 |
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.