DocumentCode
589678
Title
Incentive based approach to find selfish nodes in Mobile P2P networks
Author
Meka, H. ; Madria, S.K. ; Linderman, Mark
Author_Institution
Dept. of Comput. Sci., Missouri Univ. of Sci. & Technol., Rolla, MO, USA
fYear
2012
fDate
1-3 Dec. 2012
Firstpage
352
Lastpage
359
Abstract
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.
Keywords
mobile computing; peer-to-peer computing; telecommunication network routing; M-P2P network; dropping packet; forwarding service; incentive based approach; mobile P2P network; peer-to-peer network; routing algorithm; selfish node identification; virtual currency; Bandwidth; Mobile communication; Mobile computing; Peer to peer computing; Protocols; Public key; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Performance Computing and Communications Conference (IPCCC), 2012 IEEE 31st International
Conference_Location
Austin, TX
ISSN
1097-2641
Print_ISBN
978-1-4673-4881-2
Type
conf
DOI
10.1109/PCCC.2012.6407777
Filename
6407777
Link To Document