Connected k-Coverage Topology Control for Area Monitoring in Wireless Sensor Networks

详细信息    查看全文

• 作者：Ramalakshmi Ramar ; Radhakrishnan Shanmugasundaram
• 关键词：Connected dominating set ; Area coverage ; Connectivity ; Wireless sensor network ; Topology control
• 刊名：Wireless Personal Communications
• 出版年：2015
• 出版时间：September 2015
• 年：2015
• 卷：84
• 期：2
• 页码：1051-1067
• 全文大小：970 KB
• 参考文献：1.Zhu, C., Zheng, C., Shu, L., & Han, G. (2012). A survey on coverage and connectivity issues in wireless sensor networks. Journal of Network and Computer Applications, 35, 619鈥?32.View Article
  2.Misra, S., Kumar, M. P., & Obaidat, M. S. (2011). Connectivity preserving localized coverage algorithm for area monitoring using wireless sensor networks. Computer Communications, 34, 1484鈥?496.View Article
  3.Ghosh, A., & Das, S. K. (2008). Coverage and connectivity issues in wireless sensor networks: A survey. Pervasive and Mobile Computing, 4, 303鈥?34.View Article
  4.Huang, C. F., & Tseng, Y. C. (2005). A survey of solutions to the coverage problems in wireless sensor networks. Journal of Internet Technology, 6, 1鈥?.
  5.Cardei, M., & Wu, J. (2006). Energy-efficient coverage problems in wireless ad-hoc sensor networks. Computer Communications, 29, 413鈥?20.View Article
  6.Hefeeda, M., & Ahmadi, H. (2010). Energy-efficient protocol for deterministic and probabilistic coverage in sensor networks. IEEE Transacions on Parallel and Distributed Systems, 21(5), 579鈥?93.View Article
  7.Yu, J., Deng, X., Yu, D., Wang, G., & Gu, X. (2013). CWSC: Connected k-coverage working sets construction algorithm in wireless sensor networks. AEUE鈥擨nternational Journal of Electronics and Communications, 67(11), 937鈥?46.
  8.Ammari, H. M., & Das, S. K. (2012). Centralized and clustered k-coverage protocols for wireless sensor networks. IEEE Transactions on Computers, 61(1), 118鈥?33.MathSciNet View Article
  9.Ammari, H. M. (2012). On the problem of k-coverage in mission-oriented mobile wireless sensor networks. Computer Networks, 56, 1935鈥?950.View Article
  10.Yang, S., Dai, F., Cardei, M., Wu, J., & Patterson, F. (2006). On connected multiple point coverage in wireless sensor networks. International Journal of Wireless Information Networks, 13(4), 289鈥?01.View Article
  11.Carle, J., Gallais, A., & Simplot-Ryl, D. (2005). Preserving area coverage in wireless sensor networks by using surface coverage relay dominating sets. In Proceedings of the 10th IEEE Symposium on Computers and Communications (ISCC 2005) (pp. 347鈥?52). IEEE.
  12.Zeng, Y., Sreenan, C. J., Xiong, N., Yang, L. T., & Park, J. H. (2010). Connectivity and coverage maintenance in wireless sensor networks. Journal of Supercomputing, 52, 23鈥?6.View Article
  13.Wightman, P. M., & Labrador, M. A. (2011). A family of simple distributed minimum connected dominating set-based topology construction algorithms. Journal of Network and Computer Applications, 34, 1997鈥?010.View Article
  14.Rizvi, S., Qureshi, H. K., Khayam, S. A., Rakocevic, V., & Rajarajan, M. (2012). A1: An energy efficient topology control algorithm for connected area coverage in wireless sensor networks. Journal of Network and Computer Applications, 35, 597鈥?05.View Article
  15.Torkestani, J. A. (2013). An adaptive energy-efficient area coverage algorithm for wireless sensor networks. Ad Hoc Networks, 11(6), 1655鈥?666.
  16.Khedr, Ahmed M., & Osamy, W. (2012). Mobility-assisted minimum connected cover in a wireless sensor network. Journal of Parallel Distributed Computing, 72, 827鈥?37.View Article
  17.Rong-rong, Y., Bin, L., Ya-qian, L., & Xiaoe-chen, H. (2012). Adaptively fault-tolerant topology control algorithm for wireless sensor networks. The Journal of China Universities of Posts and Telecommunications, 19, 13鈥?8.View Article
  18.Qureshi, H. K., Rizvi, S., Saleem, M., Ali Khayam, S., Rakocevic, V., & Rajarajan, M. (2013). Evaluation and improvement of CDS-based topology control for wireless sensor networks. Wireless Networks, 19(1), 31鈥?6.View Article
  19.Qureshi, H. K., Rizvi, S., Saleem, M., Ali Khayam, S., Rakocevic, V., & Rajarajan, M. (2011). Poly: A reliable and energy efficient topology control protocol for wireless sensor networks. Computer Communications, 34, 1235鈥?242.View Article
  20.Bian, Y., Yu, H. & Zeng, P. (2009). Construction of a fault tolerance connected dominating set in wireless sensor network. In: International Conference on Measuring Technology and Mechatronics Automation (ICMTMA 2009) (Vol. 1, pp. 610鈥?14). IEEE.
  21.Shang, W., Wan, P., Yao, F., & Hu, X. (2007). Algorithms for minimum m-connected k-tuple dominating set problem. Theoretical Computer Science, 381, 241鈥?47.MATH MathSciNet View Article
  22.Wu, Y., Wang, F., Thai, My T., & Li, Y. (2007) Constructing k-connected m-dominating set in wireless sensor networks. In Military Communicatons Conference. (MILCOM 2007) (pp. 1鈥?). IEEE
  23.Wu, Y., & Li, Y. (2008). Construction algorithms for k-connected m-dominating sets in wireless sensor networks. In Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (pp. 83鈥?0). ACM.
  24.Li, Y., Wu, Y., Ai, C., & Beyah, R. (2012). On the construction of k-connected m-dominating sets in wireless networks. Journal of combinatorial optimization, 23, 118鈥?39.MATH MathSciNet View Article
  25.Kim, D., Wu, Y., Li, Y., Zou, F., & Du, D.-Z. (2009). Constructing minimum connected dominating sets with bounded diameters in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 20(2), 147鈥?57.View Article
  26.Kim, D., Wang, W., Li, X., Zhang, Z., & Wu, W. (2010). A new constant factor approximation for computing 3-connected m-dominating sets in homogeneous wireless networks. In Proceedings of IEEE (INFOCOM 2010) (pp. 1鈥?). IEEE.
  27.Sausen, P. S., Spohn, M. A., & Perkusich, A. (2010). Broadcast routing in wireless sensor networks with dynamic power management and multi-coverage backbones. Information Sciences, 180, 653鈥?63.View Article
  28.Anitha, V. S., & Sebastian, M. P. (2011). Application oriented connected dominating set-based cluster formation in wireless sensor networks. Journal of the Brazilian Computer Society, 17, 3鈥?8.View Article
  29.Pemmaaraju, S.V., & Piwani, I.A. (2006). Energy Conservation via Domatic Partitions. In Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing (pp. 143鈥?54). ACM.
  30.Misra, R., & Mandal, C. (2009). Rotation of CDS via connected domatic partition in Ad hoc sensor networks. IEEE Transactions on Mobile computing, 8(4), 488鈥?99.View Article
  31.Mahjoub, D., & Matula, D. W. (2012). Constructing efficient rotating backbones in wireless sensor networks using graph coloring. Computer Communications, 35, 1086鈥?097.View Article
  32.Yu, J., Zhang, Q., Yu, D., Chen, C., & Wang, G. (2014). Domatic partition in homogeneous wireless sensor networks. Journal of Network and Computer Applications. 37, 186鈥?93.
  33.Wightman, P.M., & Labrador, M.A. (2009). Atarraya: A simulation tool to teach and research topology control algorithms for wireless sensor networks. In Proceedings of the 2nd International Conference on Simulation Tools and Techniques (p. 26). ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering).
  
