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
01 Nov 2007
TL;DR: A QoS-aware routing protocol for event-driven, query-based and periodic Wireless Sensor Networks (WSNs) that proposes an energy- aware approach by alternating the nodes responsible for inter- cluster communication while supporting network connectivity and avoiding congested links is presented.
Abstract: This paper presents a QoS-aware routing protocol for event-driven, query-based and periodic Wireless Sensor Networks (WSNs). This algorithm is cluster-based and aims at optimizing energy dissipation in the network as well as providing fault tolerance and connectivity to the network. It uses clusterhead nodes and the nodes closest to each other within two neighboring clusters for relaying messages. Thus, message propagation through the network is accomplished by using short transmissions. Moreover, the algorithm proposes an energy- aware approach by alternating the nodes responsible for inter- cluster communication while supporting network connectivity and avoiding congested links. We discuss the implementation of our protocol and present its proof of correctness.
33 citations
TL;DR: The proposed method is found to lower the false alarm rate, which is one of the basic problems for the one-class SVM, and a new approach, called Collective Probabilistic Labeling (CPL) is presented to update clusters incrementally, which makes the updating phase noise-resistant and fast.
32 citations
27 Dec 2008
TL;DR: An energy-efficient, weighted clustering algorithm is proposed which improves the cluster formation process of LEACH by taking residual energy, mutual position, workload balance and MAC functioning in to consideration and the algorithm is flexible and coefficients can be adjusted according to different networks.
Abstract: In recent years, the wireless sensor networks (WSN) attracts increasing attention due to its bright application prospect in both military and civil fields. However, for the WSN is extremely energy limited, the traditional network routing protocols are not suitable to it. Energy conservation becomes a crucial problem in WSN routing protocol. Cluster-based routing protocols such as LEACH conserve energy by forming clusters which only cluster heads need to consume extra energy to perform data aggregation and transmit it to base station. Unfortunately, cluster formation not only dissipates lots of energy but also increases overhead. We propose an energy-efficient, weighted clustering algorithm which improves the cluster formation process of LEACH by taking residual energy, mutual position, workload balance and MAC functioning in to consideration. The algorithm is flexible and coefficients can be adjusted according to different networks. The simulation experiments demonstrate the proposed algorithm in this paper is better in performance than LEACH.
27 citations
31 Oct 2004
TL;DR: A new mechanism called intermediate wake-up periods is introduced in this work in order to reduce the energy costs of low delay applications.
Abstract: We present a performance evaluation of the pulse protocol operating in a sensor network. In this work, a number of modifications are made to the original pulse protocol to provide efficient operation in a sensor network environment. The pulse protocol utilizes a periodic flood (the pulse) initiated by a single node (the pulse source) to provide both routing and synchronization to the network. This periodic pulse forms a pro-actively updated spanning tree rooted at the pulse source. Nodes communicate by forwarding packets through this tree. In addition, nodes are able to synchronize with the periodic pulse, allowing idle nodes to power off their radios a large percentage of the time when they are not required for packet forwarding. This results in substantial energy savings. A new mechanism called intermediate wake-up periods is introduced in this work in order to reduce the energy costs of low delay applications. Through simulation we explore the performance of both the protocol and the modifications with respect to energy efficiency and delay.
18 citations
"A Study on Energy-Efficient Routing..." refers methods in this paper
...For achieving energy efficiency, Pulse protocol [27] has been modified to incorIJSER...
[...]
...Pulse protocol [27] has been provided a path deactivation feature to allow nodes to...
[...]
14 Jun 2009
TL;DR: This paper studies the optimal distance of existing power-saving geographic routing algorithms and proposes a novel geographic routing algorithm which is robust to location errors, thus statistically minimizing consumed transmit power as a packet is relayed from source to destination.
Abstract: Existing power efficient geographic routing algorithms have been shown to be able to reduce power consumption and hence prolong the lifetime of multi-hop wireless networks. However, in practical deployment scenarios where location errors inevitably exist, these algorithms are vulnerable to a substantial performance degradation in terms of energy consumption. Since location errors always exist no matter which localization technique is used, there is the need of a geographic routing protocol which can tolerate location errors and achieve reduced energy consumption. In this paper, we study the optimal distance of existing power-saving geographic routing algorithms. Through incorporating location errors into an objective function, we propose a novel geographic routing algorithm. Extensive performance evaluations show that our proposal is robust to location errors, thus statistically minimizing consumed transmit power as a packet is relayed from source to destination.
14 citations
"A Study on Energy-Efficient Routing..." refers background in this paper
...Peng et.al. proposed a Least Expected Distance Routing Algorithm [36], takes into account the inevitable presence of location errors in the localization process inherent to geographic routing....
[...]
...proposed a Least Expected Distance Routing Algorithm [36], takes into account the inevitable presence of lo-...
[...]