A Rational Exchange Protocol under Asymmetric Information in Wireless Sensor Networks

P2P network is one of the most extensive network frameworks for wireless sensor network (WSN) in Internet of Things (IoT). The peers in WSN are rational and often free ride to save power of electricity and calculation, due to the fact that the usability is of great variability and unpredictability. Such a phenomenon tremendously reduces the quality of service (QoS) in WSN. Rational exchange protocol aims at promoting QoS and guaranteeing security and fairness. However, existing schemes have taken only complete information into account, which is not up to realistic environment. The peers in realistic environment indeed possess incomplete information, which is, however, still not thoroughly investigated so far. In this paper, under asymmetric information (a typical incomplete information), an entropy based incentive model is well designed based on Markov model and QoS evaluation model to help peers cooperate in WSNs. A concrete utility function with entropy is constructed to evaluate decision utility in P2P network. Finally, an entropy based rational exchange protocol is proposed based on the presented incentive model and concrete utility function, with analysis of correctness, security, fairness, and robustness, respectively. The proposed protocol can facilitate rational peers positively and sensibly participating in services and prevent free riding for rational peers. Hence, it further promotes QoS and guarantees security and fairness simultaneously in WSNs.

[1]  Levente Buttyán,et al.  Rational Exchange - A Formal Model Based on Game Theory , 2001, WELCOM.

[2]  Juan E. Tapiador,et al.  Cryptanalysis of Syverson's Rational Exchange Protocol , 2008, Int. J. Netw. Secur..

[3]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[4]  Özgür Ulusoy,et al.  Counteracting free riding in Peer-to-Peer networks , 2008, Comput. Networks.

[5]  Xue Liu,et al.  Delay analysis in practical wireless network coding , 2014, Wirel. Commun. Mob. Comput..

[6]  Martín Abadi,et al.  A logic of authentication , 1990, TOCS.

[7]  Martín Abadi,et al.  A logic of authentication , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[8]  Georg Fuchsbauer,et al.  Efficient Rational Secret Sharing in Standard Communication Networks , 2010, IACR Cryptol. ePrint Arch..

[9]  Juan E. Tapiador,et al.  An Extended Model of Rational Exchange Based on Dynamic Games of Imperfect Information , 2006, ETRICS.

[10]  Zhifang Zhang,et al.  Rational secret sharing as extensive games , 2013, Science China Information Sciences.

[11]  C. Pandu Rangan,et al.  Information Theoretic Security , 2011, Lecture Notes in Computer Science.

[12]  Srdjan Capkun,et al.  A formal model of rational exchange and its application to the analysis of Syverson's protocol , 2004, J. Comput. Secur..

[13]  Joseph Y. Halpern,et al.  Rational secret sharing and multiparty computation: extended abstract , 2004, STOC '04.

[14]  Siu-Ming Yiu,et al.  Multi-key privacy-preserving deep learning in cloud computing , 2017, Future Gener. Comput. Syst..

[15]  Stephan Lauermann.  Asymmetric information in bilateral trade and in markets: An inversion result , 2012, J. Econ. Theory.

[16]  Mohammed Feham,et al.  Novel hybrid intrusion detection system for clustered wireless sensor network , 2011, ArXiv.

[17]  Ueli Maurer,et al.  Rational Protocol Design: Cryptography against Incentive-Driven Adversaries , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[18]  Ueli Maurer,et al.  Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion , 1997, EUROCRYPT.

[19]  Juan E. Tapiador,et al.  A Multi-party Rational Exchange Protocol , 2007, OTM Workshops.

[20]  Robert H. Deng,et al.  Privacy-Preserving Outsourced Calculation Toolkit in the Cloud , 2020, IEEE Transactions on Dependable and Secure Computing.

[21]  Claudio Casetti,et al.  Discovery and provision of content in vehicular networks , 2013, Wirel. Commun. Mob. Comput..

[22]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[23]  Renato Renner,et al.  The Exact Price for Unconditionally Secure Asymmetric Cryptography , 2004, EUROCRYPT.

[24]  Jin Li,et al.  Multi-authority fine-grained access control with accountability and its application in cloud , 2018, J. Netw. Comput. Appl..

[25]  Juan E. Tapiador,et al.  Nature-Inspired Synthesis of Rational Protocols , 2008, PPSN.

[26]  Özgür Ulusoy,et al.  Free Riding in Peer-to-Peer Networks , 2009, IEEE Internet Computing.

[27]  Nadarajah Asokan,et al.  Fairness in electronic commerce , 1998, Research report / RZ / IBM / IBM Research Division / Zürich Research Laboratory.