scispace - formally typeset
Search or ask a question
Book ChapterDOI

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

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.
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.
References
More filters
Proceedings ArticleDOI
12 Dec 2005
TL;DR: An energy-efficient unequal clustering mechanism for periodical data gathering in wireless sensor networks that partitions the nodes into clusters of unequal size, and clusters closer to the base station can preserve some energy for the inter-cluster data forwarding.
Abstract: Clustering provides an effective way for prolonging the lifetime of a wireless sensor network. Current clustering algorithms usually utilize two techniques, selecting cluster heads with more residual energy and rotating cluster heads periodically, to distribute the energy consumption among nodes in each cluster and extend the network lifetime. However, they rarely consider the hot spots problem in multihop wireless sensor networks. When cluster heads cooperate with each other to forward their data to the base station, the cluster heads closer to the base station are burdened with heavy relay traffic and tend to die early, leaving areas of the network uncovered and causing network partition. To address the problem, we propose an energy-efficient unequal clustering (EEUC) mechanism for periodical data gathering in wireless sensor networks. It partitions the nodes into clusters of unequal size, and clusters closer to the base station have smaller sizes than those farther away from the base station. Thus cluster heads closer to the base station can preserve some energy for the inter-cluster data forwarding. We also propose an energy-aware multihop routing protocol for the inter-cluster communication. Simulation results show that our unequal clustering mechanism balances the energy consumption well among all sensor nodes and achieves an obvious improvement on the network lifetime

654 citations

Journal ArticleDOI
TL;DR: A novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers and a semi-Markov model is developed which provides a more accurate performance evaluation.
Abstract: In this paper, we study a novel forwarding technique based on geographical location of the nodes involved and random selection of the relaying node via contention among receivers. We provide a detailed description of a MAC scheme based on these concepts and on collision avoidance and report on its energy and latency performance. A simplified analysis is given first, some relevant trade offs are highlighted, and parameter optimization is pursued. Further, a semi-Markov model is developed which provides a more accurate performance evaluation. Simulation results supporting the validity of our analytical approach are also provided.

618 citations


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

  • ...In GeRaF [25], sensor node acts as relay is not known a priori by a sender and there is no guarantee that a sender will always be able to forward the message toward its ultimate destination....

    [...]

  • ...[25], is a forwarding strategy for achieving a good tradeoff between location progress and delay for WSNs with random...

    [...]

  • ...The design goal of GeRaF [25] is to deliver each packet to sink via as few hops as possible....

    [...]

  • ...Best-effort forwarding RTS/ a CTS message mechanism are employed in GeRaF [25] and back-off time increases the reliability....

    [...]

  • ...In GeRaF [25], sensor node acts as relay is not known...

    [...]

Journal ArticleDOI
01 Dec 2003
TL;DR: This paper proposes two new algorithms under name PEDAP (Power Efficient Data gathering and Aggregation Protocol), which are near optimal minimum spanning tree based routing schemes, where one of them is the power-aware version of the other.
Abstract: Recent developments in processor, memory and radio technology have enabled wireless sensor networks which are deployed to collect useful information from an area of interest. The sensed data must be gathered and transmitted to a base station where it is further processed for end-user queries. Since the network consists of low-cost nodes with limited battery power, power efficient methods must be employed for data gathering and aggregation in order to achieve long network lifetimes.In an environment where in a round of communication each of the sensor nodes has data to send to a base station, it is important to minimize the total energy consumed by the system in a round so that the system lifetime is maximized. With the use of data fusion and aggregation techniques, while minimizing the total energy per round, if power consumption per node can be balanced as well, a near optimal data gathering and routing scheme can be achieved in terms of network lifetime.So far, besides the conventional protocol of direct transmission, two elegant protocols called LEACH and PEGASIS have been proposed to maximize the lifetime of a sensor network. In this paper, we propose two new algorithms under name PEDAP (Power Efficient Data gathering and Aggregation Protocol), which are near optimal minimum spanning tree based routing schemes, where one of them is the power-aware version of the other. Our simulation results show that our algorithms perform well both in systems where base station is far away from and where it is in the center of the field. PEDAP achieves between 4x to 20x improvement in network lifetime compared with LEACH, and about three times improvement compared with PEGASIS.

601 citations

Proceedings ArticleDOI
01 Jun 2003
TL;DR: GOAFR is the first ad-hoc algorithm to be both asymptotically optimal and average-case efficient and study a dozen of routing algorithms and shows that GOAFR outperforms other prominent algorithms, such as GPSR or AFR.
Abstract: In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive simulation. GOAFR is the first ad-hoc algorithm to be both asymptotically optimal and average-case efficient. For our simulations we identify a network density range critical for any routing algorithm. We study a dozen of routing algorithms and show that GOAFR outperforms other prominent algorithms, such as GPSR or AFR.

556 citations

Journal ArticleDOI
TL;DR: The analysis shows quantitatively the advantage of interleaved mesh over multiple parallel paths and shows that GRAB can successfully deliver over 90% of packets with relatively low energy cost, even under the adverse conditions of 30% node failures compounded with 15% link message losses.
Abstract: Although data forwarding algorithms and protocols have been among the first set of issues explored in sensor networking, how to reliably deliver sensing data through a vast field of small, vulnerable sensors remains a research challenge. In this paper we present GRAdient Broadcast (GRAB), a new set of mechanisms and protocols which is designed specifically for robust data delivery in face of unreliable nodes and fallible wireless links. Similar to previous work [12,13], GRAB builds and maintains a cost field, providing each sensor the direction to forward sensing data. Different from all the previous approaches, however, GRAB forwards data along a band of interleaved mesh from each source to the receiver. GRAB controls the width of the band by the amount of credit carried in each data message, allowing the sender to adjust the robustness of data delivery. GRAB design harnesses the advantage of large scale and relies on the collective efforts of multiple nodes to deliver data, without dependency on any individual ones. We have evaluated the GRAB performance through both analysis and extensive simulation. Our analysis shows quantitatively the advantage of interleaved mesh over multiple parallel paths. Our simulation further confirms the analysis results and shows that GRAB can successfully deliver over 90% of packets with relatively low energy cost, even under the adverse conditions of 30% node failures compounded with 15% link message losses.

534 citations


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

  • ...GRAB [32] employs event driven refreshing of the cost field that can ensure that the information about link failures spreads throughout the network and avoids the counting to infinity problem....

    [...]

  • ...The credit assignment in the GRAB [32] packets are made adaptive to the local network conditions....

    [...]

  • ...scale sensor networks namely Gradient Broadcast routing protocol [32]....

    [...]

  • ...In GRAB [32], node with sufficient power level and minimum cost path reach its next hop neighbor....

    [...]