%0 Journal Article %A SUN Ji-zhong %A MA Yong-qiang %A HU Yan %A KONG Xu %T Barrier coverage based on distributed Delaunay triangulation %D 2010 %R 10.3778/j.issn.1002-8331.2010.26.024 %J Computer Engineering and Applications %P 76-79 %V 46 %N 26 %X A Mutual Edge Distributed Delaunay Triangulation algorithm(MEDDEL) is proposed for wireless sensor networks,which can be run only by each node distributively with 1-hop neighborhood information.It builds MEDDEL more efficient and avoids lots of communication cost and energy consumption.Simultaneously,the support weight of MEDDEL is calculated and proved.Owing to the energy model of sensor and MEDDEL topology graph,the best-coverage-path problem is solved by a distributed Shortest travelling distance and Minimum energy consumption of Best-Coverage-Path algorithm(SMBCP) in wireless sensor network.Compared to RNG,GG,PLDEL,UDEL and DEL,the simulation results show that the best-coverage-path with the shortest travelling distance and minimum energy consumption can be found by SMBCP algorithm,in the smallest support weight of path. %U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2010.26.024