An energy-efficient history-based routing scheme for opportunistic networks

被引:15
作者
Dhurandher, Sanjay K. [1 ]
Sharma, Deepak Kumar [1 ]
Woungang, Isaac [2 ]
Saini, Aakanksha [1 ]
机构
[1] Univ Delhi, Div Informat Technol, CAITFS, NSIT, New Delhi, India
[2] Ryerson Univ, Dept Comp Sci, Toronto, ON, Canada
关键词
Opportunistic networks; Opportunistic routing; ONE (Opportunistic Network Environment) simulator; HBPR Protocol; PROTOCOL; ALGORITHM;
D O I
10.1002/dac.2989
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In opportunistic networks (Oppnets), nodes rely on contact opportunities between them to exchange information with each other. Routing and forwarding in Oppnets remains a challenging task because of the limited energy and bandwidth constraints. Various routing protocols for Oppnets have been proposed in the literature, but only few of them have explicitly investigated the energy issue. In this paper, some improvements in the already existing history-based prediction for routing protocol for infrastructure-less Oppnets (so-called HBPR) is suggested so as to make it energy efficient. The proposed energy-efficient HBPR protocol (EHBPR) addresses the energy constraints in HBPR and reduces the number of packets transferred in the network, which in turn results to a reduction in the nodes' energy consumption. Through simulations, the performance of EHBPR in terms of energy consumption is compared against the HBPR and the energy-efficient n-epidemic routing protocol. The results show that (1) EHBPR consumes 14.66% less energy than HBPR (respectively 13.14% less energy than n-epidemic); (2) EHBPR generates 67.4% less dead nodes compared with HBPR (resp. 66.33% less dead nodes compared to n-epidemic); and (3) EHBPR yields 77.86% less overhead ratio compared with HBPR (resp. 84.49% less overhead ratio compared with n-epidemic). Copyright (C) 2015 John Wiley & Sons, Ltd.
引用
收藏
页数:13
相关论文
共 24 条
[1]  
[Anonymous], 2013, J INTERNET SERV INF
[2]  
[Anonymous], 2006, CHALLENGES PRIVACY S
[3]  
[Anonymous], 2002, AD HOC MOBILE WIRELE
[4]  
[Anonymous], 2000, HDB SYSTEMIC AUTOIMM
[5]   Analysis of branch prediction via data compression [J].
Chen, ICK ;
Coffey, JT ;
Mudge, TN .
ACM SIGPLAN NOTICES, 1996, 31 (09) :128-137
[6]   Energy-Aware Social-based Routing in Opportunistic Networks [J].
Chilipirea, Cristian ;
Petre, Andreea-Cristina ;
Dobre, Ciprian .
2013 IEEE 27TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS WORKSHOPS (WAINA), 2013, :791-796
[7]   Efficient routing based on past information to predict the future location for message passing in infrastructure-less opportunistic networks [J].
Dhurandher, Sanjay K. ;
Sharma, Deepak Kumar ;
Woungang, Isaac ;
Saini, Aakanksha .
JOURNAL OF SUPERCOMPUTING, 2015, 71 (05) :1694-1711
[8]   GAER: genetic algorithm-based energy-efficient routing protocol for infrastructure-less opportunistic networks [J].
Dhurandher, Sanjay K. ;
Sharma, Deepak Kumar ;
Woungang, Isaac ;
Gupta, Rohan ;
Garg, Sanjay .
JOURNAL OF SUPERCOMPUTING, 2014, 69 (03) :1183-1214
[9]   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
[10]  
Dhurandher SK, 2011, IEEE GLOBE WORK, P1067, DOI 10.1109/GLOCOMW.2011.6162342