Journal of Communications and Networks

  • 제16권3호
  • /
  • Pages.335-343
  • /
  • 2014
  • /
  • 1229-2370(pISSN)
  • /
  • 1976-5541(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지
DOI QR코드

DOI QR Code

On Deploying Relays for Connected Indoor Sensor Networks

  • Zhu, Yanmin (Shanghai Key Lab of Scalable Computing and Systems,and the Department of Computer Science and Engineering at Shanghai Jiao Tong University) ;
  • Xue, Cuiyao (Department of Computer Science and Engineering at Shanghai Jiao Tong University) ;
  • Cai, Haibin (Software Engineering Institute at East China Normal University) ;
  • Yu, Jiadi (Department of Computer Science and Engineering at Shanghai Jiao Tong University) ;
  • Ni, Lei (Department of Computer Science and Engineering at Shanghai Jiao Tong University) ;
  • Li, Minglu (Department of Computer Science and Engineering at Shanghai Jiao Tong University) ;
  • Li, Bo (Shanghai Jiao Tong University and Hong Kong University of Science and Technology)
  • 투고 : 2012.09.28
  • 심사 : 2014.02.02
  • 발행 : 2014.06.30
⟨ 이전 논문 다음 논문 ⟩

초록

This paper considers the crucial problem of deploying wireless relays for achieving a connected wireless sensor network in indoor environments, an important aspect related to the management of the sensor network. Several algorithms have been proposed for ensuring full sensing coverage and network connectivity. These algorithms are not applicable to indoor environments because of the complexity of indoor environments, in which a radio signal can be dramatically degraded by obstacles such as walls. We first prove theoretically that the indoor relay placement problem is NP-hard. We then predict the radio coverage of a given relay deployment in indoor environments. We consider two practical scenarios; wire-connected relays and radio-connected relays. For the network with wire-connected relays, we propose an efficient greedy algorithm to compute the deployment locations of relays for achieving the required coverage percentage. This algorithm is proved to provide a $H_n$ factor approximation to the theoretical optimum, where $H_n=1+{\frac{1}{2}}+{\cdots}+{\frac{1}{n}}={\ln}(n)+1$, and n is the number of all grid points. In the network with radio-connected relays, relays have to be connected in an ad hoc mode. We then propose an algorithm based on the previous algorithm for ensuring the connectivity of relays. Experimental results demonstrate that the proposed algorithms achieve better performance than baseline algorithms.

키워드

참고문헌

  1. E. L. Lloyd and G. Xue, "Relay node placement in wireless sensor networks," IEEE Trans. Comput., vol. 56(1), 2007.
  2. D. Yang, S.Misra, X. Fang, G. Xue, and J. Zhang, "Two-tiered constrained relay node placement in wireless sensor networks: Computational complexity and efficient approximations," IEEE Trans. Mobile Comput., 2011.
  3. A. Kashyap, S. Khuller, and M. Shayman, "Relay placement for higher order connectivity in wireless sensor networks," in Proc. IEEE INFOCOM, 2006.
  4. S. Misra, S. Hong, G. Xue, and J. Tang, "Constrained relay node placement in wireless sensor networks: Formulation and approximations," IEEE/ACM Trans. Netw., vol. 18, pp. 434-447, 2010. https://doi.org/10.1109/TNET.2009.2033273
  5. J. Tang, B. Hao, and A. Sen, "Relay node placement in large scale wireless sensor networks," Comput. Commun., vol. 29(4), pp, 490-501, Feb. 2006. https://doi.org/10.1016/j.comcom.2004.12.032
  6. X. Cheng, D.-Z. Du, L. Wang, and B. Xu, "Relay sensor placement in wireless sensor networks," Wireless Netw., vol. 14(3), pp, 347-35, 2007.
  7. M. F. Iskander and Y. Zhengqing, "Propagation prediction models for wireless communication systems," IEEE Trans. Microwave Theory Techniques, vol. 50(3), pp, 662-673, 2002. https://doi.org/10.1109/22.989951
  8. Y. Ziqiu, B. Xiaole, X. Dong, T.Lai, andW.Jia, "Complete optimal deployment patterns for full-coverage and k-connectivity ($k{\leq}6$)," IEEE/ACM Trans. Netw., vol. 18, pp, 934-947, 2010. https://doi.org/10.1109/TNET.2010.2040191
  9. Z. Zongheng, S. Das, and H. Gupta, "Connected K-coverage problem in sensor networks," in Proc. IEEE ICCCN, 2004.
  10. G. Simon, M.Molnar, L. Gonczy, and B. Cousin, "Dependable k-coverage algorithms for sensor networks," in Proc. I2MTC, 2007.
  11. B. Xiaole, Y. Ziqiu, X. Dong, T. H. Lai, and J. Weijia, "Deploying fourconnectivity and full-coverage wireless sensor networks," in Proc. IEEE INFOCOM, 2008.
  12. X. Bai, S. Kumar, D. Xuan, Z. Yun, and T. H. Lai, "Deploying wireless sensors to achieve both coverage and connectivity," in Proc. ACM Mobi-Hoc, 2006.
  13. M. Hefeeda and M. Bagheri, "Randomized k-coverage algorithms for dense sensor networks," in Proc. IEEE INFOCOM, 2007.
  14. P. Kershner, "The number of circles covering a set," American J. Math., vol. 61, p. 6, 1939.
  15. J.Melissen and P. Schuur, "Improved covering a square with up to 30 equal circles," Electronic J. Combinatorics, vol. 3, 1996.
  16. K. Nurmela and P. Ostergard, "Covering a square with up to 30 equal circles," Helsinki Univ. Technology, Laboratory Theoretical Comput. Sci., Espoo, Finland, Tech. Rep. A62, 2000.
  17. T. Gonzalez, "Covering a set of points in multidimensional space," Inf. Proc. Letters, vol. 40(4), pp, 43-58, 1991. https://doi.org/10.1016/S0020-0190(05)80009-2
  18. K. Clarkson and K. Varadarajan, "Improved approximation algorithm for geometric set cover," Discrete Computational Feometry, vol. 37(1), p. 7, 2007.
  19. G. Toth, "Covering with fat convex discs," J. Discrete Computitional Geometry, vol. 34, pp. 129-141, 2005. https://doi.org/10.1007/s00454-004-1153-z
  20. H. Zhang and J. Hu, "Maintaining sensing coverage and connectivity in large sensor networks," in Proc. NSF WTASA, 2004.
  21. W. You-Chiun, H. Chun-Chi, and T. Yu-Chee, "Efficient deployment algorithms for ensuring coverage and connectivity of wireless sensor networks," in Proc. WICON, 2005.
  22. X. Bai, D. Xuan, Z. Yun, T. H. Lai, and W. Jia, "Complete optimal deployment patterns for full-coverage and k-connectivity ($k{\leq}6$) wireless sensor networks," in Proc. ACM MobiHoc, 2008.
  23. B. Xiaole, Y. Ziqiu, X. Dong, J. Weijia, and Z. Wei, "Pattern mutation in wireless sensor deployment," in Proc. IEEE INFOCOM, 2010.
  24. S. Yang, F. Dai, M. Cardei, and J. Wu, "On connected multiple point coverage in wireless sensor networks," J. Wireless Inf. Netw., May 2006.
  25. A. Krause, C. Guestrin, A. Gupta, and J. Kleinberg, "Near-optimal sensor placements: Maximizing information while minimizing communication cost," in Proc. ACM/IEEE IPSN, 2006.
  26. H. Joengmin, H. Tian, and K. Yongdae, "Exploring in-situ sensing irregularity in wireless sensor networks," IEEE Trans. Parallel Distrib. Syst., vol. 21(4), pp, 547-561, 2010. https://doi.org/10.1109/TPDS.2009.92
  27. O. Chipara, G. Hackmann, C. Lu,W. D. Smart, and G.-C. Roman, "Practical modeling and prediction of radio coverage of indoor sensor networks," in Proc. ACM/IEEE IPSN, 2010.