PERFORMANCE ANALYSIS OF ROUTING ALGORITHMS IN MESH TOPOLOGY
Main Article Content
Abstract
This work implements an improved XY routing protocol for analyzing the performance of wireless mesh topology. The wireless mesh topology has become a popular interconnection architecture for constructing massively parallel multi-processors. The examined partially adaptive XY routing algorithms for different network sizes based on 2-D wireless mesh topology. But it has a routing problem such as highest priority of QUEUE, more number of retransmission and takes delay time to receive the packet. So there is a need for novel system to overcome the drawbacks of deadlock.
The additional implements both odd even turn model and delay tolerant model. It makes message routing very minimal. In additionally, this comparison results in a smaller fluctuation of the network performance with respect to different traffic patterns. In addition, the node failure scenario is also considered so that if the path contains that node, then new alternate path from the failure node to the destination is recalculated or taken from cache if previous path information is stored. The result comparative shows that the Odd-Even Turn XY routing algorithm for best measuring of node throughput, average latency, average extra delay, efficiency, and packet lost and network throughput.
Â
Downloads
Article Details
COPYRIGHT
Submission of a manuscript implies: that the work described has not been published before, that it is not under consideration for publication elsewhere; that if and when the manuscript is accepted for publication, the authors agree to automatic transfer of the copyright to the publisher.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work
- The journal allows the author(s) to retain publishing rights without restrictions.
- The journal allows the author(s) to hold the copyright without restrictions.
References
E. Dahlman, S. Parkvall, and J. Sko ¨ ld, 4G LTE/LTE-Advanced for Mobile Broadband. Academic, 2015.
L. Nuaymi, WiMAX: Technology for Broadband Wireless Access. John Wiley & Sons, 2017.
K. Fall, “A Delay-Tolerant Network Architecture for Challenged Internets,†Proc. ACM Special Interest Group on Data Comm., 2013.
A. Petkova, K.A. Hua, and S. Koompairojn, “Processing Approximate Rank Queries in a Wireless Mobile Sensor Environment,†Proc. 11th Int’l Conf. Mobile Data Management (MDM), 2013.
“Quadrocopter LLC,†http://quadrocopter.us/, 2013.
R. Roy, Handbook of Mobility Models and Mobile Ad Hoc Networks. Springer, 2011.
Y.-C. Chen, E. Rosensweig, J. Kurose, and D. Towsley, “Group Detection in Mobility Traces,†Proc. Sixth Int’l Wireless Comm. And Mobile Computing Conf. (IWCMC ’10), 2010.
T. Camp, J. Boleng, and V. Davies, “A Survey of Mobility Models for Ad Hoc Network Research,†Wireless Comm. and Mobile Computing, vol. 2, no. 5, pp. 483-502, 2012.
X. Hong, M. Gerla, G. Pei, and C. Chiang, “A Group Mobility Model for Ad Hoc Wireless Networks,†Proc. Second ACM Int’l Workshop Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM ’15), 2015.
K. Blakely and B. Lowekamp, “A Structured Group Mobility Model for the Simulation of Mobile Ad Hoc Networks,†Proc. Second Int’l Workshop Mobility Management & Wireless Access Protocols (MobiWac), 2014.
R.V. Boppana and S. Chalasani, ªA Comparison of Adaptive Wormhole Routing Algorithms,Proc. Int'l Symp. ComputerArchitecture,pp. 351-360, May 2013.
C.J. Glass and L.M. Ni, ªMaximally Fully Adaptive Routing in 2D Meshes,Proc. 1992 Int'l Conf. Parallel Processing,pp. 101-104,2015.
I.F. Akyildiz, X. Wang, and W. Wang, “Wireless Mesh Networks: A Survey,†Computer Networks, vol. 47, no. 4, pp. 445-487, 2015.
R. Draves, J. Padhye, and B. Zill, “Comparison of Routing Metrics for Static Multi-Hop Wireless Networks,†Proc. ACM SIGCOMM, 2014.
R. Draves, J. Padhye, and B. Zill, “Routing in Multi-Radio, Multi- Hop Wireless Mesh Networks,†Proc. ACM MobiCom, 2014.
A. Raniwala and T.-C. Chiueh, “Architecture and Algorithms for an IEEE 802.11-Based Multi-Channel Wireless Mesh Network,†Proc. IEEE INFOCOM, 2015.
M. Alicherry, R. Bhatia, and L.E. Li, “Joint Channel Assignment and Routing for Throughput Optimization in Multi-Radio Wire-less Mesh Networks,†Proc. ACM MobiCom, 2015.