scispace - formally typeset
Book ChapterDOI

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

TLDR
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.

read more

References
More filters
Proceedings ArticleDOI

Trajectory based forwarding and its applications

TL;DR: TBF decouples path naming from the actual path; it provides cheap path diversity; it trades off communication for computation; and these aspects address the double scalability issue with respect to mobility rate and network size.

Energy Efficient Routing in Wireless Sensor Networks

TL;DR: In this paper, it is shown that in order to find the routes that give energy efficiency, a set of partial differential equations similar to the Maxwell's equations in the electrostatic theory can be solved.
Proceedings ArticleDOI

Minimum-energy mobile wireless networks revisited

TL;DR: 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 a minimum-energy path between u and /spl upsi/ in the subnetwork (where aMinimumEnergy path is one that allows messages to be transmitted with a minimum use of energy).
Journal ArticleDOI

INSENS: Intrusion-tolerant routing for wireless sensor networks

TL;DR: INSENS as discussed by the authors is a tree-structured routing protocol for WSNs that is designed to tolerate damage caused by an intruder who has compromised deployed sensor nodes and is intent on injecting, modifying, or blocking packets.
Proceedings ArticleDOI

Constrained random walks on random graphs: routing algorithms for large scale wireless sensor networks

TL;DR: This paper formalizes the corresponding routing problem as a problem of constructing suitably constrained random walks on random dynamic graphs, and argues that these random walks should be designed so that their resulting invariant distribution achieves a certain load balancing property.