An Efficient Multi path Dynamic Routing Protocol for Computing and Constrained Mobile Ad-hoc Network Environment

Send Message

To: Author

An Efficient Multi path Dynamic Routing Protocol for Computing and Constrained Mobile Ad-hoc Network Environment

Article Fingerprint

ReserarchID

CST5027G

An Efficient Multi path Dynamic Routing Protocol for Computing and Constrained Mobile Ad-hoc Network Environment Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • 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
Font Type
Font Size
Font Size
Bedground

Abstract

Wireless mobile ad-hoc networks are classified as ad-hoc networks with logical connections. These types of networks do not have fixed topology (or physical connections) due to the mobility property of nodes, interference, propagation and loss of path. Because of all these problems the path established between sources to destination is not reliable and efficient path. Hence a dynamic source routing protocol is required for these networks to working properly. Data transfer using this protocol based on shorted path, all packets need to be transferred using same path. The researcher on MANET proposed many Routing algorithms to this task. The main idea of this paper is to study, understand, and analyze the problems with existing routing methods. In the proposed multi path dynamic routing, first identify multi paths exist between source to destination and select best shortest path and then data is segmented into packets, each packet is transferred to receiver using selected best shortest path. At receiver end received data need to be rearranged. Finally the performance proposed system is compared with existing methods and proposed method shows better performance when compared with existing methods.

References

15 Cites in Article
  1. S Douglas,Daniel De Couto,John Aguayo,Robert Bicket,Morris (2005). A high-throughput path metric for multi-hop wireless routing.
  2. Kemal Akkaya,Mohamed Younis (2005). A survey on routing protocols for wireless sensor networks.
  3. Marco Karimseada,Ahmed Zuniga,Bhaskarkrishnamachari Helmy (2004). Energy-efficient forwarding strategies for geographic routing in lossy wireless sensor networks.
  4. Ivan Stojmenovic,D Anandprakashruhil (2003). Voronoi diagram and convex hull based geocasting and routing in wireless networks.
  5. C De Morais Cordeiro,H Gossain,D Agrawal (2003). Multicast over wireless mobile ad hoc networks: present and future directions.
  6. A Rao,S Rathasamy,C Papadimitriou,S Shenker,I Stoica (2003). Geographic routing without location information.
  7. Marc Heissenbüttel,Torsten Braun,Thomas Bernoulli,Markus Wälchli (2003). BLR: beacon-less routing algorithm for mobile ad hoc networks.
  8. Fabian Kuhn,Rogert Wattenhofer,Aaron Zollinger (2003). Worst-Case optimal and average-case efficient geometric ad-hoc routing.
  9. Fabian Kuhn,Rogert Wattenhofer,Yan Zhang,Aaron Zollinger (2003). Geometric ad-hoc routing.
  10. Xu Lin,Ivan Stojmenovic (2003). Location-based localized alternate, disjoint and multi-path routing algorithms for wireless networks.
  11. M Kwon,S Fahmy (2002). Topology-Aware Overlay Networks for Group Communication.
  12. Jie Wu,Fei Dai,Ming Gao,Ivan Stojmenovic (2002). On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks.
  13. Charles Perkins,Pravinbhagwat (1994). Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers.
  14. Radia Perlman (1992). Interconnections: Bridges and Routers.
  15. Wen Xu,Jennifer Rexford (2006). MIRO.

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.

How to Cite This Article

Dr. Giri, Zabi K, Dr. Shashidhara. 2013. "An Efficient Multi path Dynamic Routing Protocol for Computing and Constrained Mobile Ad-hoc Network Environment". Global Journal of Computer Science and Technology, Global Journal of Computer Science and Technology - E: Network, Web & Security GJCST-E Volume 13 (GJCST Volume 13 Issue E5).

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-E Classification C.2.2
Version of record

v1.2

Issue date
April 22, 2013

Language
English
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 2.5K
Total Downloads: 223
All Trends

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

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.

An Efficient Multi path Dynamic Routing Protocol for Computing and Constrained Mobile Ad-hoc Network Environment

Dr. Giri
Dr. Giri
Zabi K
Zabi K
Dr. Shashidhara
Dr. Shashidhara