Browse > Article
http://dx.doi.org/10.3837/tiis.2019.01.009

IAR-GT: An Incentive Aware Routing based on Game Theory for Selfish Opportunistic Networks  

Li, Li (Graduate School at Shenzhen, Tsinghua University)
Zhong, Xiaoxiong (Graduate School at Shenzhen, Tsinghua University)
Jiang, Yong (Graduate School at Shenzhen, Tsinghua University)
Publication Information
KSII Transactions on Internet and Information Systems (TIIS) / v.13, no.1, 2019 , pp. 152-171 More about this Journal
Abstract
In opportunistic networks, nodes may appear some selfishness while transmitting the message, however, most of the existing research works consider the individual selfishness or social selfishness respectively, and these two types of selfishness may coexist in opportunistic networks. In this paper, we propose an Incentive Aware Routing based on Game Theory for selfish OPPNETs, named IAR-GT, which uses Rubinstein-Stahl bargaining game model to incentivize selfish nodes cooperation in data forwarding. IAR-GT scheme not only considers the resources of nodes, but also uses a new method to calculate the social ties between them. Trace-driven simulations show that our incentive aware routing scheme achieves better performances than comparing schemes under two types of selfishness coexistence environments.
Keywords
Selfish opportunistic networks; incentive aware routing; game theory;
Citations & Related Records
연도 인용수 순위
  • Reference
