Exact and approximate balanced data gathering in energy-constrained sensor networks

DOI10.1016/j.tcs.2005.06.024zbMath1079.68004OpenAlexW2162393343WikidataQ57540253 ScholiaQ57540253MaRDI QIDQ2575091

Petteri Kaski, Jukka Kohonen, Patrik Floréen, Pekka Orponen

Publication date: 5 December 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.06.024

zbMATH Keywords

optimizationwireless networkssensor networksdata gatheringenergy efficient designmulti-hop ad hoc networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (4)

Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint ⋮ Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs ⋮ Improved approximation algorithms for maximum lifetime problems in wireless networks ⋮ Collision-free path coloring with application to minimum-delay gathering in sensor networks

Cites Work

• A note on two problems in connexion with graphs
• Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
• Grid coverage for surveillance and target location in distributed sensor networks
• Algorithmic Aspects of Wireless Sensor Networks
• Algorithmic Aspects of Wireless Sensor Networks
• Unnamed Item

This page was built for publication: Exact and approximate balanced data gathering in energy-constrained sensor networks