收稿日期: 2013-04-19
修回日期: 2013-04-28
网络出版日期: 2014-03-15
基金资助
国家自然科学基金（61101133，61173158）和国家科技重大专项（2010ZX03006-001-02）资助
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
提出一种面向无线Ad Hoc与传感器网络的基于自适应能量阈值的按需节能组播路由协议EMRP. 该协议能根据网络能量状态和节点保护比例，自适应地确定能量保护阈值. 在按需构造组播路由树的过程中，该阈值抑制网络中能量过低的节点参与组播，从而实现网络能耗均衡. EMRP同时引入目标驱动的策略，以尽量减小组播结构的规模、降低组播代价. EMRP协议执行过程中，不要求节点保存任何全局或局部网络拓扑信息，开销低，实现简单. 仿真结果表明，与已有工作相比，EMRP协议能大大降低组播路由的每分组传输能耗，显著延长网络寿命.
关键词： 无线Ad Hoc与传感器网络; 节能组播; 能量阈值; 目标驱动; 按需组播路由
段国建 , 郝洁 , 姚郑 , 张宝贤 . 基于自适应能量阈值的按需节能组播路由协议[J]. 中国科学院大学学报, 2014 , 31(2) : 276 -283 . DOI: 10.7523/jssn.2095-6134.2014.02.019
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.
[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.
/
| 〈 |
|
〉 |
