Hole detection and shape-free representation and double landmarks based geographic routing in wireless sensor networks
In wireless sensor networks, an important issue of geographic routing is “local minimum” problem, which is caused by a “hole” that blocks the greedy forwarding process. Existing geographic routing algorithms use perimeter routing strategies to find a long detour path when such a situation occurs. To...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
KeAi Communications Co., Ltd.
2015-02-01
|
| Series: | Digital Communications and Networks |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2352864815000024 |
| _version_ | 1818615653516443648 |
|---|---|
| author | Jianjun Yang Zongming Fei Ju Shen |
| author_facet | Jianjun Yang Zongming Fei Ju Shen |
| author_sort | Jianjun Yang |
| collection | DOAJ |
| description | In wireless sensor networks, an important issue of geographic routing is “local minimum” problem, which is caused by a “hole” that blocks the greedy forwarding process. Existing geographic routing algorithms use perimeter routing strategies to find a long detour path when such a situation occurs. To avoid the long detour path, recent research focuses on detecting the hole in advance, then the nodes located on the boundary of the hole advertise the hole information to the nodes near the hole. Hence the long detour path can be avoided in future routing. We propose a heuristic hole detecting algorithm which identifies the hole easily and quickly and then propose a representation of hole no matter what the shape of the hole is. In addition, we quantitatively figure out the areas in the vicinity of the hole that need to be announced the hole information. With such information, a new routing scheme with two landmarks was developed. Simulation results illustrate that our approach can achieve better performance in terms of the average length and number of hops in routing paths. Simulation also shows that our approach introduces very small computational complexity. |
| first_indexed | 2024-12-16T16:37:20Z |
| format | Article |
| id | doaj.art-644d0659217745879255505c7b3a725b |
| institution | Directory Open Access Journal |
| issn | 2352-8648 |
| language | English |
| last_indexed | 2024-12-16T16:37:20Z |
| publishDate | 2015-02-01 |
| publisher | KeAi Communications Co., Ltd. |
| record_format | Article |
| series | Digital Communications and Networks |
| spelling | doaj.art-644d0659217745879255505c7b3a725b2022-12-21T22:24:25ZengKeAi Communications Co., Ltd.Digital Communications and Networks2352-86482015-02-0111758310.1016/j.dcan.2015.01.001Hole detection and shape-free representation and double landmarks based geographic routing in wireless sensor networksJianjun Yang0Zongming Fei1Ju Shen2Department of Computer Science and Information Systems, University of North Georgia, Oakwood, GA, United StatesDepartment of Computer Science, University of Kentucky, Lexington, KY, United StatesDepartment of Computer Science, University of Dayton, Dayton, OH, United StatesIn wireless sensor networks, an important issue of geographic routing is “local minimum” problem, which is caused by a “hole” that blocks the greedy forwarding process. Existing geographic routing algorithms use perimeter routing strategies to find a long detour path when such a situation occurs. To avoid the long detour path, recent research focuses on detecting the hole in advance, then the nodes located on the boundary of the hole advertise the hole information to the nodes near the hole. Hence the long detour path can be avoided in future routing. We propose a heuristic hole detecting algorithm which identifies the hole easily and quickly and then propose a representation of hole no matter what the shape of the hole is. In addition, we quantitatively figure out the areas in the vicinity of the hole that need to be announced the hole information. With such information, a new routing scheme with two landmarks was developed. Simulation results illustrate that our approach can achieve better performance in terms of the average length and number of hops in routing paths. Simulation also shows that our approach introduces very small computational complexity.http://www.sciencedirect.com/science/article/pii/S2352864815000024Hole detectionRepresentationGeographic routingWireless sensor networks |
| spellingShingle | Jianjun Yang Zongming Fei Ju Shen Hole detection and shape-free representation and double landmarks based geographic routing in wireless sensor networks Digital Communications and Networks Hole detection Representation Geographic routing Wireless sensor networks |
| title | Hole detection and shape-free representation and double landmarks based geographic routing in wireless sensor networks |
| title_full | Hole detection and shape-free representation and double landmarks based geographic routing in wireless sensor networks |
| title_fullStr | Hole detection and shape-free representation and double landmarks based geographic routing in wireless sensor networks |
| title_full_unstemmed | Hole detection and shape-free representation and double landmarks based geographic routing in wireless sensor networks |
| title_short | Hole detection and shape-free representation and double landmarks based geographic routing in wireless sensor networks |
| title_sort | hole detection and shape free representation and double landmarks based geographic routing in wireless sensor networks |
| topic | Hole detection Representation Geographic routing Wireless sensor networks |
| url | http://www.sciencedirect.com/science/article/pii/S2352864815000024 |
| work_keys_str_mv | AT jianjunyang holedetectionandshapefreerepresentationanddoublelandmarksbasedgeographicroutinginwirelesssensornetworks AT zongmingfei holedetectionandshapefreerepresentationanddoublelandmarksbasedgeographicroutinginwirelesssensornetworks AT jushen holedetectionandshapefreerepresentationanddoublelandmarksbasedgeographicroutinginwirelesssensornetworks |