Deploying wireless sensors to achieve both coverage and connectivity (original) (raw)

2006

Abstract

ABSTRACT It is well-known that placing disks in the triangular lattice pat- tern is optimal for achieving full coverage on a plane. With the emergence of wireless sensor networks, however, it is now no longer enough to consider coverage alone when deploy- ing a wireless sensor network; connectivity must also be con- sidered. While moderate loss in coverage can be tolerated by applications of wireless sensor networks, loss in connec- tivity can be fatal. Moreover, since sensors are subject to unanticipated failures after deployment, it is not enough to have a wireless sensor network just connected, it should be k-connected (for k> 1). In this paper, we propose an op- timal deployment pattern to achieve both full coverage and 2-connectivity, and prove its optimality for all values of rc/rs, where rc is the communication radius, and rs is the sensing radius. We also prove the optimality of a previously proposed deployment pattern for achieving both full coverage and 1- connectivity, when rc/rs < √ 3. Finally, we compare the effi- ciency of some popular regular deployment patterns such as the square grid and triangular lattice, in terms of the number of sensors needed to provide coverage and connectivity.

Dong Xuan hasn't uploaded this paper.

Let Dong know you want this paper to be uploaded.

Ask for this paper to be uploaded.