Computer Science ›› 2020, Vol. 47 ›› Issue (7): 243-249.doi: 10.11896/jsjkx.200200133

• Computer Network • Previous Articles     Next Articles

WSN Coverage Optimization Based on Adaptive Particle Swarm Optimization

QI Wei1, YU Hui-qun 1,2, FAN Gui-sheng1, CHEN Liang1   

  1. 1 Department of Computer Science and Engineering,East China University of Science and Technology,Shanghai 200237,China
    2 Shanghai Key Laboratory of Computer Software Evaluating and Testing,Shanghai 201112,China
  • Received:2020-02-29 Online:2020-07-15 Published:2020-07-16
  • About author:QI Wei,born in 1994,postgraduate.Her main research interests include software engineering and CPS.
    YU Hui-qun,born in 1967,professor,Ph.D supervisor,is a member of China Computer Federation.His main research interests include software engineering,and formal method.
  • Supported by:
    This work was supported by the National Natural Science Foundation of China (61702334,61772200),Project Supported by Shanghai Natural Science Foundation (17ZR1406900,17ZR1429700) and Planning Project of Shanghai Institute of Higher Education(GJEL18135)

Abstract: The wireless sensor network (WSN) coverage of data sensing layer has great significance on the quality of sensing services.In view of the problems of coverage redundancy,coverage void and premature convergence of particle swarm optimization caused by the randomness of initial deployment of wireless sensor network,an adaptive virtual force particle swarm optimization algorithm based on binomial perception coverage is proposed,which optimizes the effective coverage of the network.By adding mobile nodes to the network,the algorithm performs the redeployment distribution of position scheduling,adjusts the inertia weight by calculating the degree of population evolution and the degree of relative aggregation,and ueses the threshold of fitness variance to judge whether the intergerence of virtual force strategy is needed in the current state.This paper focuses on the analysis of the impact of the initial deployment category and mobile node proportion on the redeployment coverage performance,and gives the corresponding implementation algorithm.Simulation results show that compared with ACPSO,DACPSO and DVPSO,the improved PSO has 98.33% coverage and high mobile efficiency,which fully proves the effectiveness of the algorithm.

Key words: Hybrid sensor networks, Adaptive particle swarm optimization, Virtual force strategy, Coverage control, Redeployment

CLC Number: 

  • TP311
[1] ELHABYAN R,SHI W,ST-HILAIRE M.Coverage protocols for wireless sensor networks:Review and future directions [J].Journal of Communications and Networks,2019,21(1):45-60.
[2] SHEKHAR S.Dynamic Data Driven Cloud Systems for Cloud-Hosted CPS [C]//International Conference on Cloud Enginee-ring Workshop IEEE.Washington:IEEE Computer Society,2016:195-197.
[3] AMUTHA J,SHARMA S,NAGAR J,et al.WSN StrategiesBased on Sensors,Deployment,Sensing Models,Coverage and Energy Efficiency:Review,Approaches and Open Issues [J].Wireless Personal Communications,2019,111(2):1089-1115.
[4] KUMAR V,YADAV S,SANDEEP D N,et al.Optimal Cluster Count and Coverage Analysis in a Gaussian Distributed WSNs Using TESM[C]//International Conference on Frontiers of Intelligent Computing:Theory and Applications.Singapore:Springer,2020:335-345.
[5] CHANG J,ZHANG L.Path planning of mobile sink in randomly distributed wireless sensor networks [J].Computer Science,2017,44(2):154-158.
[6] SHAH T,JAVAID N,QURESHI T N,et al.Energy Efficient Sleep Awake Aware (EESAA) intelligent sensor network routing protocol [C]//Proceedings of International Multitopic Conference.Piscataway:IEEE,2012:317-322.
[7] HUANG X L,OU F.WSN life maximization to ensure coverage and connectivity [J].Journal of Electronic Measurement and Instrumentation,2019,33(1):61-68.
[8] NAI W,GE Y,XING Y,et al.A Coverage Approach for Wireless Sensor Network in Specified Scenario Condition[C]//Proceedings of International Conference on Intelligent Human-Machine Systems &Cybernetics.Piscataway:IEEE.2018:325-328.
[9] DANG X C,MA R C,HAO Z J,et al.Fence coverage strategy of wireless sensor network based on Voronoi [J].Computer Engineering and Application,2018,54(2):91-96.
[10] ZHANG J,SHAO X Q,HOU X D,et al.Hybrid wireless sensor network coverage optimization algorithm [J].Sensors andMic-rosystems,2018,37(12):148-149,152.
[11] LI Y,ZHANG B,CHAI S,et al.An energy balanced-virtualforce algorithm for Mobile-WSNs [C]// Proceedings of International Conference on Mechatronics & Automation.Piscataway:IEEE,2015:1779-1784.
[12] PARVIN J R,VASANTHANAYAKI C.Particle swarm optimization-based energy efficient target tracking in wireless sensor network [J].Measurement,2019,147(17):1-8.
[13] MIHOUBI M,RAHMOUN A,LORENZ P,et al.An effective Bat algorithm for node localization in distributed wireless sensor network [J].Security & Privacy,2018,1(1):1-20.
[14] YADAV A,KUMAR S,VIJENDRA S,et al.Network LifeTime Analysis of WSNs Using Particle Swarm Optimization [C]//Proceedings of International Conference on Computational Intelligence and Data Science.Amsterdam:Elsevier,2018:805-815.
[15] ZHAO Y M.Application of adaptive chaos PSO algorithm inWSN coverage optimization [J].Communication Technology,2018,51(10):2402-2406.
[16] YU B.An Improved Method of WSN Coverage Based on Enhanced PSO Algorithm [C]//Proceedings of Joint International Information Technology and Artificial Intelligence Conference.Piscataway:IEEE,2019:1294-1297.
[17] CUI P,WANG M.An optimal deployment strategy of a virtual force oriented Genetic Algorithm for wireless sensor networks [J].Electronic Design Engineering,2017,25(7):87-91.
[18] TENG Z J,LV J L,GUO L W,et al.Coverage strategy of wireless sensor network based on improved particle swarm optimization algorithm [J].Journal of Guangxi Normal University (Na-tural Science Edition),2018,36(3):13-20.
[19] FENG L.Coverage optimization of wireless sensor networksbased on improved particle swarm optimization [J].Journal of Terahertz Science and Electronic Information,2015,13(3):486-490.
[1] QIAN Ling and ZHAI Yu-qing. Coverage Control Algorithm Based on Sequential Game in UWSNs [J]. Computer Science, 2015, 42(Z11): 213-217.
[2] . Key Distribution Scheme in Designated Manually Deployed Wireless Sensor Networks Based on One-way Hash Chain [J]. Computer Science, 2013, 40(1): 41-44.
[3] . [J]. Computer Science, 2009, 36(5): 39-44.
[4] . [J]. Computer Science, 2007, 34(3): 20-22.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[2] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[3] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[4] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[5] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[6] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[7] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[8] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[9] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .
[10] WANG Zhen-chao, HOU Huan-huan and LIAN Rui. Path Optimization Scheme for Restraining Degree of Disorder in CMT[J]. Computer Science, 2018, 45(4): 122 -125 .