Journal of University of Chinese Academy of Sciences >
An adaptive-energy-threshold-based energy-efficient on-demand multicast routing protocol
Received date: 2013-04-19
Revised date: 2013-04-28
Online published: 2014-03-15
An adaptive-energy-threshold-based energy-efficient on-demand multicast routing protocol (EMRP) for wireless Ad Hoc and sensor networks is proposed to prolong the network lifetime. Based on the network energy status, EMRP adaptively calculates an energy threshold which protects the nodes with low remaining energy by discouraging their engagement in multicast tree. Further, it adopts destination-driven strategy to efficiently reduce the multicast tree size to save the energy for a multicast task. EMRP does not require nodes to keep global or local network state information. It has low overheads and is easy to implement. Simulation results show that EMRP greatly reduces the energy cost for per-packet delivery and prolongs the network lifetime.
DUAN Guojian , HAO Jie , YAO Zheng , ZHANG Baoxian . An adaptive-energy-threshold-based energy-efficient on-demand multicast routing protocol[J]. Journal of University of Chinese Academy of Sciences, 2014 , 31(2) : 276 -283 . DOI: 10.7523/jssn.2095-6134.2014.02.019
[1] Ruiz P M, Gomez-Skarmeta A F. Approximating optimal multicast trees in wireless multihop networks[C]//10th IEEE Symposium on Computers and Communications (ISCC). Murcia, Cartagena, Spain: IEEE Computer Society, 2005: 686-691.
[2] Robins G, Zelikovsky A. Improved Steiner tree approximation in graphs[C]//11th ACM-SIAM Symposium on Discrete Algorithms (SODA). San Francisco, CA, USA:ACM/SIAM, 2000: 770-779.
[3] Takahashi H, Matsuyama A. An approximate solution for the Steiner problem in graphs[J]. Mathematica Japonica, 1980, 24: 573-577.
[4] Cheng M X, Sun J, Min M, et al. Energy-efficient broadcast and multicast routing in ad hoc wireless networks[C]//IEEE International Performance, Computing, and Communications Conference (IPCCC). San Diego, California, USA: IEEE, 2003: 87-94.
[5] Wang B, Gupta S K S. On maximizing lifetime of multicast trees in wireless ad hoc networks[C]//International Conference on Parallel Processing (ICPP). Kaohsiung, Taiwan: IEEE Computer Society, 2003: 333-340.
[6] Georgiadis L. Bottleneck multicast trees in linear time[J]. IEEE Communications Letters, 2003, 7: 564-566.
[7] Wieselthier J E, Nguyen G D, Ephremides A. On the construction of energy-efficient broadcast and multicast trees in wireless networks[C]//International Conference on Computer Communications (INFOCOM). Tel Aviv, Israel: IEEE, 2000, 2: 585-594.
[8] Wieselthier J E, Nguyen G D, Ephremides A. Algorithms for energy-efficient multicasting in static ad hoc wireless networks[J]. Mobile Networks and Applications, 2001, 6: 251-263.
[9] Wieselthier J E, Nguyen G D, Ephremides A. Energy-efficient broadcast and multicast trees in wireless networks[J]. Mobile Networks and Applications, 2002, 7: 481-492.
[10] Wieselthier J E, Nguyen G D, Ephremides A. Resource management in energy-limited, bandwidth-limited, transceiver-limited wireless networks for session-based multicasting[J]. Computer Networks, 2002, 39: 113-131.
[11] Royer E M, Perkins C E. Multicast operation of the ad-hoc on-demand distance vector routing protocol[C]//International Conference on Mobile Computing and Networking (MOBICOM). Seattle, Washington, USA:ACM, 1999: 207-218.
[12] Lee S, Su W, Gerla M. On-demand multicast routing protocol in multihop wireless mobile networks[J]. Mobile Networks and Applications, 2002, 7:441-453.
[13] Tian K, Zhang B X, Mouftah H T, et al. Destination-driven on-demand multicast routing protocol for wireless Ad Hoc networks[C]//IEEE International Conference on Communications (ICC). Dresden, Germany: IEEE, 2009: 1-5.
[14] Shaikh A, Shin K. Destination-driven routing for low-cost mul-ticast[J]. IEEE Journal on Selected Areas in Communications, 1997, 15: 373-381.
[15] Zhang B X, Mouftah H T. Destination-driven shortest path tree algorithms[J]. Journal of High Speed Networks, 2006, 15: 123-130.
[16] Zhang B X, Mouftah H T. Energy-aware on-demand routing protocols for wireless ad hoc networks[J]. Wireless Networks, 2006, 12: 481-494.
/
| 〈 |
|
〉 |