A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
A lower bound for radio broadcast
Journal of Computer and System Sciences
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Sparse Power Efficient Topology for Wireless Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
ALOHA packet system with and without slots and capture
ACM SIGCOMM Computer Communication Review
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Distributive graph algorithms Global solutions from local data
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
The Maximum Energy-Constrained Dynamic Flow Problem
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Computing Lightweight Spanners Locally
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Separability and topology control of quasi unit disk graphs
Wireless Networks
On Spanners and Lightweight Spanners of Geometric Graphs
SIAM Journal on Computing
| Hi-index | 0.00 |
This paper wants to motivate the distributed algorithms community to study sensor networks. We discuss why sensor networks are distributed algorithms, and why they are not