Computer Science ›› 2019, Vol. 46 ›› Issue (11A): 393-398.

• Network & Communication • Previous Articles     Next Articles

Directional Strong Barrier Constructing Scheme Based on Node Approximate Circle

WANG Fang-hong1, LI Tao2, JIN Ying-dong2, HU Zhen-hao2   

  1. (Zhijiang College,Zhejiang University of Technology,Shaoxing,Zhejiang 312030,China)1;
    (Department of Computer Science and Technology,Zhejiang University of Technology,Hangzhou 310023,China)2
  • Online:2019-11-10 Published:2019-11-20

Abstract: Barrier coverage is one of the hot spots in directional wireless sensor network (DSN).In order to effectively form barrier when sensing angle is more than π,this paper designed the approximate circle model of directional nodes and proposed centralized heuristic barrier construction scheme based on approximate circle (HapC) and distributed improved barrier construction scheme based on next node sports (INSDBC) to construct directional strong barrier.In HapC,the whole network is divided into subgroup in which each approximate circle is connected,and the optimal mobile nodes are selected to connect these subgroups by Hungarian algorithm.To further decrease the number of barrier node,it reduces the staff node of sub-barrier.NSDBC maximizs the contribution of each nodes based on geometric relation of approximate circle.Moreover,it selects the node with minimum energy consumption to form barrier in turn from left to right.Simulation results show that this method can effectively constitute strong barrier coverage,and enhance the cove-rage performance of DSN.This research has a certain theoretical and practical significance for barrier coverage improvement in DSN.

Key words: Directional barrier coverage, Aapproximate circle, Barrier contribution, Energy consumption

CLC Number: 

  • TP391
[1]TAO D,T WU.A survey on barrier coverage problem in directional sensor networks[J].IEEE Sensors Journal,2015,15(2):876-885.
[3]KUMAR S,LAI T H,ARORA A.Barrier coverage with wireless Sensors[C]∥Proc.of the 11th Annual International Conference on Mobile Computing and Networking.2005:284-298.
[6]TIAN J,ZHANG W S,WANG G L,et al.2D k-barrier duty-cycle scheduling for intruder detection in wireless sensor networks[J].Computer Communications,2014,4(3):31-42.
[8]MA H D,YANG M,LI D,et al.Minimum camera barrier cove-rage in wireless camera sensor networks[C]∥Proc.IEEE INFOCOM,Orlando,FL,USA,2012:217-225.
[9]TAO D,TANG S,ZHANG H,et al.Strong barrier coverage in directional sensor networks[C]∥Computer Communications,2012,35(8):895-905.
[10]ZHANG L,TANG J,ZHANG W.Strong barrier coverage with directional sensors[C]∥Proc.IEEE GlobeCom.Honolulu,HI,USA,2009:1-6.
[11]SSU K F,WANG W T,W F K,et al.K-barrier coverage with a directional sensing model[J].International Journal on Smart Sensing and Intelligent Systems,2009,2(1):75-93.
[12]CHENG C F,TSAI K T.distributed barrier coverage in wireless visual sensor networks with β-qom[J].IEEE Sensors Journal,2012,12(6):1726-1735.
[13]WANG Z B,LIAO J D,CAO Q,et al.Achieving k-barrier Co-verage in Hybrid Directional Sensor Networks[J].IEEE Tran-sactions on Mobile Computing,2014,13(7):1443-1455.
[14]CHEN J,WANG B,LIU W,et al.Rotating directional sensors to mend barrier gaps in a line-based deployed directional sensor network[J].IEEE Systems Journal,2017,11(2):1027-1038.
[15]WU Y,CARDEI M.Distributed algorithms for barrier coverage via sensor rotation in wireless sensor networks[J].Journal of Combinatorial Optimization,2018,36:230-251.
[17]GUVENSAN A,YAVUZ G.Hybrid movement strategy in self-orienting directional sensor networks[J].Ad Hoc Networks,2013,11(3):1075-1090.
[1] LIU Tong, FANG Lu, GAO Hong-hao. Survey of Task Offloading in Edge Computing [J]. Computer Science, 2021, 48(1): 11-15.
[2] HU Jin-tian, WANG Gao-cai, XU Xiao-tong. Task Migration Strategy with Energy Optimization in Mobile Edge Computing [J]. Computer Science, 2020, 47(6): 260-265.
[3] CHENG Yu, LIU Wei, SUN Tong-xin, WEI Zhi-gang, DU Wei. Design of Fault-tolerant L1 Cache Architecture at Near-threshold Voltage [J]. Computer Science, 2020, 47(4): 42-49.
[4] SU Fan-jun,DU Ke-yi. Trust Based Energy Efficient Opportunistic Routing Algorithm in Wireless Sensor Networks [J]. Computer Science, 2020, 47(2): 300-305.
[5] ZHANG Peng-yi, SONG Jie. Research Advance on Efficiency Optimization of Blockchain Consensus Algorithms [J]. Computer Science, 2020, 47(12): 296-303.
[6] LI Zheng-yang, TAO Yang, ZHOU Yuan-lin, YANG Liu. Energy-balanced Multi-hop Cluster Routing Protocol Based on Energy Harvesting [J]. Computer Science, 2020, 47(11A): 296-302.
[7] LU Hai-feng, GU Chun-hua, LUO Fei, DING Wei-chao, YUAN Ye, REN Qiang. Virtual Machine Placement Strategy with Energy Consumption Optimization under Reinforcement Learning [J]. Computer Science, 2019, 46(9): 291-297.
[8] HAN Ye-fei, BAI Guang-wei, ZHANG Gong-xuan. Routing Optimization Algorithm of Wireless Sensor Network Based on Improved SVM [J]. Computer Science, 2018, 45(8): 131-133.
[9] 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.
[10] SHI Chao, XIE Zai-peng, LIU Han and LV Xin. Optimization of Container Deployment Strategy Based on Stable Matching [J]. Computer Science, 2018, 45(4): 131-136.
[11] WANG Yan-li, YIN Guo-fu, JIN Rong. New Optimized Energy Harvesting Technology for Sensor Networks [J]. Computer Science, 2018, 45(11): 82-86.
[12] HUANG Rong-xi, WANG Nao, XIE Tian-xiao, WANG Gao-cai. Study on Channel-aware Expected Energy Consumption Minimization Strategy in Wireless Networks [J]. Computer Science, 2018, 45(10): 130-137.
[13] GE Bin, DAI Chen, JI Jie-qu and WU Bo. Grouping-based Wireless Sensor Network Multi-rounds Clustering Routing Algorithm [J]. Computer Science, 2017, 44(Z6): 305-308.
[14] XU Hui-qing, WANG Gao-cai and MIN Ren-jiang. Energy-consumption Optimization Strategy Based on Cooperative Caching for Content-centric Network [J]. Computer Science, 2017, 44(8): 76-81.
[15] ZHANG Xun, GU Chun-hua, LUO Fei, CHANG Yao-hui and WEN Geng. Virtual Machine Placement Strategy Based on Dynamic Programming [J]. Computer Science, 2017, 44(8): 54-59.
Full text



[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 .