The Community for Technology Leaders
RSS Icon
Issue No.12 - Dec. (2013 vol.62)
pp: 2341-2353
Bang Wang , Huazhong University of Science and Technology, Wuhan
Han Xu , Huazhong University of Science and Technology, Wuhan
Wenyu Liu , Huazhong University of Science and Technology, Wuhan
Hui Liang , Huazhong University of Science and Technology, Wuhan
Coverage is an important issue in many wireless networks. In this paper, we address the problem of node placement for ensuring complete coverage in a long belt scenario and propose a novel placement approach to minimize the number of nodes needed. In our work, each node is assumed to be able to cover a disk area centered at itself with a fixed radius, then a divide-and-cover node placement method is proposed. In the proposed method, a long belt is divided into some sub-belts (if necessary), and then a string of nodes are placed parallel to the long side of each sub-belt to completely cover the sub-belt. We then determine the optimal distance between two adjacent nodes in a string and the number of such strings to minimize the number of nodes for complete belt coverage. Theoretical proofs and analysis show that compared with other node placement including the well-known regular triangular-lattice placement, the proposed method can achieve lower node density in some cases when the belt height is not very large. A combination of the proposed method and the triangular-lattice placement is then proposed, and the optimal ranges of the belt height for their respective applications to achieve the lowest node density are computed.
Wireless networks, Wireless sensor networks, Sensors, Mobile computing,wireless networks, Belt coverage, divide-and-cover placement, node placement
Bang Wang, Han Xu, Wenyu Liu, Hui Liang, "A Novel Node Placement for Long Belt Coverage in Wireless Networks", IEEE Transactions on Computers, vol.62, no. 12, pp. 2341-2353, Dec. 2013, doi:10.1109/TC.2012.145
[1] B. Wang, Coverage Control in Sensor Networks. Springer-Verlag, 2010.
[2] H. Zhang and J. Hou, "Maintaining Sensing Coverage and Connectivity in Large Sensor Networks," J. Ad Hoc and Sensor, vol. 51, p. 61801, 2005.
[3] R. Kershner, "The Number of Circles Covering a Set," Am. J. Math., vol. 61, no. 3, pp. 665-671, 1939.
[4] Y. Wang, C. Hu, and Y. Tseng, "Efficient Placement and Dispatch of Sensors in a Wireless Sensor Network," IEEE Trans. Mobile Computing, vol. 7, no. 2, pp. 262-274, Feb. 2008.
[5] T. Brown, D. Sarioz, A. Bar-Noy, T. LaPorta, D. Verma, M. Johnson, and H. Rowaihy, "Geometric Considerations for Distribution of Sensors in Ad-Hoc Sensor Networks," Proc. SPIE DSS, vol. 6562, 2007.
[6] G. Das, S. Das, S. Nandy, and B. Sinha, "Efficient Algorithm for Placing a Given Number of Base Stations to Cover a Convex Region," J. Parallel and Distributed Computing, vol. 66, no. 11, pp. 1353-1358, 2006.
[7] K. Kar and S. Banerjee, "Node Placement for Connected Coverage in Sensor Networks," Proc. Workshop Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), vol. 3, 2003.
[8] K. Chakrabarty, S. Iyengar, H. Qi, and E. Cho, "Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks," IEEE Trans. Computers, vol. 51, no. 12, pp. 1448-1453, Dec. 2002.
[9] X. Bai, S. Kumar, D. Xuan, Z. Yun, and T. Lai, "Deploying Wireless Sensors to Achieve Both Coverage and Connectivity," Proc. Seventh ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, pp. 131-142, 2006.
[10] X. Bai, Z. Yun, D. Xuan, T. Lai, and W. Jia, "Optimal Patterns for Four-Connectivity and Full Coverage in Wireless Sensor Networks," IEEE Trans. Mobile Computing, vol. 9, no. 3, pp. 435-448, Mar. 2010.
[11] X. Xu and S. Sahni, "Approximation Algorithms for Sensor Deployment," IEEE Trans. Computers, vol. 56, no. 12, pp. 1681-1695, Dec. 2007.
[12] M. Ma and Y. Yang, "Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks," IEEE Trans. Computers, vol. 56, no. 7, pp. 946-847, July 2007.
[13] H. Ammari and S. Das, "Integrated Coverage and Connectivity in Wireless Sensor Networks: A Two-Dimensional Percolation Problem," IEEE Trans. Computers, vol. 57, no. 10, pp. 1423-1434, Oct. 2008.
[14] M. Tolstrup, Indoor Radio Planning: A Practical Guide for Gsm, DCS, UMTS and HSPA. Wiley Publishing, 2008.
[15] D. Cavalcanti, D. Agrawal, C. Cordeiro, B. Xie, and A. Kumar, "Issues in Integrating Cellular Networks WLANs, AND MANETs: A Futuristic Heterogeneous Wireless Network," IEEE Wireless Comm., vol. 12, no. 3, pp. 30-41, June 2005.
[16] I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless Sensor Networks: A Survey," Computer Networks, vol. 38, no. 4, pp. 393-422, 2002.
[17] S. Kumar, T. Lai, and A. Arora, "Barrier Coverage with Wireless Sensors," Proc. 11th Ann. Int'l Conf. Mobile Computing and Networking, pp. 284-298, 2005.
[18] G. Yang and D. Qiao, "Multi-Round Sensor Deployment for Guaranteed Barrier Coverage," Proc. IEEE INFOCOM '10, pp. 1-9, 2010.
[19] B. Liu, O. Dousse, J. Wang, and A. Saipulla, "Strong Barrier Coverage of Wireless Sensor Networks," Proc. Ninth ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, pp. 411-420, 2008.
[20] A. Chen, T. Lai, and D. Xuan, "Measuring and Guaranteeing Quality of Barrier-Coverage in Wireless Sensor Networks," Proc. Ninth ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, pp. 421-430, 2008.
[21] A. Chen, S. Kumar, and T. Lai, "Designing Localized Algorithms for Barrier Coverage," Proc. 13th Ann. ACM Int'l Conf. Mobile Computing and Networking, pp. 63-74, 2007.
[22] A. Saipulla, C. Westphal, B. Liu, and J. Wang, "Barrier Coverage of Line-Based Deployed Wireless Sensor Networks," Proc. IEEE INFOCOM '09, pp. 127-135, 2009.
[23] A. Saipulla, B. Liu, G. Xing, X. Fu, and J. Wang, "Barrier Coverage with Sensors of Limited Mobility," Proc. 11th ACM Int'l Symp. Mobile Ad Hoc Networking and Computing, pp. 201-210, 2010.
[24] L. Li, B. Zhang, X. Shen, J. Zheng, and Z. Yao, "A Study on the Weak Barrier Coverage Problem in Wireless Sensor Networks," Computer Networks, vol. 55, pp. 711-721, 2011.
[25] M. Noori, S. Movaghati, and M. Ardakani, "Characterizing the Path Coverage of Random Wireless Sensor Networks," EURASIP J. Wireless Comm. and Networking, vol. 2010, p. 14, 2010.
[26] D. Ban, J. Jiang, W. Yang, W. Dou, and H. Yi, "Strong K-Barrier Coverage with Mobile Sensors," Proc. Sixth Int'l Wireless Comm. and Mobile Computing Conf., pp. 68-72, 2010.
[27] R. Williams, The Geometrical Foundation of Natural Structure: A Source Book of Design. Dover Publications, 1979.
[28] J. Pach and P. Agarwal, Combinatorial Geometry. Wiley, 1995.
[29] P. Brass, W. Moser, and J. Pach, Research Problems in Discrete Geometry. Springer Verlag, 2005.
[30] T. Tarnai and Z. Gáspár, "Covering a Square by Equal Circles," Elemente Der Mathematik, vol. 50, no. 4, pp. 167-170, 1995.
[31] A. Heppes and H. Melissen, "Covering a Rectangle with Equal Circles," Periodica Mathematica Hungarica, vol. 34, no. 1, pp. 65-81, 1997.
[32] K. Nurmela and P. Ostergard, "Covering a Square with up to 30 Equal Circles," Research Report, Helsinki Univ. of Tech nology, 2000.
[33] J. Melissen and P. Schuur, "Improved Coverings of a Square with Six and Eight Equal Circles," Electronic J. Combinatorics, vol. 3, no. 1, 1996.
[34] W. Rudin, Principles of Math. Analysis, vol. 1. McGraw-Hill, 1976.
100 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool