Improving Wireless Sensor Network Lifetime through Power Aware Organization

By Mihaela Cardei, D. Du. Wirel. Networks, 2005

945 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/22233e9478a88baaf76189f4d9a2dbc78d0181b2

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 Electrical and Electronic Engineering

Citations in the corpus

Energy-efficient target coverage in wireless sensor networks (2005, background): “The works most relevant to our approach are [2] and [15].”
FemtoCaching: Wireless video content delivery through distributed caching helpers (2011, background): “In the following, we will show that the above problem is NPcomplete.”
Location, Localization, and Localizability (2010, neutral): “The probabilistic approaches[19-21] analyze the node density for ensuring appropriate coverage statistically, but essentially have no guarantee on the result.”
Coverage by directional sensors in randomly deployed wireless sensor networks (2006, background): “Cardei and Du (2005) proposed the Maximum Disjoint Set Cover problem which shared the same notion as Slijepcevic and Potkonjak (2001) but in a different scenario where a set of targets with known locations need to be covered.”
FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers (2013, background): “It is known that the 2-disjoint set cover problem is NP-complete [37].”
Coverage problems in sensor networks: A survey (2011, background): “The problem of maximum disjoint set cover for complete target coverage [Cardei and Du 2005; Slijepcevic and Potkonjak 2001] is similar to the MSC problem, yet with the disjoint constraint.”
On coverage issues in directional sensor networks: A survey (2011, methodology): “To compare the performance of their protocol with a centralized algorithm, designed for omni-directional sensor networks, Greedy-MSC [86], the authors set the angle of view to 360 .”
Cluster head election techniques for coverage preservation in wireless sensor networks (2009, background): “The idea behind this approach is that nodes in sparsely deployed areas, as well as nodes with small remaining energies are used less often as data routers, so that these nodes can collect data for longer periods of time.”