Improving the performance guarantee for approximate graph coloring
Journal of the ACM (JACM)
A faster approximation algorithm for the Steiner problem in graphs
Information Processing Letters
Distributed algorithms for multicast path setup in data networks
IEEE/ACM Transactions on Networking (TON)
Distributed algorithms for depth-first search
Information Processing Letters
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Approximation algorithms for directed Steiner problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Introduction to algorithms
Topology management for sensor networks: exploiting latency and density
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation algorithms for combinatorial problems
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Minimum-power multicast routing in static ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Power conservation and quality of surveillance in target tracking sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
A wireless sensor network For structural monitoring
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Approximating Optimal Multicast Trees in Wireless Multihop Networks
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Approximate Minimum-Energy Multicasting in Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Distributed algorithms for connected domination in wireless networks
Journal of Parallel and Distributed Computing
Data forwarding in extremely low duty-cycle sensor networks with unreliable communication links
Proceedings of the 5th international conference on Embedded networked sensor systems
Energy efficient multicast routing in ad hoc wireless networks
Computer Communications
Minimizing broadcast latency and redundancy in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Energy conservation in wireless sensor networks: A survey
Ad Hoc Networks
Dynamic Multiresolution Data Dissemination in Wireless Sensor Networks
IEEE Transactions on Mobile Computing
Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links
Proceedings of the 15th annual international conference on Mobile computing and networking
Minimum-energy all-to-all multicasting in wireless ad hoc networks
IEEE Transactions on Wireless Communications
Distributed Node Coloring in the SINR Model
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
IEEE/ACM Transactions on Networking (TON)
IEEE Transactions on Parallel and Distributed Systems
Simple distributed algorithms for approximating minimum steiner trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
IEEE Communications Magazine
Routing in intermittently connected sensor networks
ICNP '08 Proceedings of the 2008 IEEE International Conference on Network Protocols
oCast: Optimal multicast routing protocol for wireless sensor networks
ICNP '09 Proceedings of the 2009 17th IEEE International Conference on Network Protocols. ICNP 2009
Compressed data aggregation: energy-efficient and high-fidelity data collection
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
In duty-cycled wireless sensor networks, the nodes switch between active and dormant states, and each node may determine its active/dormant schedule independently. This complicates the Minimum-Energy Multicasting (MEM) problem, which was primarily studied in always-active wireless ad hoc networks. In this paper, we study the duty-cycle-aware MEM problem in wireless sensor networks both for one-to-many multicasting and for all-to-all multicasting. In the case of one-to-many multicasting, we present a formalization of the Minimum-Energy Multicast Tree Construction and Scheduling (MEMTCS) problem. We prove that the MEMTCS problem is NP-hard, and it is unlikely to have an approximation algorithm with a performance ratio of (1 - o(1)) In Δ, where Δ is the maximum node degree in a network. We propose a polynomial-time approximation algorithm for the MEMTCS problem with a performance ratio of O(H(Δ+1)), where H(ċ) is the harmonic number. In the case of all-to-all multicasting, we prove that the Minimum-Energy Multicast Backbone Construction and Scheduling (MEMBCS) problem is also NP-hard and present an approximation algorithm for it, which has the same approximation ratio as that of the proposed algorithm for the MEMTCS problem. We also provide a distributed implementation of our algorithms, as well as a simple but efficient collision-free scheduling scheme to avoid packet loss. Finally, we perform extensive simulations, and the results demonstrate that our algorithms significantly outperform other known algorithms in terms of the total transmission energy cost, without sacrificing much of the delay performance.