1 W. A. Moreira, P. Mendes, and S. Sargento, "Opportunistic routing based on daily routines," in Proc. IEEE WOWMOM, pp. 1-6, 2012.
2 M. Musolesi and C. Mascolo, "CAR: Context-aware adaptive routing for delay-tolerant mobile networks," IEEE Trans. on Mobile Computing, vol. 8, no. 2, pp. 246-260, 2009.   DOI
3 L. Zhou, D. Wu, J. Chen, and Z. Dong, "Greening the smart cities: Energy-efficient massive content delivery via D2D communications," IEEE Trans. on Industrial Informatics, vol.14, no.4, pp: 1626-1634, 2018.   DOI
4 L. Zhou, D. Wu, Z. Dong, and X. Li, "When collaboration hugs intelligence: Content delivery over ultra-dense networks," IEEE Communications Magazine, vol. 55, no. 12, pp. 91-95, 2017.   DOI
5 Q. Li, S. Zhu, and G. Cao, "Routing in socially selfish delay tolerant networks," in Proc. of IEEE INFOCOM, pp.1-9, 2010.
6 U. Shevade, H. H. Song, L. Qiu, and Y. Zhang, "Incentive-aware routing in DTNs," in Proc. of ICNP, pp. 238-247, 2008.
7 L. Wei, H. Zhu, Z. Cao, and X. Shen, "MobiID: A user-centric and social-aware reputation based incentive scheme for delay/disruption tolerant networks," in Proc. ADHOC-NOW, pp. 177-190, 2011.
8 R. Ciobanu, C. Dobre, M. Dascalu, S. Trausan-Matu V.Cristea, "SENSE: A collaborative selfish node detection and incentive mechanism for opportunistic networks," Journal of Network and Computer Applications, vol. 41, pp. 240-249, 2014.   DOI
9 M. Jo, L. Han, D. Kim, H. Peter In, "Selfish attacks and detection in cognitive radio ad-hoc networks," IEEE Network, vol. 27, no.3, pp. 46-50, 2013.   DOI
10 H. Zhu, X. Lin, R. Lu, Y. Fan, and X. Shen, "SMART: A secure multilayer credit-based incentive scheme for delay-tolerant networks," IEEE Trans. on Vehicular Technology, vol. 58, no. 8, pp. 4628-4639, 2009.   DOI
11 L. Li, Y. Qin, and X. Zhong, "A novel routing scheme for resource-constraint opportunistic netoworks: A cooperative multi-player bargaining game approach," IEEE Trans. on Vehicular Technology, vol. 65, no. 8, pp: 6547-6561, 2016.   DOI
12 L. Pelusi, A. Passarella, and M. Conti, "Opportunistic networking: Data forwarding in disconnected mobile ad hoc networks," IEEE Communication Magazine, vol. 44, no. 11, pp. 134-141, 2006.   DOI
13 A. Vahdat and D. Becker, "Epidemic routing for partially connected ad hoc networks," Duke Univ., Durham, NC, USA, Tech. Rep. CS-200006, 2000.
14 A. Lindgren, A. Doria, and O. Schelen, "Probabilistic routing in intermittently connected networks," ACM SIGMOBILE Mobile Computing and Communications Review, vol. 7, no. 3, pp. 19-20, 2003.   DOI
15 T. Spyropoulos, K. Psounis, and C. Raghavendra, "Efficient routing in intermittently connected mobile networks: The multiple-copy case," IEEE/ACM Trans. on Networking, vol. 16, no.1, pp: 77-90, 2008.   DOI
16 T. Spyropoulos, K. Psounis, and C. S. Raghavendra, "Efficient routing in intermittently connected mobile networks: The single-copy case," IEEE/ACM Trans. on Networking, vol. 16, no. 1, pp. 63-76, 2008.   DOI
17 N. Eagle, A. Pentland, and D. Lazer, "Inferring social network structure using mobile phone data," Proc. Nat'l Academy of Sciences of USA, vol. 106, no. 36, pp. 15274-15278, 2009.   DOI
18 CRAWDAD Data Set, http://crawdad.cs.dartmouth.edu, 2012.
19 M. Granovetter, "The strength of weak ties," The American Journal of Sociology, vol. 78, no. 6, 1973.
20 L. Wang, H. Xiong, and D. Zhang, "effSense: Energy-efficient and cost-effective data uploading in mobile crowdsensing," in Proc. ACM UbiComp, pp. 1075-1086, 2013.
21 S. C. Nelson, M. Bakht, and R. Kravets, "Encounter-based routing in DTNs," in Proc. of IEEE INFOCOM 2009, pp. 846-854.
22 Y. Li, P. Hui, D. Jin, et al., "Evaluating the impact of social selfishness on the epidemic routing in delay tolerant networks," IEEE Communications Letters, vol. 14, no. 11, pp. 1026-1028, 2010.   DOI
23 R. Lu, X. Lin, H. Zhu, X. Shen, and B. Preiss, "Pi: A practical incentive protocol for delay tolerant networks," IEEE Trans. on Wireless Communications, vol. 9, no. 4, pp. 1483-1493, 2010.   DOI
24 F. Wu, T. Chen, S. Zhong, C. Qiao, and G. Chen, "A game-theoretic approach to stimulate cooperation for probabilistic routing in opportunistic networks," IEEE Trans. on Wireless Communications, vol.12, no. 4, pp. 1573-1583, 2013.   DOI
25 Y. Cai, Y. Fan, D. Wen, "An incentive-compatible routing protocol for two-hop delay-tolerant networks," IEEE Trans. Vehicular Technology, vol. 65, no.1, pp: 266-277, 2016.   DOI
26 B. Jedari, L. Liu,T. Qiu, A. Rahim, F. Xia, "A game-theoretic incentive scheme for social-aware routing in selfish mobile social networks," Future Generation Computer Systems 70:178-190, 2017.   DOI
27 V. Le, Y. Lin, X. Wang, et al., "A cell based dynamic spectrum management scheme with interference mitigation for cognitive network," in Proc. IEEE VTC, 2008, pp.1594-1598.
28 P. Sermpezis, T. Spyropoulos, "Understanding the effects of social selfishness on the performance of heterogeneous opportunistic networks," Computer Communications, vol. 48, pp: 71-83, 2014.   DOI
29 R. Ariel, "Perfect equilibrium in a bargaining model," Econometrica, vol. 50, no. 1, pp. 97-109, 1982.   DOI
30 E. Bulut and B. K. Szymanski, "Exploiting friendship relations for efficient routing in mobile social networks," IEEE Trans. on Parallel and Distributed Systems, vol. 23, no. 12, pp. 2254-2265, 2012.   DOI
31 A. Keranen, The opportunistic network environment simulator, Dept. Commun. Netw., Helsinki Univ. Technol., Espoo, Finland, Special Assignment Rep., May 2008.