A coverage-preserving node scheduling scheme for large wireless sensor networks

Tian, Dean; Georganas, N.D.

doi:10.1145/570743.570744

Cited by 131 publications

(160 citation statements)

References 0 publications

Supporting

Mentioning

160

Contrasting

Order By: Relevance

“…The last approach is indicated to be better than the previous one. With a similar approach, in [19] the authors propose a node self-scheduling algorithm based on the eligibility rule for preserving coverage node in a WSN. In these two approaches, the main drawback is the assumption that the wireless sensor network has many sensors deployed in high density, and thus redundancy can be exploited.…”

Section: Related Workmentioning

confidence: 99%

Improving Multidimensional Wireless Sensor Network Lifetime Using Pearson Correlation and Fractal Clustering

Almeida

Brayner

Rodrigues

et al. 2017

Sensors

View full text Add to dashboard Cite

An efficient strategy for reducing message transmission in a wireless sensor network (WSN) is to group sensors by means of an abstraction denoted cluster. The key idea behind the cluster formation process is to identify a set of sensors whose sensed values present some data correlation. Nowadays, sensors are able to simultaneously sense multiple different physical phenomena, yielding in this way multidimensional data. This paper presents three methods for clustering sensors in WSNs whose sensors collect multidimensional data. The proposed approaches implement the concept of multidimensional behavioral clustering. To show the benefits introduced by the proposed methods, a prototype has been implemented and experiments have been carried out on real data. The results prove that the proposed methods decrease the amount of data flowing in the network and present low root-mean-square error (RMSE).

show abstract

Section: Related Workmentioning

confidence: 99%

Improving Multidimensional Wireless Sensor Network Lifetime Using Pearson Correlation and Fractal Clustering

Almeida

Brayner

Rodrigues

et al. 2017

Sensors

View full text Add to dashboard Cite

show abstract

“…The protocol deals with geometric information to derive redundancy, and thus it allows redundant nodes to be turned off. A similar strategy has been used by Tian and Georganas [29], by Chen et al [30], and by Xu et al [31] in wireless ad hoc networks. The proposals in this category do not make sense for use in HWSN, due to the fact that all nodes are important actors in the sensing process.…”

Section: Related Workmentioning

confidence: 99%

Energy-Aware Topology Control Strategy for Human-Centric Wireless Sensor Networks

Meseguer

Molina

Ochoa

et al. 2014

Sensors

View full text Add to dashboard Cite

The adoption of mobile and ubiquitous solutions that involve participatory or opportunistic sensing increases every day. This situation has highlighted the relevance of optimizing the energy consumption of these solutions, because their operation depends on the devices' battery lifetimes. This article presents a study that intends to understand how the prediction of topology control messages in human-centric wireless sensor networks can be used to help reduce the energy consumption of the participating devices. In order to do that, five research questions have been defined and a study based on simulations was conducted to answer these questions. The obtained results help identify suitable mobile computing scenarios where the prediction of topology control messages can be used to save energy of the network nodes. These results also allow estimating the percentage of energy saving that can be expected, according to the features of the work scenario and the participants behavior. Designers of mobile collaborative applications that involve participatory or opportunistic sensing, can take advantage of these findings to increase the autonomy of their solutions.

show abstract

“…Tian and Georganas [18] proposed a solution for sensor area coverage in synchronous homogeneous networks where the sensing range is equal to the transmission range. It requires that every node knows the positions of all its neighbors before making its monitoring decision.…”

Section: Low-communication-overhead Schemesmentioning

confidence: 99%

“…First, for the ideal MAC and physical layers, our protocols should achieve similar performance, in terms of the ratio of active sensors in a given round being the best existing localized solution [18], [12], while reducing significantly the number of messages for making a decision at each node. Our protocols should have comparable area coverage and connectivity preservation along with increasing reliability of the network and a decreasing message cost.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Localized Sensor Area Coverage with Low Communication Overhead

Gallais¹,

Carle²,

Simplot‐Ryl³

2008

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

We propose several localized sensor area coverage protocols for heterogeneous sensors, each with arbitrary sensing and transmission radii. The approach has a very small communication overhead since prior knowledge about neighbor existence is not required. Each node selects a random time out and listens to messages sent by other nodes before the time out expires. Sensor nodes whose sensing area is not fully covered (or fully covered but with a disconnected set of active sensors) when the deadline expires decide to remain active for the considered round and transmit an activity message announcing it. There are four variants in our approach, depending on whether or not withdrawal and retreat messages are transmitted. Covered nodes decide to sleep, with or without transmitting a withdrawal message to inform neighbors about the status. After hearing from more neighbors, active sensors may observe that they became covered and may decide to alter their original decision and transmit a retreat message. Our simulations show a largely reduced message overhead while preserving coverage quality for the ideal MAC/physical layer. Compared to an existing method (based on hello messages followed by retreat ones and where excessive message loss contributed to excessive coverage holes), our approach has shown robustness in a model with collisions and/or a realistic physical layer.

show abstract

A coverage-preserving node scheduling scheme for large wireless sensor networks

Cited by 131 publications

References 0 publications

Improving Multidimensional Wireless Sensor Network Lifetime Using Pearson Correlation and Fractal Clustering

Improving Multidimensional Wireless Sensor Network Lifetime Using Pearson Correlation and Fractal Clustering

Energy-Aware Topology Control Strategy for Human-Centric Wireless Sensor Networks

Localized Sensor Area Coverage with Low Communication Overhead

Contact Info

Product

Resources

About