Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A faster algorithm for finding the minimum cut in a directed graph
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Tabu Search
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Energy-efficient broadcast and multicast trees in wireless networks
Mobile Networks and Applications
Internal Nodes based Broadcasting in Wireless Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
Solving Minimum Power Broadcast Problem in Wireless Ad-Hoc Networks Using Genetic Algorithm
CNSR '08 Proceedings of the Communication Networks and Services Research Conference
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
| Hi-index | 0.00 |
This paper studies the minimum-energy broadcasting problem (MEBP) in wireless sensor networks. The aim of the MEBP is to determine the power assignment of each node in a wireless sensor network such that a specified source node can broadcast messages to each of the other nodes and the total energy consumption is minimized. We first present a new formulation involving an exponential number of constraints for the broadcasting requirement. We then prove that under a mild condition, these constraints for the broadcasting requirement are facet defining. Directly using the proposed formulation, we further present a new branch-and-cut (B&C) solution approach to optimally solve the MEBP. We propose three ways to identify violated cuts at each node in the enumeration tree. Finally, we test the proposed B&C approach on 1,000 randomly generated instances with different properties and compare it with other alternative methods in the literature. Computational results demonstrate the effectiveness and efficiency of our approach using the proposed formulation for instances with up to 100 nodes.