ACM Home Page
Please provide us with feedback. Feedback
Deploying wireless sensors to achieve both coverage and connectivity
Full text PdfPdf (433 KB)
Source International Symposium on Mobile Ad Hoc Networking & Computing archive
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing table of contents
Florence, Italy
SESSION: Connectivity and coverage table of contents
Pages: 131 - 142  
Year of Publication: 2006
ISBN:1-59593-368-9
Authors
Xiaole Bai  The Ohio State University Suzhou University, Columbus, OH, USA
Santosh Kumar  The Ohio State University Suzhou University, Columbus, OH, USA
Dong Xuan  The Ohio State University Suzhou University, Columbus, OH, USA
Ziqiu Yun  Suzhou University, Suzhou, P.R.CHINA
Ten H. Lai  The Ohio State University Suzhou University, Columbus, OH, USA
Sponsors
ACM: Association for Computing Machinery
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 128,   Citation Count: 23
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1132905.1132921
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
Q. Cao, T. Yan, J.A. Stankovic,and T. F. Abdelzaher. Analysis of Target Detection Performance for Wireless Sensor Networks. In International Conference on Distributed Computing in Sensor Networks (DCOSS), 2005.
 
4
5
 
6
R. Kershner. The Number of Circles Covering a Set. American Journal of Mathematics, 61:665--671, 1939.
 
7
8
 
9
H. Zhang and J. Hou. Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. In NSF International Workshop on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wirelsss, and Peer-to-Peer Networks, 2004.
10
11

CITED BY  23

Collaborative Colleagues:
Xiaole Bai: colleagues
Santosh Kumar: colleagues
Dong Xuan: colleagues
Ziqiu Yun: colleagues
Ten H. Lai: colleagues