2020•2020 5th International Conference on Computer and Communication Systems (ICCCS)Requires access

Landmark Based Circle Routing in Wireless Sensor Networks

Jianjun Yang, Juan Guo, Ju Shen, Mingyuan Yan

Open publisher page 3 citations

Abstract

Hole problem is a hot issue of Geographic Routing in Wireless Sensor Networks, which is caused by an area without active sensors that blocks the greedy forwarding process, thus long detour path is produced. One of the common solutions is to find a landmark and generate a routing path from the source sensor to the landmark node first, then the landmark resumes routing until to the destination to avoid long detour path. However, this approach results in a constant path prior to routing process, then the forwarding nodes in the path afford routing while other nodes are idle even if they are very close to the pre-setup routing path, thus the busy nodes run out of their energy soon and the hole is larger. In this paper, we present a novel approach, in which circles are created to guide routing thus the idle nodes near the routing path participate in the forwarding. As such, our new mechanism benefits both geographic routing and energy efficiency routing. Simulation results demonstrate that our approach significantly prolongs the lifetime of sensors over peer approaches while almost keeps the same short path as landmark based routing algorithms.

About this research paper

What this paper is about

Hole problem is a hot issue of Geographic Routing in Wireless Sensor Networks, which is caused by an area without active sensors that blocks the greedy forwarding process, thus long detour path is produced. One of the common solutions is to find a landmark and generate a routing path from the source sensor to the landmark node first, then the landmark resumes routing until to the destination to avoid long detour path. However, this approach results in a constant path prior to routing process, then the forwarding nodes in the path afford routing while other nodes are idle even if they are very close to the pre-setup routing path, thus the busy nodes run out of their energy soon and the hole is larger. In this paper, we present a novel approach, in which circles are created to guide routing thus the idle nodes near the routing path participate in the forwarding. As such, our new mechanism benefits both geographic routing and energy efficiency routing. Simulation results demonstrate that our approach significantly prolongs the lifetime of sensors over peer approaches while almost keeps the same short path as landmark based routing algorithms.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Hole problem is a hot issue of Geographic Routing in Wireless Sensor Networks, which is caused by an area without active sensors that blocks the greedy forwarding process, thus long detour path is produced. One of the common solutions is to find a landmark and generate a routing path from the source sensor to the landmark node first, then the landmark resumes routing until to the destination to avoid long detour path. However, this approach results in a constant path prior to routing process, then the forwarding nodes in the path afford routing while other nodes are idle even if they are very close to the pre-setup routing path, thus the busy nodes run out of their energy soon and the hole is larger. In this paper, we present a novel approach, in which circles are created to guide routing thus the idle nodes near the routing path participate in the forwarding. As such, our new mechanism benefits both geographic routing and energy efficiency routing. Simulation results demonstrate that our approach significantly prolongs the lifetime of sensors over peer approaches while almost keeps the same short path as landmark based routing algorithms.

Key concepts: Equal-cost multi-path routing, Static routing, Computer network, Dynamic Source Routing, Computer science, Link-state routing protocol, Multipath routing, Policy-based routing

Related papers

Back to paper searchBrowse research topicsOriginal source
Landmark Based Circle Routing in Wireless Sensor Networks — Research Paper | ScholarLens