Performance of a connected random covered energy efficient wireless sensor network.

No abstract is available for this paper.

• Publication year

  2009

• Venue

  World Academy of Science, Engineering and Technology, International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering

• Publication date

  2009-05-29

• Fields of study

  Computer Science, Engineering

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Lightweight Deployment-Aware Scheduling for Wireless Sensor Networks

  2005cited by this paper
• Randomized Coverage-Preserving Scheduling Schemes for Wireless Sensor Networks

  2005cited by this paper
• ASCENT: adaptive self-configuring sensor networks topologies

  2004cited by this paper
• Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms

  2004cited by this paper
• Differentiated surveillance for sensor networks

  2003cited by this paper
• Set k-cover algorithms for energy efficient monitoring in wireless sensor networks

  2003cited by this paper
• Topology Control Protocols to Conserve Energy in Wireless Ad Hoc Networks

  2003cited by this paper
• A coverage-preserving node scheduling scheme for large wireless sensor networks

  2002cited by this paper
• Topology management for sensor networks: exploiting latency and density

  2002cited by this paper
• PEAS: a robust energy conserving protocol for long-lived sensor networks

  2002cited by this paper
• Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks

  2001cited by this paper
• Power efficient organization of wireless sensor networks

  2001cited by this paper
• Smart Dust: Communicating with a Cubic-Millimeter Computer

  2001cited by this paper
• Coverage problems in wireless ad-hoc sensor networks

  2001cited by this paper
• IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, PAPER ID: TPDS-0307-0605.R1 1 Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks

  year unknowninfluential reference

• Rescheduling of Nodes Duty Cycles to Prevent Partitioning in Wireless Sensor Networks

  2016cites this paper
• Formal Analysis of a Scheduling Algorithm for Wireless Sensor Networks

  2011cites this paper