Bypassing routing holes in WSNs with a predictive geographic greedy forwarding
- Authors
- Ha, M.T.[Ha, M.T.]; Sakthivel, P.[Sakthivel, P.]; Choo, H.[Choo, H.]
- Issue Date
- 2009
- Keywords
- Routing hole problem; Sensor networks
- Citation
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v.5787 LNCS, pp.171 - 180
- Indexed
- SCOPUS
- Journal Title
- Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- Volume
- 5787 LNCS
- Start Page
- 171
- End Page
- 180
- URI
- https://scholarworks.bwise.kr/skku/handle/2021.sw.skku/79132
- DOI
- 10.1007/978-3-642-04492-2_18
- ISSN
- 0302-9743
- Abstract
- 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. © 2009 Springer Berlin Heidelberg.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Computing and Informatics > Computer Science and Engineering > 1. Journal Articles
- Information and Communication Engineering > Department of Computer Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.