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
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
Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
Minimum-power multicast routing in static ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Energy-aware multicasting in wireless ad hoc networks: A survey and discussion
Computer Communications
Energy efficient multicast routing in ad hoc wireless networks
Computer Communications
E-PULRP: energy optimized path unaware layered routing protocol for underwater sensor networks
IEEE Transactions on Wireless Communications
Approximation algorithms for multicast routing in ad hoc wireless networks
Journal of Combinatorial Optimization
Hi-index | 0.00 |
In this paper, we study the minimum energy multicast problem with reception cost in wireless sensor networks. Suppose there are n nodes in the network. Each node v has l(v) transmission power levels to be chosen and its reception cost is B(v) if it receives a message. The problem of our concerning is: given a multicast request, how to find a multicast tree such that the total energy cost of the multicast tree including transmitting cost and reception cost is minimized. We firstly propose a general algorithm Fix-MEM-R-G for the case while each node has the fixed power level. Based on Fix-MEM-R-G algorithm, we propose an approximation algorithm. We also propose a heuristic algorithm for this special case. For the general case that each node has multiple power levels, we propose a general algorithm NF-MEM-R-G and an approximation algorithm based on NF-MEM-R-G algorithm. We also propose a heuristic algorithm for general case.