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
10 May 2011
TL;DR: The simulation results demonstrate that the proposed algorithms can remove the cluster overlapping phenomenon of the original algorithms and prolong the lifetime of the wireless sensor networks.
Abstract: Clustering algorithm is one of the hotspots for studying routing protocol in wireless sensor networks, which can help to enlarge the network topology and utilize the capacity of channel efficiently. In this paper, we present a maximum degree and negotiation strategy based clustering algorithm to solve the cluster overlapping problem. It selects candidate according to maximum degree and determines the Cluster-Head according to the negotiation strategy. The negotiation strategy can also be applied to the weighted clustering algorithm. The simulation results demonstrate that the proposed algorithms can remove the cluster overlapping phenomenon of the original algorithms and prolong the lifetime of the wireless sensor networks.
2 citations
19 Sep 2019
TL;DR: The results show that the proposed technique is simple, efficient and capable of successful dealing with congestion in WSN while preserving the performance characteristics of the network.
Abstract: In wireless sensor networks, event based applications prone to traffic congestion and unforeseen event detection produce an unremitting generation of traffic throughout the network. The congestion control procedure is used to monitor the process of adapting the total amount of data and concerns to control the network traffic levels to an acceptable value. The performance control mechanism can be conceded through robust congestion control techniques to uphold the operational networks under different conditions. Congestion in sensor networks has to be controlled to achieve high energy efficiency, to prolong the life of the system, improve equity, the quality of service in terms of throughput, packet loss and delay. The information gleaned from an extensive review is shared to reinforce the knowledge base to design a scalable distributed cluster based framework for alleviating buffer based congestion in WSNs and evenly dispense the energy usage among all nodes within the networks. The results show that the proposed technique is simple, efficient and capable of successful dealing with congestion in WSN while preserving the performance characteristics of the network.
1 citations
28 Sep 2016
TL;DR: This paper has presented a hierarchical data aggregation based routing algorithm which outperforms other existing approaches for routing in Wireless Sensor Networks.
Abstract: Designing routing protocols to serve real time disaster management, is a challenging task involving optimum energy utilization along with reduced delay in event reporting. In this paper, we have focused on the data aggregation techniques which alleviate the constraints of sensor networks and put forward as an essential paradigm for routing in Wireless Sensor Networks. We have presented a hierarchical data aggregation based routing algorithm. Extensive analysis and simulation shows that proposed algorithm outperforms other existing approaches.
1 citations