Please use this identifier to cite or link to this item:
|Title:||Greedy hop distance routing using tree recovery on wireless ad hoc and sensor networks||Authors:||Tao, S.
|Issue Date:||2008||Citation:||Tao, S., Ananda, A.L., Mun, C.C. (2008). Greedy hop distance routing using tree recovery on wireless ad hoc and sensor networks. IEEE International Conference on Communications : 2712-2716. ScholarBank@NUS Repository. https://doi.org/10.1109/ICC.2008.512||Abstract:||Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an effective recovery mechanism, these protocols will frequently encounter failures at network local minimum sites. In this paper, we propose a new connectivity-based routing protocol named Hop Distance Routing(HDR) with an efficient distance metric called hop distance. To ensure packet delivery, HDR complements greedy forwarding with a tree based recovery method, which allows the packet to traverse the branches and escape from local minimum locations. By labeling each tree node with an angle range, HDR can identify the subtree where the destination resides and forward the packet towards it until greedy forwarding can be resumed. Compared to other connectivity-based routing protocols such as NoGeo, BVR, LCR and VPCR, performance results show that the HDR protocol provides the highest packet delivery ratio and the lowest path stretch with the minimal communication overhead for each packet delivery on the node density range from 1.76 to 17.67. ©2008 IEEE.||Source Title:||IEEE International Conference on Communications||URI:||http://scholarbank.nus.edu.sg/handle/10635/41293||ISBN:||9781424420742||ISSN:||05361486||DOI:||10.1109/ICC.2008.512|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 14, 2019
WEB OF SCIENCETM
checked on Dec 6, 2019
checked on Dec 2, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.