Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
A linear bound on the complexity of the delaunay triangulation of points on polyhedral surfaces
Proceedings of the seventh ACM symposium on Solid modeling and applications
Minimum-energy broadcasting in static ad hoc wireless networks
Wireless Networks
Delaunay Triangulation in Three Dimensions
IEEE Computer Graphics and Applications
New Results for Energy-Efficient Broadcasting in Wireless Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
The minimum broadcast range assignment problem on linear multi-hop wireless networks
Theoretical Computer Science
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Extremal Properties of Three-Dimensional Sensor Networks with Applications
IEEE Transactions on Mobile Computing
Improved approximation results for the minimum energy broadcasting problem
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees
PE-WASUN '04 Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Tighter Bounds for the Minimum Energy Broadcasting Problem
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Computing Optimal or Near-Optimal Trees for Minimum-Energy Broadcasting in Wireless Networks
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
The “real” approximation factor of the MST heuristic for the minimum energy broadcasting
Journal of Experimental Algorithmics (JEA)
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Minimum energy broadcast and disk cover in grid wireless networks
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
3-D minimum energy broadcasting
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
The minimum energy broadcast routing problem was extensively studied during the last years. Given a sample space where wireless devices are distributed, the aim is to perform the broadcast communication pattern from a given source while minimising the total energy consumption. While many papers deal with the 2-dimensional case where the sample space is given by a plain area, few results are known about the more interesting and practical 3-dimensional case. In this paper we study this case and we present a tighter analysis of the minimum spanning tree heuristic in order to considerably decrease its approximation factor from the known 26 to roughly 18.8. This decreases the gap with the known lower bound of 12 given by the so-called 3-dimensional kissing number.