An Efficient Multi path Dynamic Routing Protocol for Computing and Constrained Mobile Ad-hoc Network Environment
Keywords:
multi-path, 3D network, dynamic routing, packet segmentation, and reassembly
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.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2013-03-15
Issue
Section
License
Copyright (c) 2013 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.