Abstract:

arrier coverage has attracted much attention in wireless sensor network recently,and it is a very important problem that how to prolong the network life time.We devise two scheduling algorithms to maximize the network life time for barrier coverage:Greedy algorithm and DBCS (Distributed Barrier Coverage Scheduling) algorithm.Comprehensive simulation demonstrates that: (1) the two algorithms can prolong the network lifetime effectively;(2) the performance of DBCS is close to that of Greedy when the network is sparse,and (3) the DBCS is applicable for large scale sensor networks.

Key words: wireless sensor networks;barrier coverage;scheduling algorithm