Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks

DOI10.3390/a2010121zbMath1461.68255OpenAlexW2164535373MaRDI QIDQ1662465

Paul G. Spirakis, Sotiris E. Nikoletseas

Publication date: 20 August 2018

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a2010121

zbMATH Keywords

trackingdistributed algorithmsroutingprobabilistic methodsenergy efficiencysensor networks

Mathematics Subject Classification ID

Randomized algorithms (68W20) Distributed algorithms (68W15) Wireless sensor networks as related to computer science (68M18)

Related Items (3)

Temporal Vertex Cover with a Sliding Time Window ⋮ Energy efficient routing in wireless sensor networks through balanced clustering ⋮ Temporal vertex cover with a sliding time window

Uses Software

• LEDA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Energy optimal data propagation in wireless sensor networks
• Efficient sensor network design for continuous monitoring of moving objects
• Negotiation-based protocols for disseminating information in wireless sensor networks
• Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks
• Algorithmic construction of sets for k -restrictions
• A threshold of ln n for approximating set cover
• On the hardness of approximating minimization problems
• Grid coverage for surveillance and target location in distributed sensor networks
• Approximating k-set cover and complementary graph coloring
• Algorithmic Aspects of Wireless Sensor Networks
• Energy-Balanced Data Propagation inWireless Sensor Networks

This page was built for publication: Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks