|تعداد مشاهده مقاله||2,245,417|
|تعداد دریافت فایل اصل مقاله||1,598,194|
|Journal of Electrical and Computer Engineering Innovations (JECEI)|
|دوره 9، شماره 1، فروردین 2021، صفحه 75-82 اصل مقاله (768.35 K)|
|نوع مقاله: Original Research Paper|
|شناسه دیجیتال (DOI): 10.22061/jecei.2020.7511.397|
|S. Tabatabaei ؛ H. Nosrati Nahook|
|Department of Computer Engineering, Faculty of Engineering, Higher Educational Complex of Saravan, Saravan, Iran.|
|تاریخ دریافت: 26 فروردین 1399، تاریخ بازنگری: 24 شهریور 1399، تاریخ پذیرش: 25 آبان 1399|
|Background and Objectives: With the recent progressions in wireless communication technology, powerful and costless wireless receivers are used in a variety of mobile applications. Mobile networks are a self-arranged network, which is including of mobile nodes that communicate with each other without a central control Mobile networks gained considerable attention due to the adaptability, scalability, and costs reduction. Routing and power consumption is a major problem in mobile networks because the network topology changes frequently. Mobile wireless networks suffer from high error rates, power constraints, and limited bandwidth. Due to the high importance of routing protocols in dynamic multi-hop networks, many researchers have paid attention to the routing problem in Mobile Ad hoc Networks (MANET). This paper proposes a new routing algorithm in MANETs which is based upon the Cuckoo optimization algorithm (COA).|
Methods: COA is inspired by the lifestyle of a family of birds called cuckoo. These birds’ lifestyle, egg-laying features, and breeding are the basis of the development of this optimization algorithm. COA is started by an initial population. There are two types of population of cuckoos in different societies: mature cuckoos and eggs. This algorithm tries to find more stable links for routing.
Results: Simulation results prove the high performance of proposed work in terms of throughput, delay, hop count, and discovery time.
Conclusion: The cuckoo search convergence is based on the establishment of the Markov chain model to prove that it satisfies the two conditions of the global convergence in a random search algorithm. Also, the cuckoo search that suitable for solving continuous problems and multi-objective problems. We have done a lot of experiments to verify the performance of the Cuckoo algorithm for routing in MANETs. The result of experiments shows the superiority of the proposed method against a well-known AODV algorithm.
|Fault tolerance؛ COA؛ AODV|
 Y. Wang, J.J. GARCIA-LUNA-ACEVES, “A distributed cross-layer routing protocol with channel assignment in multi-channel MANET,” in Proc. 2015 International Conference on Computing, Networking and Communications (ICNC): 1050-1054, 2015.
 R. Jain, I. Kashyap, “An QoS aware link defined OLSR (LD-OLSR) routing protocol for MANETs,” Wireless Pers. Comm., 108(3): 1745-1758, 2019.
تعداد مشاهده مقاله: 327
تعداد دریافت فایل اصل مقاله: 334