A Study on Energy-Efficient Routing Protocols for Wireless Sensor Networks

doi:10.1007/978-981-15-5747-7_9

Book Chapter•DOI•

A Study on Energy-Efficient Routing Protocols for Wireless Sensor Networks

Soumyabrata Saha¹, Rituparna Chaki²•Institutions (2)

JIS College of Engineering¹, University of Calcutta²

01 Jan 2021-Advances in intelligent systems and computing (Springer, Singapore)-Vol. 1178, pp 125-143

TL;DR: A number of striking routing algorithms have been studied to afford an insight into energy-efficient designs and present a generous study of different topology control techniques for sensor networks.

read less

Abstract: Wireless sensor networks entail of miniaturized battery-powered sensor nodes with inhibited computational competency. Thus, a routing protocol for sensor networks needs to ensure uniform energy dispersal during its operation. In addition, it is also expected to guarantee fast data delivery irrespective of node density, besides being flexible in terms of the routing framework and route computation metric. The restricted and constrained resources in wireless sensor networks have directed research towards minimization of energy consumption, reduced storage usage and complexity of routing functionalities. In this paper, a number of striking routing algorithms have been studied to afford an insight into energy-efficient designs and present a generous study of different topology control techniques for sensor networks. The routing protocols have been categorized based on the underlying network structure: flat, location based and hierarchical. For all of the protocol families, authors have stressed on the primary motivation behind the development and expounded their operation along with the advantages and disadvantages of those protocols. In conclusion, a number of open research issues have been pointed as an outcome for achieving energy adeptness in the development of routing protocols.

...read moreread less

References

PDF

Open Access

More filters

Proceedings Article•DOI•

A scalable solution to minimum cost forwarding in large sensor networks

[...]

Fan Ye¹, Alvin Chen, Songwu Lu, Lixia Zhang•Institutions (1)

University of California, Los Angeles¹

15 Oct 2001

TL;DR: This work presents a novel backoff-based cost field setup algorithm that finds the optimal costs of all nodes to the sink with one single message overhead at each node in a large sensor network.

...read moreread less

Abstract: Wireless sensor networks offer a wide range of challenges to networking research, including unconstrained network scale, limited computing, memory and energy resources, and wireless channel errors. We study the problem of delivering messages from any sensor to an interested client user along the minimum-cost path in a large sensor network. We propose a new cost field based approach to minimum cost forwarding. In the design, we present a novel backoff-based cost field setup algorithm that finds the optimal costs of all nodes to the sink with one single message overhead at each node. Once the field is established, the message, carrying dynamic cost information, flows along the minimum cost path in the cost field. Each intermediate node forwards the message only if it finds itself to be on the optimal path, based on dynamic cost states. Our design does not require an intermediate node to maintain explicit "forwarding path" states. It requires a few simple operations and scales to any network size. We show the correctness and effectiveness of the design by both simulations and analysis.

...read moreread less

475 citations

"A Study on Energy-Efficient Routing..." refers background or methods in this paper

...presented Minimum Cost Forwarding Algorithm [8] which exploits that the direction of routing is always known....
[...]
...MCFA [8] was modified to run a back off algorithm at the setup phase....
[...]
...Ye et.al. presented Minimum Cost Forwarding Algorithm [8] which exploits that the direction of routing is always known....
[...]
...In MCFA [8], each node should know the least cost path estimate from itself to the base station....
[...]
...In MCFA [8], each node maintains the least cost estimate from itself to the sink and each message to be forwarded by the sensor node, which is broadcast to its neighbors....
[...]

Proceedings Article•DOI•

Energy-efficient forwarding strategies for geographic routing in lossy wireless sensor networks

[...]

Karim Seada¹, Marco Zuniga¹, Ahmed Helmy¹, Bhaskar Krishnamachari¹•Institutions (1)

University of Southern California¹

03 Nov 2004

TL;DR: The analysis, simulations and experiments all show that the product of the packet reception rate (PRR) and the distance traversed towards destination is the optimal forwarding metric for the ARQ case, and is a good metric even without ARQ.

...read moreread less

