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

By Di Tian, Nicolas D. Georganas. ACM International Conference on Wireless Sensor Networks and Applications, 2002

1,211 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/4f7cf1afe1edd6c910c565752f40b24337f9d250

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Computer Vision and Pattern Recognition

Citations in the corpus

Clustering in sensor networks: A literature survey (2014, background): “In addition to the energy efficiency, some other objectives might be targeted as main objective of the clustering approach, such as full coverage of the field (Tian and Georganas, 2002; Soro and Heinzelman, 2009) and fault-tolerance (Tai et al., 2004).”
Information fusion for wireless sensor networks: Methods, models, and classifications (2007, background): “Spatial coverage in WSNs [Meguerdichian et al. 2001b] has been explored in different scenarios, such as target tracking [Chakrabarty et al. 2002], node scheduling [Tian and Georganas 2002], and sensor placement [Dhillon et al.”
Integrated coverage and connectivity configuration in wireless sensor networks (2003, methodology): “The protocol proposed in [ 14 ] depends on local geometric calculation of sponsored sectors to preserve sensing coverage.”
On coverage issues in directional sensor networks: A survey (2011, methodology): “To evaluate the performance of their distributed algorithm the authors chose OGDC algorithm [65] which outperforms other existing distributed solutions [66–68] for omni-directional sensor networks.”
A Survey on Topology Control in Wireless Sensor Networks: Taxonomy, Comparative Study, and Open Issues (2008, background): “The issue of coverage with different sensing capacities is addressed by Tian and Georganas [78].”
Coverage in Wireless Sensor Networks (2004, background): “Another energy-efficient node-scheduling-based coverage mechanism is proposed in [22].”
A survey on coverage and connectivity issues in wireless sensor networks (2012, background): “…as possible active nodes from all deployed sensor nodes to perform sensing task such that sufficient coverage of the monitored area can be guaranteed while reducing the energy consumption of each individual sensor node to prolong the network lifetime (Tian and Georganas, 2002; Wang et al., 2009).”
An Energy-Efficient Data Collection Framework for Wireless Sensor Networks by Exploiting Spatiotemporal Correlation (2007, background): “Imagine that scientists want to collect information about the evolving process of a particular phenomenon over a given region.”
Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms (2004, methodology): “While [10, 12] proposed distributed algorithms, [11] proposed a centralized approach (Set K-Cover) to turn off sensors.”
Survey on Sensor Networks (2002, methodology): “PEAS assumes that all nodes have the same sensing range, while the node scheduling scheme in [33] allows nodes to have different sensing ranges.”
The holes problem in wireless sensor networks: a survey (2005, background): “The issue of coverage with different sensing capabilities has been addressed in [ 24 ] by Tian et al. The authors discussed the topology control for both uniform and different sensing ranges.”
The Coverage Problem in a Wireless Sensor Network (2003, background): “This problem can be solved optimally in a 2D plane, but is shown to be NP-hard when extended to a 3D space [7].”
Cluster head election techniques for coverage preservation in wireless sensor networks (2009, background): “In [ 24 ] the authors propose a scheduling scheme that enables each node to enter the active or sleeping mode based on the coverage information obtained from its neighbors, without compromising full network coverage.”
Maintaining Sensing Coverage and Connectivity in Large Sensor Networks (2005, methodology): “The work reported in [31], [32], [28] comes closest to ours.”
On the lifetime of wireless sensor networks (2009, background): “…2006; Tilak et al. 2002; Wieselthier et al. 2002]; 5:10 I. Dietrich and F. Dressler (4) the time until all nodes have been drained of their energy [Tian and Georganas 2002]; (5) k-coverage: the time the area of interest is covered by at least k nodes [Mo et al. 2005]; (6) 100% coverage (a)…”
Integrated coverage and connectivity configuration for energy conservation in sensor networks (2005, methodology): “The state transition in CCP is similar to SPAN [Chen et al. 2002] and several other protocols [Tian and Georganas 2002; Xu et al. 2002].”