Constructing &lt;I&gt;k&lt;/I&gt;-Barrier Coverage in Mobile Wireless Sensor Networks

Ban, Dongsong; Wen, Jun; Jiang, Jie; Wang, Dou

doi:10.3724/sp.j.1001.2011.03877

Cited by 5 publications

(5 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…8. is the comparison result of literature [7], [14], [16] and the algorithm in this paper on the total distance between k value and node movement. Table 1 is a comparison of the average distance between the K value and the node movement of different algorithms.…”

Section: A Formation Of K-barrier Coveragementioning

confidence: 99%

“…The total moving distance of the proposed algorithm is respectively 216 meters and 786 meters, and the average distance is 5 meters and 6.1 meters. The total distance that the algorithm in [7] needs to move is 591 meters and 1,023 meters respectively, and the average distance is 7 meters and 8.5 meters. The algorithm in [14] requires to move a total of 385 meters and 794 meters respectively.…”

Section: A Formation Of K-barrier Coveragementioning

confidence: 99%

“…As an important parameter of sensor nodes, node radius and node density have profound influence on the formation and performance of barrier coverage. To illustrate radius of node, the node density change on total mobile node distance, node moving average distance, the influence of coverage and network coverage performance such as energy consumption, and through simulation experiments, so we compare and analysis the proposed algorithm and the CBIGB algorithm in Reference [7], PMNSB algorithm in Reference [14] and the AI-BCA algorithm in Reference [16], as shown in Fig. 9 (a), 9 (b), 9 (c) and 9 (d).…”

Section: B Influence Of Different Algorithms' Node Density On Coverage Performancementioning

confidence: 99%

“…Adopting different reference barrier lines will have different impact on coverage performance, and we compare HNBC algorithm in this paper with BGBS3 algorithm in [7], PMNSB algorithm in [14] and A1-BCA algorithm in [17]. The effect of k value on the moving distance under different benchmark barriers is shown in table 2 and table 3, and the influence of node density under different benchmark barriers on the moving distance is shown in Fig.…”

Section: Comparsion Of Different Reference Barrier Constructionmentioning

confidence: 99%

“…The barrier coverage can be divided into two problems, ''exposure crossing'' and ''worst and best case covering,'' according to the model used by the target to traverse the coverage area of sensor network. Barrier coverage is more suitable for monitoring application scenarios of moving targets, and it does not require regional coverage and many nodes, such as illegal border crosser detection at national defense borders, enemy invasion detection in the military battlefield, species migration monitoring in environmental protection, and forest fire monitoring [7].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A Novel Algorithm for Barrier Coverage Based on Hybrid Wireless Sensor Nodes

et al. 2019

View full text Add to dashboard Cite

Barrier coverage is one of the research hot spots of wireless sensor network coverage control. In order to fix the defects and deficiencies of the network, which is composed of all isomorphic nodes in the barrier coverage, Voronoi diagram is introduced to divide the entire deployment area. According to the principle of the least square method, a mixed network deployment mechanism consisting of static nodes and dynamic nodes is established with static nodes working as the reference barrier line. By monitoring whether there is a barrier covering the blind spot in the deployed area, the monitoring area can be effectively covered by determining whether dynamic nodes need limited movement to redeploy the monitored area. And puts forward mixed node barrier covered in this algorithm, algorithm Voronoi diagram was used for continuous path problem domain discretization, and from different dimensions to compare coverage performance of each algorithm, the simulation experiments show that the algorithm improves the quality of monitoring area coverage, under the same conditions as other algorithms, a mobile node distance and low energy consumption, less expected to cover requirements and goals are met.

show abstract

Section: A Formation Of K-barrier Coveragementioning

confidence: 99%

Section: A Formation Of K-barrier Coveragementioning

confidence: 99%

Section: B Influence Of Different Algorithms' Node Density On Coverage Performancementioning

confidence: 99%

Section: Comparsion Of Different Reference Barrier Constructionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations