The Community for Technology Leaders
RSS Icon
Issue No.03 - March (2010 vol.9)
pp: 435-448
Xiaole Bai , The Ohio State University, Columbus
Ziqiu Yun , Suzhou University, Suzhou
Dong Xuan , The Ohio State University, Columbus
Ten H. Lai , The Ohio State University, Columbus
Weijia Jia , City University of Hong Kong, Hong Kong
In this paper, we study optimal deployment in terms of the number of sensors required to achieve four-connectivity and full coverage under different ratios of sensors' communication range (denoted by r_c) to their sensing range (denoted by r_s). We propose a new pattern, the Diamond pattern, which can be viewed as a series of evolving patterns. When r_c/r_s \ge \sqrt{3}, the Diamond pattern coincides with the well-known triangle lattice pattern; when r_c/r_s \le \sqrt{2}, it degenerates to a Square pattern (i.e., a square grid). We prove that our proposed pattern is asymptotically optimal when r_c/r_s > \sqrt{2} to achieve four-connectivity and full coverage. We also discover another new deployment pattern called the Double-strip pattern. This pattern provides a new aspect to research on optimal deployment patterns. Our work is the first to propose an asymptotically optimal deployment pattern to achieve four-connectivity and full coverage for WSNs. Our work also provides insights on how optimal patterns evolve and how to search for them.
Wireless sensor networks, topology, full coverage, four-connectivity, optimal deployment pattern.
Xiaole Bai, Ziqiu Yun, Dong Xuan, Ten H. Lai, Weijia Jia, "Optimal Patterns for Four-Connectivity and Full Coverage in Wireless Sensor Networks", IEEE Transactions on Mobile Computing, vol.9, no. 3, pp. 435-448, March 2010, doi:10.1109/TMC.2009.143
[1] A. Arora et al., “A Line in the Sand: A Wireless Sensor Network for Target Detection, Classification and Tracking,” Computer Networks, vol. 46, pp. 605-634, 2004.
[2] A. Arora et al., “ExScal: Elements of an Extreme Scale Wireless Sensor Network,” Proc. IEEE Int'l Conf. Real-Time Computing Systems and Applications (RTCSA), 2005.
[3] Z. Abrams, A. Goel, and S. Plotkin, “Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks,” Proc. Third Int'l Symp. Information Processing in Sensor Networks, 2004.
[4] X. Bai, S. Kumer, D. Xuan, Z. Yun, and T.H. Lai, “Deploying Wireless Sensors to Achieve Both Coverage and Connectivity,” Proc. ACM MobiHoc, 2006.
[5] P. Balister, B. Bollobas, A. Sarkar, and S. Kumar, “Reliable Density Estimates for Coverage and Connectivity in Thin Strips of Finite Length,” Proc. ACM MobiCom, 2007.
[6] A. Chen, S. Kumar, and T.H. Lai, “Designing Localized Algorithms for Barrier Coverage,” Proc. ACM MobiCom, 2007.
[7] A. Chen, T.H. Lai, and D. Xuan, “Measuring and Guaranteeing Quality of Barrier-Coverage in Wireless Sensor Networks,” Proc. ACM MobiHoc, 2008.
[8] Q. Cao, T. Yan, J. Stankovic, and T. Abdelzaher, “Analysis of Target Detection Performance for Wireless Sensor Networks,” Proc. IEEE Int'l Conf. Distributed Computing in Sensor Networks (DCOSS), 2005.
[9] K.L. Clarkson and K. Varadarajan, “Improved Approximation Algorithms for Geometric Set Cover,” Discrete & Computational Geometry, vol. 37, no. 1, pp. 43-58, 2007.
[10] G. Dimakis, “Codes on Graphs for Distributed Storage in Wireless Networks,” master's thesis, Univ. of California at Berkeley, 2005.
[11] T. Gonzalez, “Covering a Set of Points in Multidimensional Space,” Information Processing Letters, vol. 40, no. 4, pp. 181-188, 1991.
[12] M. Goyeneche et al., “A Distributed Data Gathering Algorithm for Wireless Sensor Networks with Uniform Architecture,” Proc. IEEE EUROMICRO Int'l Conf. Parallel, Distributed and Network-Based Processing (PDP), 2007.
[13] F. Hillier and G. Lieberman, Introduction to Operations Research. McGraw-Hill, 2002.
[14] D.S. Hochbaum and W. Maass, “Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI,” J.ACM, vol. 32, no. 1, pp. 130-136, 1985.
[15] R. Iyengar, K. Kar, and S. Banerjee, “Low-Coordination Topologies for Redundancy in Sensor Networks,” Proc. ACM MobiHoc, pp. 332-342, 2005.
[16] R. Kershner, “The Number of Circles Covering a Set,” Am. J. Math., vol. 61, pp. 665-671, 1939.
[17] B. Liu, O. Dousse, J. Wang, and A. Saipulla, “Strong Barrier Coverage of Wireless Sensor Networks,” Proc. ACM MobiHoc, 2008.
[18] J.B.M. Melissen and P.C. Schuur, “Improved Coverings of a Square with Six and Eight Equal Circles,” Electronic J. Combinatorics, vol. 3, no. 1, 1996.
[19] S. Megerian et al., “Exposure in Wireless Sensor Networks: Theory and Practical Solutions,” Wireless Networks, vol. 8, no. 5, pp. 443-454, 2002.
[20] K.J. Nurmela and P.R.J. Östergård, “Covering a Square with up to 30 Equal Circles,” Research Report A62, Laboratory for Theoretical Computer Science, Helsinki Univ. of Tech nology, 2000.
[21] A. Panangadan and G. Sukhatme, “Data Segmentation for Region Detection in a Sensor Network,” Technical Report 05-005, Center for Robotics and Embedded Systems (CRES), Univ. of Southern California, 2005.
[22] T.S. Rappaport, Wireless Communications: Principles and Practice. Prentice Hall PTR, 2002.
[23] S. Slijepcevic and M. Potkonjak, “Power Efficient Organization of Wireless Sensor Networks,” Proc. IEEE Int'l Conf. Comm. (ICC), 2001.
[24] G.F. Toth, “Covering with Fat Convex Discs,” J. Discrete and Computational Geometry, vol. 34, no. 1, pp. 129-141, 2005.
[25] Y.R. Tsai, “Coverage-Preserving Routing Protocols for Randomly Distributed Wireless Sensor Networks,” IEEE Trans. Wireless Comm., vol. 6, no. 4, pp. 1240-1245, Apr. 2007.
[26] Y. Wang, C. Hu, and Y. Tseng, “Efficient Deployment Algorithms for Ensuring Coverage and Connectivity of Wireless Sensor Networks,” Proc. First Int'l Conf. Wireless Internet (WICON), 2005.
[27] K. Xu, G. Takahara, and H. Hassanein, “On the Robustness of Grid-Based Deployment in Wireless Sensor Networks,” Proc. Int'l Wireless Comm. and Mobile Computing Conf. (IWCMC), 2006.
[28] H. Zhang and J. Hou, “Maintaining Sensing Coverage and Connectivity in Large Sensor Networks,” Ad Hoc and Sensor Wireless Networks: An Int'l J., vol. 1, nos. 1/2, pp. 89-123, 2005.
[29] J. Zhao and R. Govindan, “Understanding Packet Delivery Performance in Dense Wireless Sensor Networks,” Proc. ACM Conf. Embedded Networked Sensor Systems (SenSys), 2003.
[30] G. Zhou, T. He, S. Krishnamurthy, and J. Stankovic, “Impact of Radio Irregularity on Wireless Sensor Networks,” Proc. ACM Int'l Conf. Mobile Systems, Applications, and Services (MobiSys), 2004.
[31] Y. Zhou and K. Chakrabarty, “Sensor Deployment and Target Localization Based on Virtual Force,” Proc. IEEE INFOCOM, 2003.
[32] M. Zuniga and B. Krishnamachari, “Analyzing the Transitional Region in Low Power Wireless Links,” Proc. Ann. IEEE Comm. Soc. Conf. Sensor, Mesh and Ad Hoc Comm. and Networks (SECON), 2004.
[33] M. Zuniga and B. Krishnamachari, “Analyzing the Transitional Region in Low Power Wireless Links,” Technical Report 04-823, Univ. of Southern California, 2004.
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool