Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model

Abstract. 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 prob...

• Type: Conference
• Year: 2007
• Where: WADS
• Authors: Martin Farach-Colton, Miguel A. Mosteiro
• Keywords: Algorithms, Group Therapy Problem, Lower Bound, Maximum Density, WADS 2007