Power consumption in packet radio networks
Theoretical Computer Science
Constructing minimum energy mobile wireless networks
ACM SIGMOBILE Mobile Computing and Communications Review
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
An on-demand minimum energy routing protocol for a wireless ad hoc network
ACM SIGMOBILE Mobile Computing and Communications Review
Minimum-energy broadcasting in static ad hoc wireless networks
Wireless Networks
Symmetric Connectivity with Minimum Power Consumption in Radio Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Energy efficient communication in ad hoc networks from user's and designer's perspective
ACM SIGMOBILE Mobile Computing and Communications Review
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
A unified energy-efficient topology for unicast and broadcast
Proceedings of the 11th annual international conference on Mobile computing and networking
The “real” approximation factor of the MST heuristic for the minimum energy broadcasting
Journal of Experimental Algorithmics (JEA)
Sharing the cost of multicast transmissions in wireless networks
Theoretical Computer Science
Energy-aware multicasting in wireless ad hoc networks: A survey and discussion
Computer Communications
3-Dimensional minimum energy broadcasting problem
Ad Hoc Networks
Tightening the upper bound for the minimum energy broadcasting
Wireless Networks
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
On construction of minimum energy k-fault resistant topologies
Ad Hoc Networks
Low-energy fault-tolerant bounded-hop broadcast in wireless networks
IEEE/ACM Transactions on Networking (TON)
Minimum-energy broadcast with few senders
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
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
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
The “real” approximation factor of the MST heuristic for the minimum energy broadcasting
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Free-riders in steiner tree cost-sharing games
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Energy and time efficient broadcasting in known topology radio networks
DISC'07 Proceedings of the 21st international conference on Distributed Computing
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
In this paper we present new results on the performance of the Minimum Spanning Tree heuristic for the Minimum-Energy Broadcast Routing (MEBR) problem. We first prove that, for any number of dimensions d ≥ 2, the approximation ratio of the heuristic does not increase when the power attenuation coefficient α, that is the exponent to which the coverage distance must be raised to give the emission power, grows. Moreover, we show that, as a limit for α going to infinity, the ratio tends to the lower bound of [3, 15] given by the d-dimensional kissing number, thus closing the existing gap between the upper and the lower bound. We then introduce a new analysis allowing to establish a 7.6-approximation ratio for the 2-dimensional case, thus signifcantly decreasing the previously known 12 upper bound [15] (actually corrected to 12.15 in [10]). Starting from the above results, such an approximation holds for any α ≥ 2. Finally, we extend our analysis to any number of dimensions d ≥ 2 and any α ≥ d, obtaining a general approximation ratio of 3d-1, independent of α. The improvements of the approximation ratios are specifically significant in comparison with the lower bounds given by the kissing numbers, as these grow at least exponentially with respect to d. Note that for α ‹ d the ratios cannot be bounded by any function of α and d [3].