Node Disjoint Multipath Routing Approach for Controlling Congestion in MANETs

1
Mr. Gaurav Deshmukh
Mr. Gaurav Deshmukh
2
Dr. Abhishek Bande
Dr. Abhishek Bande
1 to 2 University of Pune, Pune, Maharashtra India.

Send Message

To: Author

GJCST Volume 12 Issue E17

Article Fingerprint

ReserarchID

CSTNWS1C68D

Node Disjoint Multipath Routing Approach for Controlling Congestion in MANETs Banner
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Node-disjoint routing becomes inessential technique in communication of packets among various nodes in networks. Meanwhile AODV (Ad Hoc On-demand Multipath Distance Vector) creates single-path route between a pair of source and destination nodes. Some researches has done so far to make multipath node-disjoint routing based on AODV protocol. But however their overhead and end-to-end delay are relatively high, while the detail of their code is not available too. In an ad hoc network, identification of all node-disjoint paths between a given pair of nodes is a challenging task. The phenomena that a protocol is not able to identify all node-disjoint paths that exist between a given pair of nodes is called path diminution. In this paper, we discuss that path diminution is unavoidable when a protocol discovers multiple node-disjoint paths in a single route discovery and working of node disjoint multipath protocol.

14 Cites in Articles

References

  1. W Cheng,A Teymorian,L Ma,X Cheng,X Lu,Z Lu (2008). Underwater Localization in Sparse 3D Acoustic Sensor Networks.
  2. D Goldenberg,A Krishnamurthy,W Maness,Y Yang,A Young,A Morse,A Savvides,B Anderson (2005). Network localization in partially localizable networks.
  3. David Johnson,David Maltz (1996). Dynamic Source Routing in Ad Hoc Wireless Networks.
  4. S.-J Lee,M Gerla (2001). Split multipath routing with maximally disjoint paths in ad hoc networks.
  5. S Li,Z Wu (2005). Node-disjoint parallel multipath routing in wireless sensor networks.
  6. C Perkins,E Royer (2003). Ad hoc On-Demand Distance Vector Routing (AODV).
  7. Z Hass,R Pearlmann (1999). Zone routing Protocol.
  8. S Chen,K Nahrstedt (1998). An Overview of Quality-of-Service Routing for the next Generation High -Speed Networks: Problems and Solutions.
  9. M Marina,S Das (2001). On-demand multipath distance vector routing in ad hoc networks.
  10. X Hong,K Xu,M Gerla (2002). Scalable Routing Protocols for Mobile Ad Hoc Networks.
  11. L Blazevic,S Giordano,J Boudec (2002). Self Organized Terminode Routing.
  12. Y Ge,G Wang,Q Zhang,M Guo (2009). Multipath Routing with Reliable Nodes in Large-Scale Mobile Ad-Hoc Networks.
  13. M Toussaint Multipath Routing in Mobile Ad Hoc Networks.
  14. Chang-Woo Ahn,Sang-Hwa Chung,Tae-Hun Kim,Su-Young Kang (2010). A Node-Disjoint Multipath Routing Protocol Based on AODV in Mobile Ad Hoc Networks.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

Mr. Gaurav Deshmukh. 2013. \u201cNode Disjoint Multipath Routing Approach for Controlling Congestion in MANETs\u201d. Global Journal of Computer Science and Technology - E: Network, Web & Security GJCST-E Volume 12 (GJCST Volume 12 Issue E17): .

Download Citation

Issue Cover
GJCST Volume 12 Issue E17
Pg. 39- 45
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Classification
Not Found
Version of record

v1.2

Issue date

January 5, 2013

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 10186
Total Downloads: 2522
2026 Trends
Research Identity (RIN)
Related Research

Published Article

Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Node-disjoint routing becomes inessential technique in communication of packets among various nodes in networks. Meanwhile AODV (Ad Hoc On-demand Multipath Distance Vector) creates single-path route between a pair of source and destination nodes. Some researches has done so far to make multipath node-disjoint routing based on AODV protocol. But however their overhead and end-to-end delay are relatively high, while the detail of their code is not available too. In an ad hoc network, identification of all node-disjoint paths between a given pair of nodes is a challenging task. The phenomena that a protocol is not able to identify all node-disjoint paths that exist between a given pair of nodes is called path diminution. In this paper, we discuss that path diminution is unavoidable when a protocol discovers multiple node-disjoint paths in a single route discovery and working of node disjoint multipath protocol.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]
×

This Page is Under Development

We are currently updating this article page for a better experience.

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Node Disjoint Multipath Routing Approach for Controlling Congestion in MANETs

Dr. Abhishek Bande
Dr. Abhishek Bande University of Pune, Pune, Maharashtra India.
Mr. Gaurav Deshmukh
Mr. Gaurav Deshmukh University of Pune, Pune, Maharashtra India.

Research Journals