GAER: genetic algorithm-based energy-efficient routing protocol for infrastructure-less opportunistic networks

被引:36
作者
Dhurandher, Sanjay K. [1 ]
Sharma, Deepak Kumar [2 ]
Woungang, Isaac [3 ]
Gupta, Rohan [2 ]
Garg, Sanjay [2 ]
机构
[1] Univ Delhi, Netaji Subas Inst Technol, CAITFS, Div Informat Technol, New Delhi, India
[2] Univ Delhi, Netaji Subas Inst Technol, Div Comp Engn, New Delhi, India
[3] Ryerson Univ, Dept Comp Sci, Toronto, ON, Canada
关键词
Opportunistic networks; Infrastructure-less opportunistic networks; Opportunistic routing; Delay-tolerant networks; Genetic algorithm; Energy-efficient routing;
D O I
10.1007/s11227-014-1195-9
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In infrastructure-less opportunistic networks (Oppnets), the routing of messages is a challenging task since nodes are not aware of the network topology and they look for an opportunity to send the message by finding or predicting a best temporary path at each hop towards the destination. As nodes perform various computations for next hop selection, a lot of battery power gets consumed, which in turn reduces the network lifetime. Thus, there is a clear demand for routing protocols for such networks which are energy-efficient and consume lesser power of nodes in forwarding a message. In this paper, a novel routing protocol named genetic algorithm-based energy-efficient routing (GAER) protocol for infrastructure-less Oppnets is proposed. This protocol uses a node's personal information, and then applies the genetic algorithm (GA) to select a better next hop among a group of neighbour nodes for the message to be routed to the destination. With the application of GA, optimal results are obtained that help in the selection of the best possible node as the next hop, which in turn, leads to prolonged battery life. Simulation results show that GAER outperforms the Epidemic, PROPHET, and Spray and Wait protocols in terms of messages delivered, overhead ratio, average residual energy, and number of dead nodes. The results obtained for average latency and average buffer time using GAER are comparable to those obtained for the aforementioned protocols.
引用
收藏
页码:1183 / 1214
页数:32
相关论文
共 26 条
[1]  
[Anonymous], P 7 IEEE INT C WIR O
[2]  
[Anonymous], 2006, CHALLENGES PRIVACY S
[3]  
[Anonymous], 2000, CS200006 DUK U DEP C
[4]  
[Anonymous], 2002, AD HOC MOBILE WIRELE
[5]  
[Anonymous], 1998, INTRO GENETIC ALGORI
[6]  
Bluetooth, BLUET SPEC
[7]  
Boldrini C, 2007, I S WORLD WIREL MOBI, P78
[8]   HBPR: History Based Prediction for Routing in Infrastructure-less Opportunistic Networks [J].
Dhurandher, Sanjay K. ;
Sharma, Deepak Kumar ;
Woungang, Isaac ;
Bhati, Shruti .
2013 IEEE 27TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA), 2013, :931-936
[9]  
Dhurandher SK, 2011, IEEE GLOBE WORK, P1067, DOI 10.1109/GLOCOMW.2011.6162342
[10]  
Fall K, 2003, ACM SIGCOMM COMP COM, V33, P27