Header menu link for other important links
Perimeter coverage using backward and forward greedy algorithm
, Rawat A.S, Swaminathan S, ,
Published in Hikari, Ltd.
Volume: 7
Issue: 77-80
Pages: 3883 - 3896
In today's world there is much need for monitoring of object(s). Depending upon the area of coverage, many sensors might be used to cover the entire area to be monitored. In such extensive areas, there is a need for finding minimum number of sensor nodes to activate among all nodes in wireless sensor networks. Greedy forward algorithms are currently efficient and effective algorithms that help find the minimum set of sensors required to monitor an area. Battery conservation has been a long term problem that many try to address. Our algorithm is basically an improvement over the present greedy forward algorithm in terms of reduced time complexity by parallel computation and also tries to extend the network lifetime of the network. © 2013 S. Renugadevi et al.
About the journal
JournalApplied Mathematical Sciences
PublisherHikari, Ltd.
Open Access0