CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
Reseach Article

Node-Disjoint On-demand Multipath Routing with Route Utilization in Ad-Hoc Networks

by Mona Gupta, Neeraj Kumar
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 70 - Number 9
Year of Publication: 2013
Authors: Mona Gupta, Neeraj Kumar
10.5120/11992-7872

Mona Gupta, Neeraj Kumar . Node-Disjoint On-demand Multipath Routing with Route Utilization in Ad-Hoc Networks. International Journal of Computer Applications. 70, 9 ( May 2013), 29-33. DOI=10.5120/11992-7872

@article{ 10.5120/11992-7872,
author = { Mona Gupta, Neeraj Kumar },
title = { Node-Disjoint On-demand Multipath Routing with Route Utilization in Ad-Hoc Networks },
journal = { International Journal of Computer Applications },
issue_date = { May 2013 },
volume = { 70 },
number = { 9 },
month = { May },
year = { 2013 },
issn = { 0975-8887 },
pages = { 29-33 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume70/number9/11992-7872/ },
doi = { 10.5120/11992-7872 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:32:26.982889+05:30
%A Mona Gupta
%A Neeraj Kumar
%T Node-Disjoint On-demand Multipath Routing with Route Utilization in Ad-Hoc Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 70
%N 9
%P 29-33
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Mobile Ad Hoc Network (MANET) is a dynamic wireless network without any pre-existing infrastructure and each node therefore operate in a self-organized and decentralized manner, acting as a router. Multipath routing in MANETis a challenging problem. In this paper, an attempt has been made to compare the accomplishment of conspicuous on-demand routing protocols for mobile ad hoc networks. There are many routing protocols such as ad hoc on demand distance vector routing (AODV), ad hoc on demand multipath distance vector protocol (AOMDV) that have been used. The constant change in network topology and the inherently unreliable available paths make the multipath routing difficult. The paper presents the node-disjoint multipath routing protocol that allows the establishment of multiple paths between the unique source and destination and thus improving end-to-end delay, routing overhead and packet delivery ratio. The path selection algorithm for MANET embraces the entropy metric in order to find the stability of route and obtain an optimum path.

References
  1. IETF Mobile Ad-hoc Networks (MANET) Working Group, http://www. ietf. org/
  2. Sun Baolin, Gui Chao, Zhang Qifei, Yan Bing, Liu Wei,"A Multipath on-Demand Routing with Path Selection Entropy for Ad Hoc Networks", Young Computer Scientists, 2008. ICYCS 2008.
  3. M. R. Pearlman, Z. J. Hass, P. Scholander, S. S. Tabrizi, "On the impact of alternate path routing for load balancing in mobile ad hoc networks," Proceedings of IEEE/ACM MobiHoc 2000, Boston, August 2000, pp. 3–10.
  4. C. E. Perkins, E. M. Royer, "Ad hoc On-Demand Distance Vector Routing (AODV)", IETF RFC 3561,003
  5. C. E. Perkins et al. : "Ad Hoc on Demand Distance Vector (AODV) Routing", RFC 3561, July. 2003.
  6. XiuliRen, HaibinYu,"A novel multipath disjoint routing to support ad hoc wireless sensor networks",Object and Component-Oriented Real-Time distributed Computing, 2006. ISORC 2006.
  7. M. Marina and S. Das, "On-demand Multipath Distance Vector Routing in Ad Hoc Networks", in Proceedings of the International Conference for Network Protocols (ICNP), Riverside, Nov. 2001.
  8. M. K. Marina and S. R. Das, "On-Demand Multipath Distance Vector Routing in Ad hoc Networks", In Proceedings of the Ninth International Conference on Network Protocols (ICNP), California, IEEE Computer Society Press, 11-14 Nov, 2001, pp. 14-23.
  9. M. K. Marina, S. R. Das, "On-demand multipath distance vector routing in ad hoc networks," Proceedings of the 9th IEEE International Conference on Network Protocols (ICNP), 2001, pp. 14–23.
  10. S. Motegi, K. Yoshihara, H. Horiuchi, "Proposal on Multipath Routing for Ad hoc Networks", IEIC Technical Report, 2002, 102(441): 51-56, IN2002-125, Nov. 2002 (in Japanese).
  11. S. Lee and M. Gerla, "Split multipath routing with maximally disjoint paths in ad hoc networks", Proceedings of the IEEE ICC, pp. 3201-3205, June 2001.
  12. L. Wang, Y. Shu, M. Dong, L. Zhang and O. Yang, "Adaptive Multipath Source Routing in Ad Hoc Networks", IEEE ICC 2001, Page(s): 867 -871 vol. 3, June 2001.
  13. Jing Fang, Bhuvaneswaran R. S. , Katayamal Yoshiaki, Takahashi Naohisa,"multipath routing selection strategies in wireless mobile ad hoc networks", Signal Processing, communications and Networking,ICSCN'07.
  14. A. Valera, W. Seah, and S. Rao, "Cooperative Packet Caching and Shortest Multipath Routing in Mobile Ad hoc Networks", INFOCOM 2003, San Francisco, CA, USA, 2003.
  15. Jiang Ming-Hong, Jan Rong-Hong, "An efficient multiple path routing protocol for ad hoc networks", Information Networking Proceedings/ICOIN,2001.
  16. R. Leung, J. Liu, E. Poon, A. Chan and B. Li, "MP-DSR: A QoS-Aware Multi-Path Dynamic Source Routing Protocol for Wireless Ad-Hoc Networks", In Proc. of the 26th IEEE Annual Conference on Local Computer Networks (LCN 2001), pp. 132-141, November, 2001
  17. T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, . Introduction to Algorithms. , The MIT Press ,2001.
  18. B. An, and S. Papavassiliou, "An Entropy-Based Model for Supporting and Evaluating Route Stability in Mobile Ad hoc Wireless Networks", IEEE Communications Letters, 2002, 6(8): 328-330.
  19. VahediShabnam, Mohseni Maryam, DarehshoorzadehAmir,"Design a multi-path routing algorithm in ad hoc networks in order to improve fault tolerance",Personal indoor and Mobile Radio Communications, PIMRC 2007.
Index Terms

Computer Science
Information Sciences

Keywords

MANET multipath routing on demand routing entropy