Power efficient organization of wireless sensor networks

By S. Slijepcevic, Miodrag Potkonjak. ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240), 2001

1,094 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/b2c7ba6ef6347a6290db57c5c5d8e00823099f6b

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

Optimal Value of Information in Graphical Models (2009, background): “The problem of deciding when to selectively turn on sensors in order to conserve power was first discussed by Slijepcevic and Potkonjak (2001) and Zhao, Shin, and Reich (2002).”
Energy-efficient deployment of Intelligent Mobile sensor networks (2005, methodology): “node topology [23], [30] has been carried out, there has not been any work on energy efficiency for deployment of mobile nodes to the best of our knowledge.”
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.”
Improving Wireless Sensor Network Lifetime through Power Aware Organization (2005, background): “Keywords: wireless sensor networks, energy efficiency, node organization, disjoint set covers”
Recruitment Framework for Participatory Sensing Data Collections (2010, background): “Sensor network research has taken place in regards to selecting and placing static devices to maximize coverage [35].”
Maintaining Sensing Coverage and Connectivity in Large Sensor Networks (2005, background): “[24] address the problem of finding the maximal number of covers in a sensor network, where a cover is defined as a set of nodes that can completely cover the monitored area.”
Connected sensor cover: self-organization of sensor networks for efficient query execution (2003, methodology): “The work most closely related to ours is that by Slijepcsevic and Potkonjak [25], where the authors consider powerefficient organization of sensor networks.”
A survey on coverage and connectivity issues in wireless sensor networks (2012, methodology): “The investigations in Cardei et al. (2002) and Slijepcevic and Potkonjak (2001) considered a large population of sensors, which are deployed randomly for area monitoring.”
The Coverage Problem in a Wireless Sensor Network (2003, background): “In general, this re.ects how well an area is monitored or tracked by sensors.”
A Survey of Energy-Efficient Scheduling Mechanisms in Sensor Networks (2006, background): “In addition, a few mechanisms assume that the sensors form a grid [22], [27].”
Coverage in Wireless Sensor Networks (2004, background): “Coverage Approach Coverage Type Problem Objectives Most Constrained-Minimally Constraining Heuristic [21] Area Coverage Energy-Efficiency Maximize network lifetime by reducing the number of working nodes”
Connected K-coverage problem in sensor networks (2004, background): “authors in [4] design a centralized heuristic to select mutually exclusive sensor covers that independently cover the network region.”
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks (2003, background): “The randomized algorithm in particular seems quite practical.”
Energy-efficient target coverage in wireless sensor networks (2005, background): “The coverage problems can be classified in the following types [3] : • area coverage [4] , [16], [17], [19], [15], where the main objective is to cover (monitor) an area, • point (or target) coverage [2], [9], where the objective is to cover a set of points (targets) and • coverage problems that…”