Abstract:

Under the circumstance of maintaining coverage and connectivity of wireless sensor networks, to extend the lifetime of networks through energy conservation technique is a critical issue. A heuristic algorithm based on the MDSMCC problem takes advantages of power aware organization to acquire long lifetime, and it uses greedy strategy to select maximum disjoint sets, the strategy selects the nodes which has the shortest path. Combining DFS and BFS, the paper proposed a new method called DBFS. The DBFS method takes the coverage as the first consideration to select disjoint sets. The simulation results prove that the performance of DBFS is better than greedy strategy in terms of the number of disjoint sets and the stability in different networks respectively.

Key words: lifetime of networks;greedy strategy;DBFS;disjoint sets