The Localized Area Coverage algorithm Based on Distance Priority Scheme

Content Provider	CiteSeerX
Author	He, Xin Gui, Xiaolin
Description	the basic technologies of wireless sensor network, and is mainly concerned about how to prolong the network lifetime on the basis of meeting user’s perception demand. Among this technology, localized area coverage algorithm in the study of area coverage technology is gradually attracting wide attention, for its less traffic and lower single-node computation. However, the existing localized area coverage algorithm has either phenomenon of coverage holes and can’t meet user’s perception demand or phenomenon of Nibble and leads to too much active nodes and shortens network lifetime. Therefore, localized area coverage algorithm based on delayed start scheme is proposed. It applies time round mechanism without knowing the network topology in advance and uses circle intersection coverage evaluation algorithm to ensure fully covered area and avoid the phenomenon of coverage loopholes. What is more, the application of delayed start scheme reduces the phenomenon of Nibble. According to the experimental results, compared with the existing localized area coverage algorithms, this algorithm can prolong the network lifetime on the basis of meeting user’s perception demand.
File Format	PDF
Language	English
Publisher Institution	In Wireless Sensor Networks”, JDCTA
Access Restriction	Open
Subject Keyword	Delayed Start Scheme Coverage Loophole Area Coverage Algorithm User Perception Demand Circle Intersection Coverage Evaluation Algorithm Time Round Mechanism Area Coverage Technology Shortens Network Lifetime Network Topology Localized Area Coverage Algorithm Wide Attention Single-node Computation Distance Priority Scheme Wireless Sensor Network Network Lifetime Coverage Hole Experimental Result Much Active Node Le Traffic Basic Technology
Content Type	Text
Resource Type	Article