Duty-cycle-aware minimum-energy multicasting in wireless sensor networks

IEEE/ACM Transactions on Networking

Volumn 21, Issue 3, 2013, Pages 910-923

  Han, Kai ^a,b   Liu, Yang ^c   Luo, Jun ^d  

^a ZHONGYUAN UNIVERSITY OF TECHNOLOGY   (China)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c HENAN UNIVERSITY OF TECHNOLOGY   (China)

^d NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Approximation algorithm; duty cyle aware; minimum energy; multicasting; wireless sensor networks (WSNs)

Indexed keywords

APPROXIMATION RATIOS; DISTRIBUTED IMPLEMENTATION; DUTY-CYLE-AWARE; EXTENSIVE SIMULATIONS; MINIMUM ENERGY; MINIMUM-ENERGY MULTICAST; POLYNOMIAL-TIME APPROXIMATION ALGORITHMS; WIRELESS SENSOR NETWORK (WSNS);

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; SCHEDULING; SENSOR NODES; WIRELESS AD HOC NETWORKS;

MULTICASTING;

EID: 84879150171     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2012.2212452     Document Type: Article

References (38)

1. G. Anastasi, M. Conti, M. D. Francesco, and A. Passarella, "Energy conservation in wireless sensor networks: A survey, " Ad Hoc Netw., vol. 7, no. 3, pp. 537-568, 2009.
2. Y. Gu and T. He, "Data forwarding in extremely low duty-cycle sensor networks with unreliable communication links, " in Proc. ACM SenSys, 2007, pp. 321-334.
3. J. Hong, J. Cao, W. Li, S. Lu, and D. Chen, "Minimum-transmission broadcast in uncoordinated duty-cycled wireless ad hoc networks, " IEEE Trans. Veh. Technol., vol. 59, no. 1, pp. 307-318, Jan. 2010.
4. S. Guo, Y. Gu, B. Jiang, and T. He, "Opportunistic flooding in lowduty-cycle wireless sensor networks with unreliable links, " in Proc. ACM MobiCom, 2009, pp. 133-144.
5. L. Su, B. Ding, Y. Yang, T. F. Abdelzaher, G. Cao, and J. C. Hou, "oCast: Optimal multicast routing protocol for wireless sensor networks, " in Proc. IEEE ICNP, 2009, pp. 151-160.
6. C. Gui and P. Mohapatra, "Power conservation and quality of surveillance in target tracking sensor networks, " in Proc. ACM MobiCom, 2004, pp. 129-143.
7. N. Xu, S. Rangwala, K. K. Chintalapudi, D. Ganesan, A. Broad, R. Govindan, and D. Estrin, "A wireless sensor network for structural monitoring, " in Proc. ACM SenSys, 2004, pp. 13-24.
8. I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "A survey on sensor networks, " IEEE Commun. Mag., vol. 40, no. 8, pp. 102-114, Aug. 2002.
9. G. Xing, M. Li, H. Luo, and X. Jia, "Dynamic multiresolution data dissemination in wireless sensor networks, " IEEE Trans. Mobile Comput., vol. 8, no. 9, pp. 1205-1220, Sep. 2009.
10. D. Li, Q. Liu, X. Hu, and X. Jia, "Energy efficient multicast routing in ad hoc wireless networks, " Comput. Commun., vol. 30, no. 18, pp. 3746-3756, 2007.
11. W. Liang, "Approximate minimum-energy multicasting in wireless ad hoc networks, " IEEE Trans. Mobile Comput., vol. 5, no. 4, pp. 377-387, Apr. 2006.
12. W. Liang, R. Brent, Y. Xu, and Q. Wang, "Minimum-energy all-to-all multicasting in wireless ad hoc networks, " IEEE Trans. Wireless Commun., vol. 8, no. 11, pp. 5490-5499, Nov. 2009.
13. P.-J. Wan, G. Calinescu, and C.-W. Yi, "Minimum-power multicast routing in static ad hoc wireless networks, " IEEE/ACM Trans. Netw., vol. 12, no. 3, pp. 507-514, Jun. 2004.
14. M. Charikar, C. Chekuri, T.-Y. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, "Approximation algorithms for directed Steiner problems, " in Proc. ACM-SIAM SODA, 1998, pp. 192-200.
15. L. Su, C. Liu, H. Song, and G. Cao, "Routing in intermittently connected sensor networks, " in Proc. IEEE ICNP, 2008, pp. 278-287.
16. J. Luo, P. Eugster, and J.-P. Hubaux, "Route driven gossip: Probabilistic reliable multicast in ad hoc networks, " in Proc. 22nd IEEE INFOCOM, 2003, pp. 2229-2239.
17. J. Luo, P. Eugster, and J.-P. Hubaux, "Probabilistic reliable multicast in ad hoc networks, " Ad Hoc Netw., vol. 2, no. 4, pp. 369-386, 2004.
18. C. Schurgers, V. Tsiatsis, S. Ganeriwal, and M. Srivastava, "Topology management for sensor networks: Exploiting latency and density, " in Proc. ACM MobiHoc, 2002, pp. 135-145.
19. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
20. G. Ausiello, A. D'Atri, and M. Protasi, "Structure preserving reductions among convex optimization problems, " J. Comput. Syst. Sci., vol. 21, no. 1, pp. 136-153, 1980.
21. U. Feige, "A threshold of for approximating set cover, " J. ACM, vol. 45, pp. 634-652, Jul. 1998.
22. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. Cambridge, MA: MIT Press & McGraw-Hill, 2001.
23. K. Mehlhorn, "A faster approximation algorithm for the Steiner problem in graphs, " Inf. Process. Lett., vol. 27, no. 3, pp. 125-128, 1988.
24. F. Bauer and A. Varma, "Distributed algorithms for multicast path setup in data networks, " IEEE/ACM Trans. Netw., vol. 4, no. 2, pp. 181-191, Apr. 1996.
25. P. Chalermsook and J. Fakcharoenphol, "Simple distributed algorithms for approximating minimum steiner trees, " in Proc. COCOON, 2005, pp. 380-389.
26. S. A. M. Makki and G. Havas, "Distributed algorithms for depth-first search, " Inf. Process. Lett., vol. 60, no. 1, pp. 7-12, 1996.
27. A. Wigderson, "Improving the performance guarantee for approximate graph coloring, " J. ACM, vol. 30, no. 4, pp. 729-735, 1983.
28. R. Gandhi and S. Parthasarathy, "Distributed algorithms for connected domination in wireless networks, " J. Parallel Distrib. Comput., vol. 67, no. 7, pp. 848-862, 2007.
29. B. Derbel and E. Talbi, "Distributed node coloring in the SINR model, " in Proc. IEEE ICDCS, 2010, pp. 708-717.
30. P. M. Ruiz and A. F. Gomez-Skarmeta, "Approximating optimal multicast trees in wireless multihop networks, " in Proc. ISCC, 2005, pp. 686-691.
31. P. M. Ruiz and I. Stojmenovic, , T. F. Gonzalez, Ed., "Cost-efficient multicast routing in ad hoc and sensor networks, " in Handbook on Approximation Algorithms and Metaheuristics. London, U. K. : Chapman & Hall/CRC, 2007, pp. 65-1.
32. L. Kou, G. Markowsky, and L. Berman, "A fast algorithm for Steiner trees, " Acta Informatica, vol. 15, pp. 141-145, 1981.
33. D. S. Johnson, "Approximation algorithms for combinatorial problems, " in Proc. ACM STOC, 1973, pp. 38-49.
34. R. Gandhi, A. Mishra, and S. Parthasarathy, "Minimizing broadcast latency and redundancy in ad hoc networks, " IEEE/ACM Trans. Netw., vol. 16, no. 4, pp. 840-851, Aug. 2008.
35. J. Luo and J.-P. Hubaux, "Joint sink mobility and routing to increase the lifetime ofwireless sensor networks: The case of constrainedmobility, " IEEE/ACM Trans. Netw., vol. 18, no. 3, pp. 871-884, Jun. 2010.
36. L. Xiang, J. Luo, and A. Vasilakos, "Compressed data aggregation for energy efficient wireless sensor networks, " in Proc. 8th IEEE SECON, 2011, pp. 46-54.
37. H. Jiang, S. Jin, and C. Wang, "Prediction or not? An energy-efficient framework for clustering-based data collection in wireless sensor networks, " IEEE Trans. Parallel Distrib. Syst., vol. 22, no. 6, pp. 1064-1071, Jun. 2011.
38. K. Han, L. Xiang, J. Luo, and Y. Liu, "Minimum-energy connected coverage in wireless sensor networks with omni-directional and directional features, " in Proc. ACM MobiHoc, 2012, pp. 85-94.