C-AODV : Routing Protocol for Tunnel's Network

The tunnel is a subway where the people travel by train for long distance. The likely scenario for the people could be the absence of communication over the network while crossing the tunnel. The network which is exclusively for those tunnel travelers, has been highly indispensable. The discrimination based on locality of the members may form the crew and the data transmission could be possible through radio waves. To ensure that tentative and dynamic tunnel’s network one should take clustering and mobility prediction into consideration for the efficient communication over the ad hoc scenario. The focus of this paper is to bring out the supportive point of view to accept C-AODV as a suitable protocol for the tunnel’s network which has been built on top of clustered nodes.

[1]  Gary Scott Malkin,et al.  Distance-vector routing , 1995 .

[2]  Hassan Artail,et al.  A cluster-based trust-aware routing protocol for mobile ad hoc networks , 2010, Wirel. Networks.

[3]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[4]  M. Jiang,et al.  Cluster based routing protocol (CBRP) , 1999 .

[5]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[6]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .

[7]  Noufissa Mikou,et al.  Clustering Algorithm for MANETs based on mobility prediction , 2005 .

[8]  Sung-Ju Lee,et al.  Mobility prediction in wireless networks , 2000, MILCOM 2000 Proceedings. 21st Century Military Communications. Architectures and Technologies for Information Superiority (Cat. No.00CH37155).

[9]  S. Thirumurugan Direct Sequenced C-IAODV Routing Protocol , 2010 .

[10]  Deepali P. Chaudhari,et al.  International Journal of Computer Science and Technology 179 , .