To achieve required sensing coverage for a very long period of time is an important and challenging problem in sensor network design. Recently, Tong et al. have proposed a node rep...
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Abstract. In ad hoc sensor networks, sensor nodes have very limited energy resources, thus energy consuming operations such as data collection, transmission and reception must be k...
Xiaoling Wu, Shu Lei, Jie Yang, Hui Xu, Jinsung Ch...
— We study a fully distributed, reactive algorithm for deployment and maintenance of a mobile communication backbone that provides an area around a network gateway with wireless ...
Nikolaus Correll, Jonathan Bachrach, Daniel Vicker...
The predominate traffic patterns in a wireless sensor network are many-to-one and one-to-many communication. Hence, the performance of wireless sensor networks is characterized by ...