A novel dynamic source routing (DSR) protocol based on minimum execution time scheduling and moth flame optimization (MET-MFO)

被引:16
作者
Almazok, Salem A. [1 ]
Bilgehan, Bulent [1 ]
机构
[1] Near East Univ, Dept Elect & Elect Engn, Nicosia, Turkey
关键词
Mobile ad hoc networks (MANETs); Dynamic source routing (DSR) protocol; Minimum execution time (MET) scheduling; Moth flame optimization (MFO); Optimal route; HOC; ALGORITHM; ENHANCEMENT; FRAMEWORK; NETWORKS;
D O I
10.1186/s13638-020-01802-5
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In general, the conventional routing approaches in mobile ad hoc networks (MANETs) provide a route between the source and the target with a minimum hop count. Dynamic source routing (DSR) as a typical prototype of routing protocols relies on the minimum hop count parameter to provide the path without considering any other factors such as energy consumption and node energy level, which significantly affect the routing algorithm performance. To enhance the performance of the DSR, a novel and efficient routing mechanism based on a hybrid approach using the minimum execution time (MET) scheduling and moth flame optimization (MFO) scheme is proposed. This hybridization version of DSR is called the (MET-MFODSR) algorithm, and it aims to improve the routing mechanism through establishing an optimal route with minimum energy consumption, which increases the network lifetime and reduces route failure issues. The proposed MET-MFODSR protocol is implemented using the MATLAB platform, analyzed and evaluated in different simulation environments. The simulation results demonstrate that the suggested routing algorithm is applicative and practicable, and its performance exceeds the performance of the existing Bee DSR (BEEDSR) and Bee-inspired protocol (BeeIP) algorithms.
引用
收藏
页数:26
相关论文
共 64 条
[1]  
Abolhasan M., 2004, AD HOC NETW, V2, P1, DOI DOI 10.1016/S1570-8705(03)00043-X
[2]  
Ali S, 2014, COMPUT SYST SCI ENG, V29, P183
[3]   Energy efficient channel aware multipath routing protocol for mobile ad-hoc network [J].
Anand, M. ;
Sasikala, T. ;
Anbarasan, M. .
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2019, 31 (04)
[4]  
[Anonymous], 1997, ROUT FUT, V19
[5]  
[Anonymous], WHAT IS CONV ROUT TA
[6]   Routing protocols in ad hoc networks: A survey [J].
Boukerche, Azzedine ;
Turgut, Begumhan ;
Aydin, Nevin ;
Ahmad, Mohammad Z. ;
Boeloeni, Ladislau ;
Turgut, Damla .
COMPUTER NETWORKS, 2011, 55 (13) :3032-3080
[7]   Ant colony optimization based enhanced dynamic source routing algorithm for mobile Ad-hoc network [J].
Chatterjee, Shubhajeet ;
Das, Swagatam .
INFORMATION SCIENCES, 2015, 295 :67-90
[8]   A DESIGN FRAMEWORK AND TAXONOMY FOR HYBRID ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS [J].
Cheng, Hui ;
Cao, Jiannong .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2008, 10 (03) :62-73
[9]  
Chun BG., 2002, MOBILE COMPUTING COM, V6, P36, DOI DOI 10.1145/581291.581299
[10]  
Clausen T, 2003, OPTIMIZED LINK STATE