A nearly best-possible approximation algorithm for node-weighted Steiner trees
Journal of Algorithms
Approximation algorithms
Minimum energy paths for reliable communication in multi-hop wireless networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
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)
Energy-efficient multihop reprogramming for sensor networks
ACM Transactions on Sensor Networks (TOSN)
Reliable and Energy-Efficient Routing for Static Wireless Ad Hoc Networks with Unreliable Links
IEEE Transactions on Parallel and Distributed Systems
Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links
Proceedings of the 15th annual international conference on Mobile computing and networking
IEEE Transactions on Wireless Communications
Reprogramming wireless sensor networks: challenges and approaches
IEEE Network: The Magazine of Global Internetworking
oCast: Optimal multicast routing protocol for wireless sensor networks
ICNP '09 Proceedings of the 2009 17th IEEE International Conference on Network Protocols. ICNP 2009
Hi-index | 0.00 |
Because data dissemination is crucial to Wireless Sensor Networks (WSNs), its energy-efficiency and reliability are of paramount importance. While achieving these two goals together is highly non-trivial, the situation is exacerbated if WSN nodes are duty-cycled (DC) and their transmission power is adjustable. In this paper, we study the problem of minimizing the expected total transmission power for reliable data dissemination (multicast/broadcast) in DC-WSNs. Due to the NP-hardness of the problem, we design efficient approximation algorithms with provable performance bounds for it.