scispace - formally typeset
Proceedings ArticleDOI

PEAS: a robust energy conserving protocol for long-lived sensor networks

Reads0
Chats0
TLDR
A robust energy-conserving protocol that can build long-lived, resilient sensor networks using a very large number of small sensors with short battery lifetime, PEAS can extend a sensor network's functioning time in linear proportion to the deployed sensor population.
Abstract
In this paper we present PEAS, a robust energy-conserving protocol that can build long-lived, resilient sensor networks using a very large number of small sensors with short battery lifetime. PEAS extends the network lifetime by maintaining a necessary set of working nodes and turning off redundant ones. PEAS operations are based on individual node's observation of the local environment and do not require any node to maintain per neighbor node state. PEAS performance possesses a high degree of robustness in the presence of both node power depletions and unexpected failures. Our simulations and analysis show that PEAS can maintain an adequate working node density in the face of up to 38% node failures, and it can maintain roughly a constant overhead level under various deployment conditions ranging from sparse to very dense node deployment by using less than 1% of total energy consumption. As a result, PEAS can extend a sensor network's functioning time in linear proportion to the deployed sensor population.

read more

Citations
More filters
Journal ArticleDOI

HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks

TL;DR: It is proved that, with appropriate bounds on node density and intracluster and intercluster transmission ranges, HEED can asymptotically almost surely guarantee connectivity of clustered networks.
Journal Article

Maintaining Sensing Coverage and Connectivity in Large Sensor Networks.

TL;DR: A decentralized density control algorithm, Optimal Geographical Density Control (OGDC), is devised for density control in large scale sensor networks and can maintain coverage as well as connectivity, regardless of the relationship between the radio range and the sensing range.
Proceedings ArticleDOI

Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach

TL;DR: A protocol is presented, HEED (hybrid energy-efficient distributed clustering), that periodically selects cluster heads according to a hybrid of their residual energy and a secondary parameter, such as node proximity to its neighbors or node degree, which outperforms weight-based clustering protocols in terms of several cluster characteristics.
Proceedings ArticleDOI

Integrated coverage and connectivity configuration in wireless sensor networks

TL;DR: The design and analysis of novel protocols that can dynamically configure a network to achieve guaranteed degrees of Coverage Configuration Protocol (CCP) and integrate SPAN to provide both coverage and connectivity guarantees are presented.
Proceedings ArticleDOI

The coverage problem in a wireless sensor network

TL;DR: This paper presents polynomial-time algorithms, in terms of the number of sensors, that can be easily translated to distributed protocols, and forms a decision problem to determine whether every point in the service area of the sensor network is covered by at least k sensors.
References
More filters
Proceedings ArticleDOI

Directed diffusion: a scalable and robust communication paradigm for sensor networks

TL;DR: This paper explores and evaluates the use of directed diffusion for a simple remote-surveillance sensor network and its implications for sensing, communication and computation.
Journal ArticleDOI

System architecture directions for networked sensors

TL;DR: Key requirements are identified, a small device is developed that is representative of the class, a tiny event-driven operating system is designed, and it is shown that it provides support for efficient modularity and concurrency-intensive operation.
Journal Article

Geography-informed Energy Conservation for Ad Hoc Routing

TL;DR: In this article, the authors proposed a geographical adaptive fidelity (GAF) algorithm that reduces energy consumption in ad hoc wireless networks by identifying nodes that are equivalent from a routing perspective and turning off unnecessary nodes, keeping a constant level of routing fidelity.
Proceedings ArticleDOI

Geography-informed energy conservation for Ad Hoc routing

TL;DR: A geographical adaptive fidelity algorithm that reduces energy consumption in ad hoc wireless networks by identifying nodes that are equivalent from a routing perspective and then turning off unnecessary nodes, keeping a constant level of routing fidelity.
Proceedings ArticleDOI

Span: An energy-efficient coordination algorithm for topology maintenance in Ad Hoc wireless networks

TL;DR: A randomized algorithm where coordinators rotate with time is given, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology.
Related Papers (5)