An Equivalent Exchange Based Data Forwarding Incentive Scheme for Socially Aware Networks

As nodes have limited resources in the socially aware networks, they will have strong selfish behaviors, such as not forwarding messages and losing packets, which will lead to poor network performance. Thus, an equivalent-exchange-based data forwarding incentive scheme (EEIS) will be proposed in this paper. It is main that messages forwarding will be abstracted into a transaction in EEIS. The buyer and seller respectively make a price about the message according to its own resource state and negotiate twice the pricing both side until they agree, then the buyer will send the message and pay a certain virtual currency to the seller. Otherwise, the next message will continue to be traded. Meanwhile, both parties’ resource status, wealth status and the price of messages must be open and transparent to prevent the nodes from making false pricing during the transaction. Ultimately, the experimental results show the delivery ratio about messages is improved significantly and verify the effectiveness of EEIS.

[1]  Marco Conti,et al.  Design and performance evaluation of ContentPlace, a social-aware data dissemination system for opportunistic networks , 2010, Comput. Networks.

[2]  Igor Bisio,et al.  Context-awareness over transient cloud in D2D networks: energy performance analysis and evaluation , 2017, Trans. Emerg. Telecommun. Technol..

[3]  Meikang Qiu,et al.  Cloud Infrastructure Resource Allocation for Big Data Applications , 2018, IEEE Transactions on Big Data.

[4]  Sajal K. Das,et al.  RADON: reputation-assisted data forwarding in opportunistic networks , 2010, MobiOpp '10.

[5]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SIMUTools 2009.

[6]  Meikang Qiu,et al.  Data Placement and Duplication for Embedded Multicore Systems With Scratch Pad Memory , 2013, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[7]  Levente Buttyán,et al.  Barter trade improves message delivery in opportunistic networks , 2010, Ad Hoc Networks.

[8]  Mary Baker,et al.  Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.

[9]  Feng Xia,et al.  CAIS: A Copy Adjustable Incentive Scheme in Community-Based Socially Aware Networking , 2017, IEEE Transactions on Vehicular Technology.

[10]  Zenggang Xiong,et al.  Intelligent distributed routing scheme based on social similarity for mobile social networks , 2019, Future Gener. Comput. Syst..

[11]  Zenggang Xiong,et al.  Efficient opportunistic routing with social context awareness for distributed mobile social networks , 2019 .

[12]  Siu-Ming Yiu,et al.  Incentive evolutionary game model for opportunistic social networks , 2020, Future Gener. Comput. Syst..

[13]  Xiaodong Lin,et al.  SMART: A Secure Multilayer Credit-Based Incentive Scheme for Delay-Tolerant Networks , 2009, IEEE Transactions on Vehicular Technology.

[14]  Meikang Qiu,et al.  Retraining Strategy-Based Domain Adaption Network for Intelligent Fault Diagnosis , 2020, IEEE Transactions on Industrial Informatics.

[15]  Yun Li,et al.  A Novel Game Based Incentive Strategy for Opportunistic Networks , 2014, GLOBECOM 2014.

[16]  A. Vasilakos,et al.  Socially Aware Networking: A Survey , 2013, IEEE Systems Journal.

[17]  Yin Zhang,et al.  Incentive-aware routing in DTNs , 2008, 2008 IEEE International Conference on Network Protocols.

[18]  Qinghua Li,et al.  Routing in Socially Selfish Delay Tolerant Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[19]  Xiaodong Lin,et al.  Pi: A practical incentive protocol for delay tolerant networks , 2010, IEEE Transactions on Wireless Communications.

[20]  Kin K. Leung,et al.  Context-Awareness for Mobile Sensing: A Survey and Future Directions , 2016, IEEE Communications Surveys & Tutorials.

[21]  Keke Gai,et al.  Privacy-Preserving Data Encryption Strategy for Big Data in Mobile Cloud Computing , 2017, IEEE Transactions on Big Data.

[22]  Xiao-Hu You,et al.  An Incentive Protocol for Opportunistic Networks with Resources Constraint: An Incentive Protocol for Opportunistic Networks with Resources Constraint , 2013 .

[23]  Jordi Forné,et al.  A novel dynamic reputation-based source routing protocol for mobile ad hoc networks , 2019, EURASIP J. Wirel. Commun. Netw..

[24]  Min Chen,et al.  SPHA: Smart Personal Health Advisor Based on Deep Analytics , 2018, IEEE Communications Magazine.

[25]  Meikang Qiu,et al.  Voltage Assignment with Guaranteed Probability Satisfying Timing Constraint for Real-time Multiproceesor DSP , 2007, J. VLSI Signal Process..

[26]  Mun Choon Chan,et al.  MobiCent: a Credit-Based Incentive System for Disruption Tolerant Network , 2010, 2010 Proceedings IEEE INFOCOM.

[27]  Julinda Stefa,et al.  Give2Get: Forwarding in Social Mobile Wireless Networks of Selfish Individuals , 2012, IEEE Trans. Dependable Secur. Comput..

[28]  Feng Xia,et al.  BEEINFO: Interest-Based Forwarding Using Artificial Bee Colony for Socially Aware Networking , 2015, IEEE Transactions on Vehicular Technology.

[29]  Chunming Qiao,et al.  A Game-Theoretic Approach to Stimulate Cooperation for Probabilistic Routing in Opportunistic Networks , 2013, IEEE Transactions on Wireless Communications.

[30]  Meikang Qiu,et al.  An Empirical Study of Web Interface Design on Small Display Devices , 2004, IEEE/WIC/ACM International Conference on Web Intelligence (WI'04).

[31]  Chunming Qiao,et al.  A bargaining-based approach for incentive-compatible message forwarding in opportunistic networks , 2012, 2012 IEEE International Conference on Communications (ICC).

[32]  Ahmad Khademzadeh,et al.  Selfish node detection based on hierarchical game theory in IoT , 2019, EURASIP J. Wirel. Commun. Netw..

[33]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[34]  Greg Bigwood,et al.  IRONMAN: Using Social Networks to Add Incentives and Reputation to Opportunistic Networks , 2011, 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing.