IEEE Transactions on Information Theory
A lower bound for radio broadcast
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Randomized algorithms
Tail bounds for occupancy and the satisfiability threshold conjecture
Random Structures & Algorithms
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Faster Deterministic Broadcasting in Ad Hoc Radio Networks
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Centralized broadcast in multihop radio networks
Journal of Algorithms
Wireless sensor networks: a new regime for time synchronization
ACM SIGCOMM Computer Communication Review
Asynchronous wakeup for ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Power management for energy-aware communication systems
ACM Transactions on Embedded Computing Systems (TECS)
Broadcasting in undirected ad hoc radio networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Power-saving protocols for IEEE 802.11-based multi-hop ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Deterministic broadcasting in ad hoc radio networks
Distributed Computing
Improved interval-based clock synchronization in sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Broadcast in radio networks tolerating byzantine adversarial behavior
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Versatile low power media access for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Simulating the power consumption of large-scale sensor network applications
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Node-level energy management for sensor networks in the presence of multiple applications
Wireless Networks - Special issue: Pervasive computing and communications
Fine-grained network time synchronization using reference broadcasts
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications
Proceedings of the 6th ACM conference on Embedded network sensor systems
Deterministic and energy-optimal wireless synchronization
DISC'11 Proceedings of the 25th international conference on Distributed computing
Clock synchronization for wireless networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
IEEE 802.11 protocol: design and performance evaluation of an adaptive backoff mechanism
IEEE Journal on Selected Areas in Communications
Time synchronization in sensor networks: a survey
IEEE Network: The Magazine of Global Internetworking
Hi-index | 5.23 |
In this paper, we consider the model of communication where wireless devices can either switch their radios off to save energy (and hence, can neither send nor receive messages), or switch their radios on and engage in communication. The problem has been extensively studied in practice, in the setting such as deployment and clock synchronization of wireless sensor networks. We distill a clean theoretical formulation of minimizing radio use and present near-optimal solutions. Our base model ignores issues of communication interference, although we also extend the model to handle this requirement. We assume that nodes intend to communicate periodically, or according to some time-based schedule. Clearly, perfectly synchronized devices could switch their radios on for exactly the minimum periods required by their joint schedules. The main challenge in the deployment of wireless networks is to synchronize the devices' schedules, given that their initial schedules may be offset relative to one another (even if their clocks run at the same speed). In this paper, we study how frequently the devices must switch on their radios in order to both synchronize their clocks and communicate. In this setting, we significantly improve previous results, and show optimal use of the radio for two processors and near-optimal use of the radio for synchronization of an arbitrary number of processors. In particular, for two processors we prove deterministic matching @Q(d) upper and lower bounds on the number of times the radio has to be on, where d is the discretized uncertainty period of the clock shift between the two processors. (In contrast, all previous results for two processors are randomized.) For n=d^@b processors (for any positive @b=1 our algorithm runs with at most poly-log(d) radio invocations per processor. Our bounds also hold in a radio-broadcast model where interference must be taken into account.