Academic Journals Database
Disseminating quality controlled scientific knowledge

The Maximum Coverage Set Calculated Algorithm for WSN Area Coverage

ADD TO MY LIST
 
Author(s): Xin He | Hua Yang | Xiaolin Gui

Journal: Journal of Networks
ISSN 1796-2056

Volume: 5;
Issue: 6;
Start page: 650;
Date: 2010;
Original page

Keywords: Wireless Sensor Network | Area Coverage | Set K-Cover algorithm | Maximum coverage set | Node minimum layer overlapping subfields

ABSTRACT
The Coverage Control Technology is one of the basic technologies of wireless sensor network, and is mainly concerned about how to prolong the network lifetime on the basis of meeting users’ perception demand. Among this, in the study of area coverage, the set K-cover algorithm is broadly accepted because that it can prolong network lifetime rather well. However, maximum set covers problem is proved to be NP-Complete. At the same time, the existing set K-cover algorithms are centralized, and can not adapt to the large-scale sensor network applications and expansion. So, how to get the maximum coverage set number and realize node set division by distributed algorithm is becoming the problem of people attention. Thus, this paper firstly utilizes node minimum layer overlapping subfield to find out area minimum coverage value, as the upper limit of coverage node set’s number. On the basis of this maximum, it put forward to way of dividing node set. Secondly, the maximum coverage set number calculated algorithm is proposed. Simulation result shows the distributed algorithm MCNCA is very effective.
Why do you need a reservation system?      Affiliate Program