Distributed algorithms for power saving optimization in sensor network

Please enable javascript in your browser.

Ghani, S ; Sharif University of Technology

446 Viewed

Type of Document: Article
Abstract:
Sensor networks have a wide range of potential and practical application. A sensor network consists of a large number of tiny, low power and short-living sensors. Some sensor network applications require k-coverage to ensure the quality of surveillance. Meanwhile, energy is another primary concern for sensor networks. In this dissertation, an algorithm proposed which groups sensors in to disjoint subsets. Every subset cans k-cover the whole area. The subsets are scheduled to work successively. Therefore, the network lifetime is prolonged. Furthermore, sensing range is fixed. Also another algorithm, proposed which constructs some non-disjoint subsets, and in each active subset, each sensor only works with its smallest possible sensing range. Simulation results are presented to evaluate our proposed algorithms
Keywords:
Adjustable sensing range ; Energy saving ; k-coverage ; Wireless sensor networks
Source: Proceedings of the 8th WSEAS International Conference on Data Networks, Communications, Computers, DNCOCO '09, 7 November 2009 through 9 November 2009 ; 2009 , Pages 109-115 ; 9789604741342 (ISBN)