Energy efficient routing formation technique for hybrid ad hoc network using fusion of artificial intelligence techniques

被引:20
作者
Das, Santosh Kumar [1 ]
Tripathi, Sachin [1 ]
机构
[1] Indian Inst Technol, Dept Comp Sci & Engn, Indian Sch Mines, Dhanbad 826004, Jharkhand, India
关键词
approximation method; aspiration level; geometric programming; hybrid ad hoc network; multiobjective optimization; optimset; GEOMETRIC-PROGRAMMING PROBLEM; MULTIOBJECTIVE OPTIMIZATION; PROTOCOL; ALGORITHM; SCHEME;
D O I
10.1002/dac.3340
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Hybrid Ad-hoc NETwork (HANET) is a fusion of both the static and dynamic topologies. Each node of this network consists of low capacity battery. Because of heterogeneous characteristic of the topology, network parameters are imprecise in nature. This, in effect, the performance and lifetime of the network degrade. To overcome these issues, this paper proposes an optimized energy efficient routing (OE2R) method. This method is inspired by artificial intelligence techniques such as multiobjective optimization, geometric programming, aspiration level, and tolerance limit. The fusion of such stated artificial intelligence techniques provide an effective tool to optimize multiple conflict objectives and estimate imprecise parameters of the network, simultaneously. The proposed technique OE2R is simulated using LINGO optimization software. To justify the effectiveness of the proposed technique, its performance is compared with some existing methods such as approximate linear programming technique for average cost bounds and linear programming-based efficient message delivery approach in hybrid network in several passes of performance metrics. The simulation results show that the proposed OE2R method performs much better with the comparative methods and may be implemented as energy-efficient routing for HANET.
引用
收藏
页数:16
相关论文
共 42 条
[1]  
[Anonymous], 2015, INT J COMMUN SYST
[2]  
[Anonymous], ENG YOUR FUTURE PROJ
[3]  
[Anonymous], INT J COMMU SYST
[4]  
[Anonymous], 2015, IEEE S COMM VEH TECH
[5]  
[Anonymous], WIRELESS NETWORKS
[6]  
[Anonymous], MATH ED INDIA
[7]  
[Anonymous], COMPUT ELECT ENG
[8]   Location-aided and secure routing protocol for heterogeneous multi-hop wireless networks [J].
Yuan B. ;
Ruimin H. ;
Jie A. ;
Huibing Z. .
Journal of China Universities of Posts and Telecommunications, 2016, 23 (01) :49-54
[9]   A neighbor detection algorithm based on multiple virtual mobile nodes for mobile ad hoc networks [J].
Bostanipour, Behnaz ;
Garbinato, Benoit .
COMPUTER NETWORKS, 2017, 112 :294-313
[10]   Reactive routing for mobile cognitive radio ad hoc networks [J].
Cacciapuoti, Angela Sara ;
Caleffi, Marcello ;
Paura, Luigi .
AD HOC NETWORKS, 2012, 10 (05) :803-815