Incentive based approach to find selfish nodes in Mobile P2P networks

In a Mobile P2P (M-P2P) network, selfish nodes can drop packets to affect the efficiency of the whole network. Therefore, we propose a simple and efficient mechanism using virtual currency to identify selfish nodes in the network. Each node issues a receipt to its broker to prove that it has provided a forwarding service. Based on receipts received each broker provides well-behaved nodes some virtual currency whereas selfish nodes are punished on dropping packets to make the network more efficient. When compared to other known approaches, our scheme provides real-time detection of selfish nodes and does not require/assume the presence of any tamper proof hardware at each node and can work with any routing algorithm. Simulation results show that our scheme is efficient in terms of (i) time to detect selfish nodes, (ii) the number of false positives and (iii) the number of packets exchanged when compared with others.

[1]  Huafeng Wu,et al.  eSeagull: Design of Mobile P2P File Sharing System at Sea , 2008, 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008).

[2]  A. Seneviratne,et al.  An Incentive Based Routing Algorithm for Improving Message Forwarding in Structured Peer-to-Peer Networks , 2007, The 2nd International Conference on Wireless Broadband and Ultra Wideband Communications (AusWireless 2007).

[3]  David A. Maltz,et al.  DSR: the dynamic source routing protocol for multihop wireless ad hoc networks , 2001 .

[4]  Alexander Aiken,et al.  Attack-Resistant Trust Metrics for Public Key Certification , 1998, USENIX Security Symposium.

[5]  Timothy W. Finin,et al.  ATM: Automated Trust Management for Mobile Ad Hoc Networks Using Support Vector Machine , 2011, 2011 IEEE 12th International Conference on Mobile Data Management.

[6]  Ersin Uzun,et al.  A reputation-based trust management system for P2P networks , 2004, IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004..

[7]  Alberto Blanc,et al.  Designing incentives for peer-to-peer routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[8]  A. Karygiannis,et al.  Detecting critical nodes for MANET intrusion detection systems , 2006, Second International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing (SecPerU'06).

[9]  Sheng Zhong,et al.  Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[10]  J. Karjee,et al.  Tracing the Abnormal Behavior of Malicious Nodes in MANET , 2008, 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing.

[11]  Luiz A. DaSilva,et al.  A reputation-based mechanism for isolating selfish nodes in ad hoc networks , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

[12]  Markus Jakobsson,et al.  A charging and rewarding scheme for packet forwarding in multi-hop cellular networks , 2003, MobiHoc '03.

[13]  Jingsha He,et al.  An Enhanced Trust Model Based on Reputation for P2P Networks , 2008, 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008).

[14]  Donald F. Towsley,et al.  Incentives to promote availability in peer-to-peer anonymity systems , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[15]  Meenu Chawla,et al.  Detection of Packet Dropping Attack Using Improved Acknowledgement Based Scheme in MANET , 2010 .

[16]  Pramod K. Varshney,et al.  An Acknowledgment-Based Approach for the Detection of Routing Misbehavior in MANETs , 2007, IEEE Transactions on Mobile Computing.

[17]  Hai Jin,et al.  An anycast-based P2P routing protocol for mobile ad hoc networks , 2005, 2005 1st IEEE and IFIP International Conference in Central Asia on Internet.

[18]  B.Y. Zhao,et al.  A Case for Unstructured Distributed Hash Tables , 2007, 2007 IEEE Global Internet Symposium.