Algorithms for energy-efficient multicasting in static ad hoc wireless networks
Mobile Networks and Applications
Constructing minimum-energy broadcast trees in wireless ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
On Minimum-Energy Broadcasting in All-Wireless Networks
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
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
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Lookahead Expansion Algorithm for Minimum Power Multicasting in Wireless Ad Hoc Networks
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Improved PSOR algorithm for minimum power multicast tree problem in wireless ad hoc networks
International Journal of Sensor Networks
Energy efficient multicasting problem in wireless ad-hoc networks
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Minimum power multicasting in wireless networks under probabilistic node failures
Computational Optimization and Applications
3-D minimum energy broadcasting
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
We study minimum-energy broadcast routing in all-wireless networks. Up to now, a number of heuristics have been proposed for thisNP-hard problem. Among them, the broadcast incremental power (BIP) algorithm, presented by Wieselthier et al., is most known. The contribution of our work consists of a refinement of the BIP algorithm and a novel integer programming formulation. The refined version of BIP is a natural extension of the original algorithm. The integer programming formulation allows us to compute optimal broadcast trees for networks of small size. For large-sized networks, the formulation admits the computation of a sharp lower bound to the optimal tree. We are thus able to efficiently assess the numerical performance of any heuristic algorithm for the problem. In our computational study, we compare the performance of our refined BIP algorithm to that of its original version, and examine the numerical performance of the two algorithms in terms of optimality using our integer programming model.