• 作者单位：Ramalakshmi Ramar (1)
  Radhakrishnan Shanmugasundaram (1)
  
  1. Department of Computer Science and Engineering, Kalasalingam University, Virudhunagar, India
  
• 刊物类别：Engineering
• 刊物主题：Electronic and Computer Engineering
  Signal,Image and Speech Processing
  Processor Architectures
  
• 出版者：Springer Netherlands
• ISSN：1572-834X

文摘

One of the design challenges in Wireless sensor network (WSN) is to save limited energy resource to prolong the lifetime of the network without affecting their communication connectivity or sensing coverage . In dense WSN, the sensing areas of sensor node may overlap with each other. In general, the larger the overlap of the sensing range, the more redundant data will be generated with more energy consumption. In WSN, connected dominating set (CDS) has been used for energy efficient topology control, where a virtual backbone is formed, which allows communication between any arbitrary pair of nodes in the network. Nodes which are not in CDS can go to sleep state for energy conservation. Applications related to security and reliability require a certain amount of active nodes to ensure desired level of coverage at all time. These active nodes should be connected to reduce the delay during the communication. Therefore, it is necessary to construct a fault-tolerant CDS that continues to function during node or link failure, for both coverage and connectivity requirements of WSN. In this paper, we propose k-coverage connected dominating set (k-CCDS) for connected area coverage. We also propose a weight metric named weighted coverage cost (WCC), which consists of energy of sensing neighbors. The proposed protocol selects a CDS based on WCC to ensure that every non-dominating node is connected with the CDS even if \(k-1\) dominating nodes are dead. This CDS is named k-CCDS, in which every non-dominating node is covered by atleast k dominating nodes. Simulation results show that it performs better when comparing with A3Cov in terms of CDS size, coverage, energy consumption and lifetime of the network.