Multicasting in Ad hoc networks using node transition probability based routing protocol

被引:0
|
作者
Radha, S
Shanmugavel, S
机构
[1] Sri Shivasubramaniya Nadar Coll, Dept ECE, Kalavakkam 603110, India
[2] Anna Univ, Sch ECE, Telemat Lab, Madras 600025, Tamil Nadu, India
关键词
NTPMR; multicasting; ODMRP; CAMP; GloMoSim;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Mobile Ad hoc Network is an autonomous system of mobile nodes characterized by wireless links. The central challenge in the design of ad hoc networks is the development of dynamic routing protocol that finds routes between mobile nodes. There are two types of data disseminations in a network, namely unicasting and multicasting. In this project, we deal with multicasting, which is a one to many data dissemination. Many multicast algorithms have already been proposed but the major drawback with these algorithms is the excessive control overhead associated with them. Here, we present a new algorithm called Node Transition Probability based Multicast Routing (NTPMR) for mobile ad hoc networks, which requires the lowest control overhead when compared with the existing multicast protocols. The performance of this algorithm is evaluated in terms of quantitative metrics such as control overhead and packet delivery ratio.
引用
收藏
页码:199 / 209
页数:11
相关论文
共 50 条
  • [1] Modified on-demand multicasting routing protocol for Ad Hoc networks
    Hudaib, Amjad
    Kaabneh, Khalid
    Qatawneh, Mohamad
    WSEAS Transactions on Information Science and Applications, 2009, 6 (02): : 147 - 158
  • [2] A core-based multicasting routing protocol in mobile ad-hoc networks
    Chung, Ping-Tsai
    WMSCI 2005: 9TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL 10, 2005, : 159 - 163
  • [3] Multicasting in ad hoc networks using NTP protocol
    Radha, S
    Shanmugavel, S
    Hemalatha, L
    Kavitha, S
    Lakshmi, T
    PROCEEDINGS OF THE ICCC 2002: 15TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION, VOLS 1 AND 2: REDEFINING INTERNET IN THE CONTEXT OF PERVASIVE COMPUTING, 2002, : 144 - 160
  • [4] An efficient routing protocol for mobile ad hoc networks with neighbor awareness and multicasting
    Pathan, ASK
    Alam, MM
    Monowar, MM
    Rabbi, MF
    E-TECH 2004, 2004, : 97 - 100
  • [5] A reliable multicasting protocol for ad hoc networks
    Wu, SY
    Bonnet, C
    5TH WORLD WIRELESS CONGRESS, PROCEEDINGS, 2004, : 78 - 82
  • [6] Escape probability based routing for ad hoc networks
    Zhang Xuanping
    Journal of Systems Engineering and Electronics, 2006, (04) : 927 - 930
  • [7] Probability Based Routing for Ad Hoc Networks in a Building
    Rohit, P. Eshwar
    Tapaswi, Shashikala
    Joshi, R. C.
    PROCEEDINGS OF THE 2008 16TH INTERNATIONAL CONFERENCE ON NETWORKS, 2008, : 84 - +
  • [8] Escape probability based routing for ad hoc networks
    Zhang, Xuanping
    Qin, Zheng
    Li, Xin
    Journal of Systems Engineering and Electronics, 2006, 17 (04) : 927 - 930
  • [9] An adaptive clustering routing transition protocol in ad hoc networks
    Jia, Xu
    Zhi, Li
    Qian-mu, Li
    Feng-yu, Liu
    COMPUTER COMMUNICATIONS, 2008, 31 (10) : 1952 - 1960
  • [10] Hybrid greedy/multicasting power-aware routing protocol in ad hoc networks
    Li, JG
    Cordes, D
    ITCC 2004: INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: CODING AND COMPUTING, VOL 2, PROCEEDINGS, 2004, : 725 - 729