Power efficient organization of wireless sensor networks

Abstract

--Wireless sensor networks have emerged recently as an effective way of monitoring remote or inhospitable physical environments. One of the major challenges in devising such networks lies in the constrained energy and computational resources available to sensor nodes. These constraints must be taken into account at all levels of system hierarchy.The deployment of sensor nodes is the first step in establishing a sensor network. Since sensor networks contain a large number of sensor nodes, the nodes must be deployed in clusters, where the location of each particular node cannot be fully guaranteed a priori. Therefore, the number of nodes that must be deployed in order to completely cover the whole monitored area is often higher than if a deterministic procedure were used. In networks with stochastically placed nodes, activating only the necessary number of sensor nodes at any particular moment can save energy. We introduce a heuristic that selects mutually exclusive sets of sensor nodes, where the members of each of those sets together completely cover the monitored area. The intervals of activity are the same for all sets, and only one of the sets is active at any time. The experimental results demonstrate that by using only a subset of sensor nodes at each moment, we achieve a significant energy savings while fully preserving coverage.

On Connected Multiple Point Coverage in Wireless Sensor Networks

“…For k-coverage, a global method was proposed in [18] to construct k separate sets, each set achieving 1-coverage. Together, these sets provide k-coverage.…”

Formal Analysis of a Scheduling Algorithm for Wireless Sensor Networks

“…The trend is then to use a random scheduling scheme to save energy. The idea of the random scheduling was first motivated by the work of [30] and has been proposed by [1] and [21]. As the study of random scheduling algorithms for WSNs is recent, the focus is to investigate more in developing new models that can satisfy both constraints of coverage and connectivity.…”

“…coverage [1,34,36,38] or connectivity [5,35] but rarely both. Moreover, many works have studied different techniques to determine an eligibility rule for the activation of the next sub-network [26] and [30].…”

Set It and Forget It: Approximating the Set Once Strip Cover Problem

“…Motivated by prior invocations of duty cycling [19,17,1,7,9,10], Bar-Noy et al [4] studied a duty cycle variant of OnceSC with unit batteries in which sensors must be grouped into shifts of size at most k that take turns covering [0,1]. (RoundRobin is the only possible algorithm when k = 1.)…”