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

  title={PEAS: a robust energy conserving protocol for long-lived sensor networks},
  author={F. Ye and Gary Zhong and Songwu Lu and Lixia Zhang},
  journal={10th IEEE International Conference on Network Protocols, 2002. Proceedings.},
  • F. Ye, Gary Zhong, +1 author Lixia Zhang
  • Published 2002
  • Computer Science
  • 10th IEEE International Conference on Network Protocols, 2002. Proceedings.
Small, inexpensive sensors with limited memory, computing power and short battery lifetimes are turning into reality. Due to adverse conditions such as high noise levels, extreme humidity or temperatures, or even destructions from unfriendly entities, sensor node failures may become norms rather than exceptions in real environments. To be practical, sensor networks must last for much longer times than that of individual nodes, and have yet to be robust against potentially frequent node failures… Expand

Figures and Topics from this paper

R-Sentry: Providing Continuous Sensor Services against Random Node Failures
  • Shengchao Yu, Yanyong Zhang
  • Computer Science
  • 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07)
  • 2007
Simulation results show that compared to PEAS, a popular node scheduling algorithm, R-Sentry can provide a continuous 95% coverage through bounded recoveries from frequent node failures, while prolonging the lifetime of a sensor network by roughly 30%. Expand
Decentralized energy-conserving and coverage-preserving protocols for wireless sensor networks
This work proposes several decentralized protocols that schedule sensors' active and sleeping periods to prolong the network lifetime while maintain the sensing field sufficiently covered and can significantly reduce the computational complexity incurred and achieve better accuracy in determining the coverage of the sensing area. Expand
Guaranteeing the network lifetime in wireless sensor networks: A MAC layer approach
A new adaptive MAC (A-MAC) protocol is proposed that not only guarantees the pre-configured network lifetime but also reduces the end-to-end latency. Expand
Distributed Lifetime Optimization in Wireless Sensor Networks
This paper introduces an efficient distributed failure-aware strategy (on-line solution) using probabilistic Weibull distribution to resist to frequent and unexpected fail-silent/fail-stop node failures. Expand
Distributed duty-cycle management for dependable wireless sensor networks
It is believed that the deployments of Wireless Sensor Network (WSN) have great long-term economic potential, ability to transform our lives, and pose many new system-building challenges. A typicalExpand
Stabilization and Lifetime Optimization in Distributed Sensor Networks
This paper introduces an efficient lifetime optimization and self-stabilizing algorithm to enhance the lifetime of wireless sensor networks especially when the reliabilities of sensor nodes are expected to decrease due to use and wear-out effects. Expand
Various Routing Protocols through MATLAB: A Review
The sensors are usually expected in an important area to perform the same function. Since WSN often lies in a hazardous or inaccessible location, the cardiovascular system's electrical potential isExpand
A Lazy-Binding Communication Protocol for Highly Dynamic Wireless Sensor Networks
  • 2003
Wireless sensor networks are characterized by limited availability and reliability of the wireless channel and by high rates of node failure. These pose challenging requirements for communicationExpand
Convergent Anycast: A Low Duty-Cycle MAC Layer for Sensor Networks
Energy conservation is critical for extending the lifetime of wireless sensor networks. A simple way to conserve energy is to turn off the radio transceiver for brief durations. Without anyExpand
A Survey of Energy-Efficient Scheduling Mechanisms in Sensor Networks
A survey on energy-efficient scheduling mechanisms in sensor networks that have different design requirements than those in traditional wireless networks and classify these mechanisms based on their design assumptions and design objectives. Expand


ASCENT: adaptive self-configuring sensor networks topologies
  • A. Cerpa, D. Estrin
  • Computer Science, Engineering
  • IEEE Transactions on Mobile Computing
  • 2004
The ASCENT algorithm is motivated and described and it is shown that the system achieves linear increase in energy savings as a function of the density and the convergence time required in case of node failures while still providing adequate connectivity. Expand
ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies
  • A. Cerpa, D. Estrin
  • Computer Science
  • Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
  • 2002
The ASCENT algorithm, which assesses its connectivity and adapts its participation in the multi-hop network topology based on the measured operating region, aims to establish a topology that provides communication and sensing coverage under stringent energy constraints. Expand
Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks
A randomized algorithm where coordinators rotate with time is given, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology. Expand
Geography-informed energy conservation for Ad Hoc routing
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. Expand
Proceedings of the 10 th IEEE International Conference on Network Protocols
  • Proceedings of the 10 th IEEE International Conference on Network Protocols
  • 2002
GRAdient Broadcast: A Robust, Long-lived Large Sensor Network
  • 2001
Geography Informed En ergy Conmservation for Ad Hoc Routing
  • 2001
Adaptive Energy-Conserving Routing for Multihop Ad Hoc Networks