TY - GEN
T1 - Bypassing routing holes in WSNs with a predictive geographic greedy forwarding
AU - Ha, Minh Thiep
AU - Sakthivel, Priyadharshini
AU - Choo, Hyunseung
PY - 2009
Y1 - 2009
N2 - Applications in wireless sensor networks (WSNs) experience the routing hole problem. That is, the current node cannot forward to the destination, although it is the closest node, but not a neighbor of the destination. Accordingly, the packets from the source cannot be delivered to the destination. Jiang et al. recently proposed a SLGF approach to address this problem. However, SLGF still has long routing paths, since it uses the right-hand rule. In this paper, we describe Predictive Geographic greedy Forwarding, PGF. PGF uses information on the hole to build the virtual convex polygon, predict the routing path and choose the shorter path. PGF reduces the length and the number of hops of routing paths. Computer simulation shows our PGF scheme can reduce the average number of hops of routing paths by about 32% compared to Geographic greedy Forwarding, GF, and about 15% compared to SLGF.
AB - Applications in wireless sensor networks (WSNs) experience the routing hole problem. That is, the current node cannot forward to the destination, although it is the closest node, but not a neighbor of the destination. Accordingly, the packets from the source cannot be delivered to the destination. Jiang et al. recently proposed a SLGF approach to address this problem. However, SLGF still has long routing paths, since it uses the right-hand rule. In this paper, we describe Predictive Geographic greedy Forwarding, PGF. PGF uses information on the hole to build the virtual convex polygon, predict the routing path and choose the shorter path. PGF reduces the length and the number of hops of routing paths. Computer simulation shows our PGF scheme can reduce the average number of hops of routing paths by about 32% compared to Geographic greedy Forwarding, GF, and about 15% compared to SLGF.
KW - Routing hole problem
KW - Sensor networks
UR - https://www.scopus.com/pages/publications/70350440670
U2 - 10.1007/978-3-642-04492-2_18
DO - 10.1007/978-3-642-04492-2_18
M3 - Conference contribution
AN - SCOPUS:70350440670
SN - 3642044913
SN - 9783642044915
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 171
EP - 180
BT - Management Enabling the Future Internet for Changing Business and New Computing Services - 12th Asia-Pacific Network Operations and Management Symposium, APNOMS 2009, Proceedings
T2 - 12th Asia-Pacific Network Operations and Management Symposium, APNOMS 2009
Y2 - 23 September 2009 through 25 September 2009
ER -