Energy-efficient cooperative data aggregation for wireless sensor networks

DOI10.1016/j.jpdc.2010.05.009zbMath1233.68096OpenAlexW2013649483MaRDI QIDQ666214

Juan-Miguel Gracia

Publication date: 7 March 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2010.05.009

zbMATH Keywords

lifetimeheuristic algorithmwireless sensor networksenergy efficiencydata aggregationcooperative communications

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

The \( N\)-policy of a discrete time Geo/G/1 queue with disasters and its application to wireless sensor networks ⋮ Optimal power consumption control of sensor node based on (N, D)-policy discrete-time queues

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks.
• A Fast Distributed Approximation Algorithm for Minimum Spanning Trees
• Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior
• Algorithmic Aspects of Wireless Sensor Networks

This page was built for publication: Energy-efficient cooperative data aggregation for wireless sensor networks