Abstract: Recent experimental studies have shown that wireless links in real sensor networks can be extremely unreliable, deviating to a large extent from the idealized perfect-reception-within-range models used in common network simulation tools. Previously proposed geographic routing protocols commonly employ a maximum-distance greedy forwarding technique that works well in ideal conditions. However, such a forwarding technique performs poorly in realistic conditions as it tends to forward packets on lossy links. We identify and illustrate this weak-link problem and the related distance-hop trade-off, whereby energy efficient geographic forwarding must strike a balance between shorter, high-quality links, and longer lossy links. The study is done for scenarios with and without automatic repeat request (ARQ).Based on an analytical link loss model, we study the distance-hop trade-off via mathematical analysis and extensive simulations of a wide array of blacklisting/link-selection strategies; we also validate some strategies using a set of real experiments on motes. Our analysis, simulations and experiments all show that the product of the packet reception rate (PRR) and the distance traversed towards destination is the optimal forwarding metric for the ARQ case, and is a good metric even without ARQ. Nodes using this metric often take advantage of neighbors in the transitional region (high-variance links). Our results also show that reception-based forwarding strategies are more efficient than purely distance-based strategies; relative blacklisting schemes reduce disconnections and achieve higher delivery rates than absolute blacklisting schemes; and that ARQ schemes become more important in larger networks.

...read moreread less

453 citations

"A Study on Energy-Efficient Routing..." refers background in this paper

...In EEFS [30] nodes are randomly distributed in the network and aims to improve...
[...]
...Elrahim et.al. proposed a geographic routing algorithm IJSER IJSER © 2016 http://www.ijser.org based on greedy forwarding named as Energy Aware Geographic Routing Protocol [40] ....
[...]
...Wang et.al. proposed an energy efficient algorithm named as Energy Aware Geographic Routing [37], which is designed for mobile environments and makes use of residual energy information in greedy and recovery mode alike....
[...]
...In EEFS [30] neighbors are classified based on link reliability and neighbor selection has been used....
[...]
...proposed Energy Efficient Forwarding Strategies for Geographic Routing [30] which assumes a positioning system to account for the location knowledge....
[...]

Journal Article•DOI•

ASCENT: adaptive self-configuring sensor networks topologies

[...]

Alberto E. Cerpa¹, Deborah Estrin¹•Institutions (1)

University of California, Los Angeles¹

01 Jul 2004-IEEE Transactions on Mobile Computing

TL;DR: The ASCENT algorithm is motivated and described and it is shown that the system achieves linear increase in energy savings as a function of the density and the convergence time required in case of node failures while still providing adequate connectivity.

...read moreread less

Abstract: Advances in microsensor and radio technology enable small but smart sensors to be deployed for a wide range of environmental monitoring applications. The low-per node cost allows these wireless networks of sensors and actuators to be densely distributed. The nodes in these dense networks coordinate to perform the distributed sensing and actuation tasks. Moreover, as described in this paper, the nodes can also coordinate to exploit the redundancy provided by high density so as to extend overall system lifetime. The large number of nodes deployed in this systems preclude manual configuration, and the environmental dynamics precludes design-time preconfiguration. Therefore, nodes have to self-configure to establish a topology that provides communication under stringent energy constraints. ASCENT builds on the notion that, as density increases, only a subset of the nodes is necessary to establish a routing forwarding backbone. In ASCENT, each node assesses its connectivity and adapts its participation in the multihop network topology based on the measured operating region. This paper motivates and describes the ASCENT algorithm and presents analysis, simulation, and experimental measurements. We show that the system achieves linear increase in energy savings as a function of the density and the convergence time required in case of node failures while still providing adequate connectivity.

...read moreread less

452 citations

"A Study on Energy-Efficient Routing..." refers background in this paper

...ASCENT [28] does not detect network partitions nor does it attempt to repair them....
[...]
...ASCENT [28] operates in between the MAC and network layers and only determines which nodes join the routing infrastructure and does not utilize or modify state maintained by the routing protocol....
[...]
...Networks Topologies system [28], where subset of the nodes is actually required to establish connectivity in a dense network....
[...]
...In ASCENT [28], each node determines its connectivity and follows a reactive algorithm that responds to changes in the network characteristics....
[...]

Journal Article•DOI•

Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks

[...]

