A Novel Coverage Enhancing Algorithm for Hybrid Wireless Sensor Networks

被引:0
|
作者
Zhang, Qingguo [1 ,2 ]
He, Tingting [1 ]
机构
[1] Huazhong Normal Univ, Coll Comp, Wuhan 430079, Hubei, Peoples R China
[2] Univ Georgia, Coll Engn, Lightwave & Microwave Photon Lab, Athens, GA 30602 USA
关键词
Hybrid wireless sensor network; genetic algorithm; area coverage; mobile sensor; static sensor; DEPLOYMENT;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Providing field coverage is a key task in many sensor network applications. In some applications, the sensor field may have coverage holes due to random initial deployment of sensors and thus the desired level of coverage cannot be achieved. A hybrid wireless sensor network is a cost-effective solution to this problem by repositioning a portion of the mobile sensors to meet the network coverage requirement. This paper investigates how to redeploy mobile sensor nodes to improve network coverage in hybrid wireless sensor networks. We propose a novel coverage-enhancing algorithm for hybrid wireless sensor networks. It consists of two phases. In the first phase, we use a genetic algorithm to compute the candidate target positions of the mobile sensor nodes. In the second phase, we use an optimization scheme on the candidate target positions resulted from phase one to reduce the accumulated potential moving distance of mobile sensors, such that the exact mobile sensor nodes that need to be moved as well as their final target positions can be determined. Experimental results show that the proposed algorithm provided significant improvement in terms of area coverage rate, average moving distance, area coverage-distance rate and the number of moved mobile sensors than the GA, the PSO algorithm, and the virtual force algorithm.
引用
收藏
页码:1 / 22
页数:22
相关论文
共 50 条
  • [41] An electrostatic field- based coverage-enhancing algorithm for wireless multimedia sensor networks
    Zhao Jing
    Zeng Jian-Chao
    2009 5TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-8, 2009, : 3064 - +
  • [42] Novel coverage control algorithm for wireless sensor network
    Han, Zhi-Jie
    Wu, Zhi-Bin
    Wang, Ru-Chuan
    Sun, Li-Juan
    Xiao, Fu
    Tongxin Xuebao/Journal on Communications, 2011, 32 (10): : 174 - 184
  • [43] A Novel Distributed Algorithm for Complete Targets Coverage in Energy Harvesting Wireless Sensor Networks
    Yang, Changlin
    Chin, Kwan-Wu
    2014 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2014, : 361 - 366
  • [44] A novel gossip-based sensing coverage algorithm for dense wireless sensor networks
    Tran-Quang, Vinh
    Miyoshi, Takumi
    COMPUTER NETWORKS, 2009, 53 (13) : 2275 - 2287
  • [45] An Hybrid Scheduling Algorithm for Wireless Sensor Networks
    Diongue, Dame
    Thiare, Ousmane
    2014 INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION AND INFORMATICS (ICCCI), 2014,
  • [46] A Hybrid Localization Algorithm for Wireless Sensor Networks
    Singh, Aarti
    Kumar, Sushil
    Kaiwartya, Omprakash
    3RD INTERNATIONAL CONFERENCE ON RECENT TRENDS IN COMPUTING 2015 (ICRTC-2015), 2015, 57 : 1432 - 1439
  • [47] Efficient Visual Sensor Coverage Algorithm in Wireless Visual Sensor Networks
    Yen, Hong-Hsu
    2013 9TH INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC), 2013, : 1516 - 1521
  • [48] A Coverage and Repair Optimization Algorithm for Hybrid Sensor Networks
    Ding, Fei
    Zhang, Dengyin
    Song, Aiguo
    Li, Jianqing
    JOURNAL OF INTERNET TECHNOLOGY, 2018, 19 (03): : 909 - 917
  • [49] Hybrid gravitational search algorithm based model for optimizing coverage and connectivity in wireless sensor networks
    Chaya Shivalingegowda
    P. V. Y. Jayasree
    Journal of Ambient Intelligence and Humanized Computing, 2021, 12 : 2835 - 2848
  • [50] Hybrid gravitational search algorithm based model for optimizing coverage and connectivity in wireless sensor networks
    Shivalingegowda, Chaya
    Jayasree, P. V. Y.
    JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2021, 12 (02) : 2835 - 2848