An ellipse-guided routing algorithm in wireless sensor networks
In wireless sensor networks, sensor nodes are deployed to collect data, perform calculations, and forward information to either other nodes or sink nodes. Recently, geographic routing has become extremely popular because it only requires the locations of sensor nodes and is very efficient. However,...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
KeAi Communications Co., Ltd.
2022-10-01
|
| Series: | Digital Communications and Networks |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2352864821000572 |
| _version_ | 1811313903370502144 |
|---|---|
| author | Jianjun Yang |
| author_facet | Jianjun Yang |
| author_sort | Jianjun Yang |
| collection | DOAJ |
| description | In wireless sensor networks, sensor nodes are deployed to collect data, perform calculations, and forward information to either other nodes or sink nodes. Recently, geographic routing has become extremely popular because it only requires the locations of sensor nodes and is very efficient. However, the local minimum phenomenon, which hinders greedy forwarding, is a major problem in geographic routing. This phenomenon is attributed to an area called a hole that lacks active sensors, which either prevents the packet from being forwarded to a destination node or produces a long detour path. In order to solve the hole problem, mechanisms to detect holes and determine landmark nodes have been proposed. Based on the proposed mechanisms, landmark-based routing was developed in which the source node first sends a packet to the landmark node, and the landmark node then sends the packet to the destination. However, this approach often creates a constant node sequence, causing nodes that perform routing tasks to quickly run out of energy, thus producing larger holes. In this paper, a new approach is proposed in which two virtual ellipses are created with the source, landmark, and destination nodes. Then guide the forwarding along the virtual ellipses. Furthermore, a recursive algorithm is designed to ensure a shortcut even if there are multiple holes or a hole has multiple landmarks. Thus, the proposed approach improves both geographic routing and energy efficiency routing. Simulation experiments show that the proposed approach increases the battery life of sensor nodes, lowers the end-to-end delay, and generates a short path. |
| first_indexed | 2024-04-13T11:02:52Z |
| format | Article |
| id | doaj.art-0a789dc18e324403a2e79f0551bceba7 |
| institution | Directory Open Access Journal |
| issn | 2352-8648 |
| language | English |
| last_indexed | 2024-04-13T11:02:52Z |
| publishDate | 2022-10-01 |
| publisher | KeAi Communications Co., Ltd. |
| record_format | Article |
| series | Digital Communications and Networks |
| spelling | doaj.art-0a789dc18e324403a2e79f0551bceba72022-12-22T02:49:20ZengKeAi Communications Co., Ltd.Digital Communications and Networks2352-86482022-10-0185770777An ellipse-guided routing algorithm in wireless sensor networksJianjun Yang0Department of Computer Science and Information Systems, University of North Georgia, Oakwood, GA, 30566, USAIn wireless sensor networks, sensor nodes are deployed to collect data, perform calculations, and forward information to either other nodes or sink nodes. Recently, geographic routing has become extremely popular because it only requires the locations of sensor nodes and is very efficient. However, the local minimum phenomenon, which hinders greedy forwarding, is a major problem in geographic routing. This phenomenon is attributed to an area called a hole that lacks active sensors, which either prevents the packet from being forwarded to a destination node or produces a long detour path. In order to solve the hole problem, mechanisms to detect holes and determine landmark nodes have been proposed. Based on the proposed mechanisms, landmark-based routing was developed in which the source node first sends a packet to the landmark node, and the landmark node then sends the packet to the destination. However, this approach often creates a constant node sequence, causing nodes that perform routing tasks to quickly run out of energy, thus producing larger holes. In this paper, a new approach is proposed in which two virtual ellipses are created with the source, landmark, and destination nodes. Then guide the forwarding along the virtual ellipses. Furthermore, a recursive algorithm is designed to ensure a shortcut even if there are multiple holes or a hole has multiple landmarks. Thus, the proposed approach improves both geographic routing and energy efficiency routing. Simulation experiments show that the proposed approach increases the battery life of sensor nodes, lowers the end-to-end delay, and generates a short path.http://www.sciencedirect.com/science/article/pii/S2352864821000572Sensor networksHoleLandmarkEllipseGeographic routingEnergy efficiency |
| spellingShingle | Jianjun Yang An ellipse-guided routing algorithm in wireless sensor networks Digital Communications and Networks Sensor networks Hole Landmark Ellipse Geographic routing Energy efficiency |
| title | An ellipse-guided routing algorithm in wireless sensor networks |
| title_full | An ellipse-guided routing algorithm in wireless sensor networks |
| title_fullStr | An ellipse-guided routing algorithm in wireless sensor networks |
| title_full_unstemmed | An ellipse-guided routing algorithm in wireless sensor networks |
| title_short | An ellipse-guided routing algorithm in wireless sensor networks |
| title_sort | ellipse guided routing algorithm in wireless sensor networks |
| topic | Sensor networks Hole Landmark Ellipse Geographic routing Energy efficiency |
| url | http://www.sciencedirect.com/science/article/pii/S2352864821000572 |
| work_keys_str_mv | AT jianjunyang anellipseguidedroutingalgorithminwirelesssensornetworks AT jianjunyang ellipseguidedroutingalgorithminwirelesssensornetworks |