A Fault-Tolerant Protocol for Energy-Efficient Permutation Routing in Wireless Networks
IEEE Transactions on Computers
Monitoring churn in wireless networks
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Monitoring churn in wireless networks
Theoretical Computer Science
| Hi-index | 0.00 |
Sensor networks are usually designed and optimized fora specific functionality, and the nature of tasks on differentnodes and the pattern of communication between nodesis known at design time.We are investigating a design approachfor sensor networks that involves the creation of robustand energy-efficient protocols for a library of generalcommunication primitives.Such a library will hide low-levelnetworking details and provide building blocks for theend user who can then focus on high level design of the application.In this paper, we consider single hop sensor networkswith multiple data channels, and define and evaluatethe performance of a simple and energy-efficient protocolfor a general and powerful primitive called (N, p, k驴, k驴)routing.This primitive denotes the transfer of N packetsamong p nodes with each node transmitting at most k驴 packetsand each node expecting to receive at most k驴 packets.One-to-all (broadcast), all-to-one (gather), many-to-many,etc., are special cases of (N, p, k驴, k驴) routing.Weuse a separate low-power control channel for coordinationamong nodes.Simulation results show that our protocolleads to very high utilization of the available databandwidth, and is also energy balanced.Fault-tolerant extensionsof the protocol are also discussed.