A STATE-OF-THE-ART: AN OPTIMAL PATH ALGORITHM FOR MOBILE AD HOC NETWORK (MANET) AND WIRELESS AD HOC NETWORK (WANET)
DOI:
https://doi.org/10.61841/qcz5ee80Keywords:
checksum, encryption, ; particle swarm optimization;, genetic algorithm; multiobjective optimization;MANET;, Destination Sequenced Distance Vector (DSDV) protocol,, Distance Vector (DV) protocol and Fisheye State Routing (FSR) protocol;, newton network probabilistic approach, proactive, reactive and hybrid protocols;WANET.Abstract
This paper deals with different evolutionary methods, provided to fix the best optimized routes for data communication for peer to peer in mobile communication networks. This differential approach for global multi-objective network simulation, in regards to perform with publishing the prime affordable path in mobile networks. This prototype holds the affordable cost to go for the minimal cost for the path. We studied the way of minimizing a grand total of all convex objective functions, where the attributes of the objective functions are available to different nodes of a cellular network and the cellular nodes are allowed to only communicate with their nearest neighbors. The multiobjective optimization algorithm is applied as a diagnosis toolfor checksum based encryption indata transmission.In the end test results passed by proposed algorithm fulfills the genuineness, in regards to traditional algorithms such as Particle Swarm Optimization and Genetic Algorithm.
Downloads
References
1. Storn R, Price K., “Differentia evolution- a simple and efficient adaptive scheme for global optimization over continuous spaces, 1995; Technical Report TR-95-012. ICSI.
2. H. Yetgin, K.T. K. Cheung, and L. Hanzo, “Multi-objective routing optimization using evolutionary algorithms,” in Proceeding of the IEEE Wireless Communication and Networking Conference (WCNC’ 12), pp. 3030-3034, IEEE, Shanghai, China, April 2012.
3. Stephen Gundry, Jianmin Zou, Janusz Kusyk, Cem Safak Sahin and M.Umit Uyar, Markov chain model for differential based topology control in MANETs. Sarnoff Symposium (SARNOFF), 2012 35th IEEE
4. Stephen Gundry, Jianmin Zou, Janusz Kusyk, M. Umit Uyar , Cem Safak Sahin and, Fault tolerance bio- inspired topology control mechanism for autonomous mobile node distribution in MANETS, MILITARY COMMUNICATIONS CONFERENCE, 2012 - MILCOM 2012.
5. Stephen Gundry, Janusz Kusyk, Jianmin Zou, Cem Safak Sahin and M.Umit Uyar, Differential Evolution based fault tolerant topology control in MANETs. Military Communications Conference, MILCOM 2013 – 2013 IEEE.
6. U.K. Chakraborty, S. K. Das, T. E. Abbott,” Clustering in mobile ad hoc networks with differential evolution,” Evolutionary Computation (CEC), 2011 IEEE Congress.
7. Anjum A. Mohammed,Gihan Nagib,”Optimal routing in ad-hoc network using genetic algorithm,”Int. J. Advanced Networking and Applications Volume:03,Issues:05,Pages:1323-1328 (2012).
8. Chang Wook and R.S. Ramakrishna, “A genertic algorithm for shortest path routing problem and the sizing of populations”, IEEE transanction on evolutionary computation 6.6 (2002): 566-579.
9. Ren Jingjua, Jiuwei Wang, Yulong Xu, Li Cao, “Applying differential evolution algorithm to deal with optimal path issues in wireless sensor networks”, Mechatronics and Automation (ICMA), wireless sensor networks”, Mechatronics and Automation (ICMA), 2015 IEEE International Conference on ,2015.
10. Y. Hao, “Wireless sensor network path optimization based on particle swarm algorithm,” Computer Engineering, 36(4):91-96, 2010.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
