Efficient optical communication in parallel computers
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Journal of Computer and System Sciences
Maximum finding on a multiple access broadcast network
Information Processing Letters
Randomized algorithms
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Oblivious gossiping in ad-hoc radio networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
On Randomized Broadcasting and Gossiping in Radio Networks
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Energy-Efficient Initialization Protocols for Radio Networks with no Collision Detection
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Localized algorithms for energy efficient topology in wireless ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Probabilistic Algorithms for the Wake-Up Problem in Single-Hop Radio Networks
Theory of Computing Systems
The bin-covering technique for thresholding random geometric graph properties
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On selection problem in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Bootstrapping a hop-optimal network in the weak sensor model
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Lower bounds for clear transmissions in radio networks
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Node clustering in wireless sensor networks: recent developments and deployment challenges
IEEE Network: The Magazine of Global Internetworking
Bootstrapping a hop-optimal network in the weak sensor model
ACM Transactions on Algorithms (TALG)
Deterministic communication in the weak sensor model
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
An early-stopping protocol for computing aggregate functions in Sensor Networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Assumptions about node density in the Sensor Networks literature are frequently too strong or too weak. Neither absolutely arbitrary nor uniform deployment seem feasible in most of the intended applications of sensor nodes. We present a Weak Sensor Model-compatible distributed protocol for hop-optimal network initialization, under the assumption that the maximum density of nodes is some value Δ known by all of the nodes. In order to prove lower bounds, we observe that all nodes must communicate with some other node in order to join the network, and we call the problem of achieving such a communication the Group Therapy Problem. We show lower bounds for the Group Therapy Problem in Radio Networks of maximum density Δ, regardless of the use of randomization, and a stronger lower bound for the important class of randomized fair protocols. We also show that even when nodes are distributed uniformly, the same lower bound holds, even in expectation and even for the simpler problem of Clear Transmission.