A Secure Credit-Based Incentive Mechanism for Message Forwarding in Noncooperative DTNs

被引:33
作者
Chen, Honglong [1 ,2 ]
Lou, Wei [2 ,3 ]
Wang, Zhibo [4 ]
Wang, Qian [4 ]
机构
[1] China Univ Petr, Coll Informat & Control Engn, Qingdao 266580, Peoples R China
[2] Hong Kong Polytech Univ, Dept Comp, Kowloon, Hong Kong, Peoples R China
[3] Hong Kong Polytech Univ, Shenzhen Res Inst, Shenzhen 518057, Peoples R China
[4] Wuhan Univ, Sch Comp, Wuhan 430072, Peoples R China
基金
中国国家自然科学基金;
关键词
Cooperation; noncooperative delay-tolerant networks (DTNs); rewarding schemes; secure; TOLERANT NETWORKS; SYSTEM;
D O I
10.1109/TVT.2015.2477164
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Delay-tolerant networks (DTNs) are an emergent communication paradigm characterized by intermittent connectivity. The nodes in DTNs can take advantage of their contact opportunities to forward messages. However, in noncooperative DTNs, the nodes may be selfish and reluctant to cooperate with each other in message forwarding. In such DTNs, stimulating cooperation among the nodes will be indispensable. Recently, many incentive mechanisms have been proposed to motivate nodes to cooperate in message forwarding. However, most of them cannot guarantee systematic security. To resolve the drawback of the previous incentive mechanisms, we first propose a credit-based rewarding scheme called the earliest path singular rewarding (EPSR) scheme to motivate the nodes to truthfully forward the messages during every contact opportunity. Then, we propose another credit-based rewarding scheme called the earliest path cumulative rewarding (EPCR) scheme by further considering that a node may get more contact information on others. We prove that both the EPSR and EPCR schemes are incentive compatible, and the payment for each delivered message is upper bounded. Furthermore, the proposed schemes can prevent selfish nodes having malicious behaviors. We have conducted real-trace-based simulations to illustrate the effectiveness of the proposed EPSR and EPCR schemes.
引用
收藏
页码:6377 / 6388
页数:12
相关论文
共 29 条
[11]   Stimulating Cooperation in Vehicular Ad Hoc Networks: A Coalitional Game Theoretic Approach [J].
Chen, Tingting ;
Zhu, Liehuang ;
Wu, Fan ;
Zhong, Sheng .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2011, 60 (02) :566-579
[12]  
Choi JI, 2010, MOBICOM 10 & MOBIHOC 10: PROCEEDINGS OF THE 16TH ANNUAL INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND NETWORKING AND THE 11TH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, P1
[13]   A Cooperative Watchdog System to Detect Misbehavior Nodes in Vehicular Delay-Tolerant Networks [J].
Dias, Joao A. F. F. ;
Rodrigues, Joel J. P. C. ;
Xia, Feng ;
Mavromoustakis, Constandinos X. .
IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 2015, 62 (12) :7929-7937
[14]  
Erramilli V, 2008, MOBIHOC'08: PROCEEDINGS OF THE NINTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, P251
[15]   SORI: A secure and objective reputation-based incentive scheme for ad-hoc networks [J].
He, Q ;
Wu, DP ;
Khosla, P .
2004 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-4: BROADBAND WIRELESS - THE TIME IS NOW, 2004, :825-830
[16]   EMD: Energy-Efficient P2P Message Dissemination in Delay-Tolerant Wireless Sensor and Actor Networks [J].
He, Shibo ;
Li, Xu ;
Chen, Jiming ;
Cheng, Peng ;
Sun, Youxian ;
Simplot-Ryl, David .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2013, 31 (09) :75-84
[17]  
Honglong Chen, 2011, 2011 International Conference on Parallel Processing, P683, DOI 10.1109/ICPP.2011.39
[18]  
Krifa A, 2011, PROCEEDINGS OF THE 6TH ACM WORKSHOP ON CHALLENGED NETWORKS (CHANTS '11), P31
[19]   Thwarting Blackhole Attacks in Distruption-Tolerant Networks using Encounter Tickets [J].
Li, Feng ;
Wu, Jie ;
Srinivasan, Avinash .
IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, :2428-+
[20]  
Li X.-Y., 2008, P ACM MOBIHOC