Springer-Verlag, vol. 6785, pp. 148-158, Jun. 2011
Manh Thuong Quan Dao, Ngoc Duy Nguyen, Vyacheslaw Zalyubovskiy, and Hyunseung Choo
The coverage problem is a fundamental issue in wireless sensor networks. It has attracted considerable attention recently. Most node scheduling patterns utilize the adjustable range of sensors to minimize the sensing energy consumption, and thus extend the network lifetime. However, a large source of the consumption of the sensor communication energy is not strictly taken into account. In this paper, we introduce two energy-efficient patterns that are used to minimize the communication energy consumption of a sensor network, and simultaneously, maintain a high degree of coverage. Moreover, the proposed patterns have a structure that is easy to design and apply to practical applications. Calculations and extensive simulation are conducted to evaluate the efficiency of the new patterns compared to existing ones in terms of various performance metrics.