Energy conserving based k-coverage algorithm for dense wireless sensor networks

摘要

W artykule zaproponowano energooszczędny algorytm dla gęstej, niejednorodnej sieci bezprzewodowej czujników. Każdy czujnik decyduje o stanie włączenia lub wyłączenia na początku każdej rundy testowania a następnie przeprowadzana jest transmisja danych do sąsiada. W zależności od priorytetu czujnika czas decyzji jest krótszy.%As the energy supply of wireless sensor is limited, it is important to dynamically configure wireless sensor networks by correctly setting the on/off status of each sensor to let every target be k covered. In this paper, we propose an energy-efficient distributed target k-coverage algorithm for dense heterogeneous wireless sensor networks with multiple sensing units. To save the energy of sensors more efficiently, the sensing ability and the remaining energy of a given sensor is integrated to calculate sensor priority. The proposed approach is locally and simultaneously running at each sensor in a rounding mode. Each sensor should decide the on/off status of its sensing units at the beginning of each round, and then transmits this decision to its one-hop neighbours. The higher the priority of a sensor is, the shorter the decision time it needs. Experimental results show that compared with Energy First scheme and Integer Linear Programming solution, our approach has longer network lifetime than Energy First scheme, and the performance of our approach is second only to Integer Linear Programming solution.