SIAM Journal on Computing
The wakeup problem in synchronous broadcast systems (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Ariadne: a secure on-demand routing protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Asynchronous wakeup for ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
| Hi-index | 14.98 |
Consider a distributed system that delivers a set of services (such as message routing, maintenance of a global invariant, leader election, mutual exclusion, and so forth) to a distributed application. Such a system often provides its services at all times, regardless of whether or not these services are in demand at any given time. This leads to wasteful use of system resources. In this paper, we propose a novel stabilizing protocol for deactivating the system services in the absence of demand and reactivating the services upon demand. The proposed protocol is simple enough. When a process needs a service, it periodically sends messages that reach every other process in the system and causes every process to reactivate the service. For this purpose, only a single-type message carrying no information is sent in the system. When no process needs the service, the sending of messages is stopped, causing every process to deactivate the service. The proposed system has many applications in mobile and sensor networks.