Ivan Stojmenovic¹, Xu Lin•Institutions (1)

Ottawa University¹

01 Oct 2001-IEEE Transactions on Parallel and Distributed Systems

TL;DR: 2-hop GEDIR, DIR, and MFR methods in which node A selects the best candidate node C among its 1-hop and 2-hop neighbors according to the corresponding criterion and forwards m to its best1-hop neighbor among joint neighbors of A and C are proposed.

...read moreread less

Abstract: In a localized routing algorithm, each node makes forwarding decisions solely based on the position of itself, its neighbors, and its destination. In distance, progress, and direction-based approaches'(reported in the literature), when node A wants to send or forward message m to destination node D, it forwards m to its neighbor C which is closest to D (has best progress toward D, whose direction is closest to the direction of D, respectively) among all neighbors of A. The same procedure is repeated until D, if possible, is eventually reached. The algorithms are referred to as GEDIR, MFR, and DIR when a common failure criterion is introduced: The algorithm stops if the best choice for the current node is the node from which the message came. We propose 2-hop GEDIR, DIR, and MFR methods in which node A selects the best candidate node C among its 1-hop and 2-hop neighbors according to the corresponding criterion and forwards m to its best 1-hop neighbor among joint neighbors of A and C. We then propose flooding GEDIR and MFR and hybrid single-path/flooding GEDIR and MFR methods which are the first localized algorithms (other than full flooding) to guarantee the message delivery (in a collision-free environment). We show that the directional routing methods are not loop-free, while the GEDIR and MFR-based methods are inherently loop free. The simulation experiments, with static random graphs, show that GEDIR and MFR have similar success rates, which is low for low degree graphs and high for high degree ones. When successful, their hop counts are near the performance of the shortest path algorithm. Hybrid single-path/flooding GEDIR and MFR methods have low communication overheads. The results are also confirmed by experiments with moving nodes and MAC layer.

...read moreread less

447 citations

"A Study on Energy-Efficient Routing..." refers background or methods in this paper

...DIR [10] is named as Compass routing as it minimizes the angle between the computed direction and the direction source destination....
[...]
...GEDIR [4] algorithm has been proposed with different forwarding methods: one-hop GEDIR (GEDIR), 2-hop GEDIR (GEDIR-2), flooding GEDIR (GEDIR-f) and 2 hop flooding GEDIR (2-f-GEDIR)....
[...]
...In DIR [10] method, the best neighbor has the closest direction toward the destination, i.e. the neighbor with the minimum angular distance from the imaginary line joining the current node and the destination is selected....
[...]
...The hybrid single-path/flooding GEDIR [4] was designed for mobility issues and to provide guaranteed delivery for the static case....
[...]
...Stojmenovic et.al.proposed DIR [10] algorithm, where the sending node uses the destination node information to calculate the message forwarding direction....
[...]

Posted Content•

Minimum-Energy Mobile Wireless Networks Revisited

[...]

Erran L. Li, Joseph Y. Halpern

05 Sep 2002-arXiv: Networking and Internet Architecture

TL;DR: In this article, the authors propose a protocol that, given a communication network, computes a subnetwork such that, for every pair of nodes connected in the original network, there is a minimum-energy path between $u$ and $v$ in the subnetwork.

...read moreread less

Abstract: We propose a protocol that, given a communication network, computes a subnetwork such that, for every pair $(u,v)$ of nodes connected in the original network, there is a minimum-energy path between $u$ and $v$ in the subnetwork (where a minimum-energy path is one that allows messages to be transmitted with a minimum use of energy). The network computed by our protocol is in general a subnetwork of the one computed by the protocol given in [13]. Moreover, our protocol is computationally simpler. We demonstrate the performance improvements obtained by using the subnetwork computed by our protocol through simulation.

...read moreread less

430 citations

Collapse

A Study on Energy-Efficient Routing Protocols for Wireless Sensor Networks

References

"A Study on Energy-Efficient Routing..." refers background or methods in this paper

"A Study on Energy-Efficient Routing..." refers background in this paper

"A Study on Energy-Efficient Routing..." refers background in this paper

"A Study on Energy-Efficient Routing..." refers background or methods in this paper

Related Papers (5)