Deploying wireless sensors to achieve both coverage and connectivity

@inproceedings{citeulike:2911927, address = {New York, NY, USA}, author = {Bai, Xiaole and Kumar, Santosh and Xuan, Dong and Yun, Ziqiu and Lai, Ten H. }, booktitle = {MobiHoc '06: Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing}, citeulike-article-id = {2911927}, comment = {It is well-known that placing disks in the triangular lattice pattern 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 deploying 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 connectivity 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 optimal 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 efficiency 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.}, doi = {10.1145/1132905.1132921}, isbn = {1595933689}, keywords = {p2}, pages = {131--142}, posted-at = {2008-06-21 04:57:12}, priority = {2}, publisher = {ACM}, title = {Deploying wireless sensors to achieve both coverage and connectivity}, url = {http://portal.acm.org/citation.cfm?id=1132921}, year = {2006} }

TY - CONF ID - citeulike:2911927 L3 - citeulike-article-id:2911927 TI - Deploying wireless sensors to achieve both coverage and connectivity T2 - MobiHoc '06: Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing SP - 131 EP - 142 AD - New York, NY, USA PB - ACM SN - 1595933689 KW - p2 N1 - It is well-known that placing disks in the triangular lattice pattern 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 deploying 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 connectivity 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 optimal 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 efficiency 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. AU - Bai, Xiaole AU - Kumar, Santosh AU - Xuan, Dong AU - Yun, Ziqiu AU - Lai, Ten PY - 2006/// UR - http://portal.acm.org/citation.cfm?id=1132921 ER -