On-demand multicast routing protocol with efficient route discovery

被引：25
作者：
Kharraz, Mohammad-Amin [3 ,4 ]
Sarbazi-Azad, Hamid [2 ,3 ]
Zomaya, Albert Y. [1 ]
机构：
[1] Univ Sydney, Sch Informat Technol, Ctr Distributed & High Performance Comp, Sydney, NSW 2006, Australia
[2] Sharif Univ Technol, Dept Comp Engn, Tehran, Iran
[3] Inst Res Fundamental Sci IPM, Sch Comp Sci, Tehran, Iran
[4] Sharif Univ Technol Int Campus, Fac Sci & Technol, Tehran, Iran
来源：
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS | 2012年 / 35卷 / 03期
关键词：
Mobile Ad hoc networks; Routing protocol; Multicasting; Multicast mesh;
D O I：
10.1016/j.jnca.2011.03.012
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we introduce an efficient route discovery mechanism to enhance the performance and multicast efficiency of On-Demand Multicast Routing Protocol (ODMRP). Our framework, called limited flooding ODMRP, improves multicasting mechanism by efficiently managing flooding mechanism based on delay characteristics of the contributing nodes. In our model, only the nodes that satisfy the delay requirements can flood the Join-Query messages. We model the contributing nodes as M/M/1 queuing systems. Our framework considers the significant parameters in delay analysis, including random packet arrival, service process, and random channel access in the relying nodes, and exhibits its best performance results under high traffic load. Simulation results reveal that limited flooding ODMRP drastically reduces the packet overhead under various simulation scenarios as compared to original ODMRP. Crown Copyright (C) 2011 Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码：942 / 950
页数：9
相关论文
共 27 条
  • [1] Ahmad DT, 2005, MULTICASTING AD HOC
  • [2] Anwar Farhat, 2009, INT J COMPUTER SCI N, V9
  • [3] Asif NM, 2008, P 6 INT C ADV MOB CO
  • [4] Bisnik N, 2009, ELSEVIER AD HOC NETW, P7
  • [5] Draves R., 2004, ACM MOBICOM
  • [6] Garcia JJ, 1999, IEEE J SELECTED AREA, V17
  • [7] Lee M, 2001, P 15 INT C INF NETW
  • [8] Lee SJ, 2000, P 19 ANN JOINT C IEE
  • [9] Li H, 2009, P IEEE INFOCOM APR
  • [10] Oh SY, 2008, ELSEVIER J PARALLEL, P68
123