To Örebro University

oru.seÖrebro University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rock, Paper, Scissors Game Based Model for Content Discovery in P2P MANETs
Department of Computer Science, School of Applied Statistics, National Institute of Development Administration (NIDA), Bangkok, Thailand.ORCID iD: 0000-0003-1827-9698
2020 (English)In: Wireless personal communications, ISSN 0929-6212, E-ISSN 1572-834XArticle in journal (Refereed) Published
Abstract [en]

Resource discovery is a key challenge in dynamic environment such as Peer-to-Peer (P2P) MANETs. To leverage the lookup costs and efficiently discover the resources, the peers in a P2P network communicate with each other forming one-or-more overlay structure. And, thus the peer’s connections in such overlay networks plays a crucial role. To harness this, we propose a model that focuses on the underlying network topology as each virtual link of the overlay network is supported by a path in the underlying physical network. Also, we design a new resource discovery algorithm that uses the famous Rock-Paper-Scis-sors (RPS)  game ideology. In this work, we present a Rock-Paper-Scissors-Game-Based (RPSGB) algorithm for content discovery in mobile peer-to-peer network. The proposed work focuses on providing efficient resource discovery scheme in such a dynamic network, using the game theory concepts. Our scheme is a light-weight model aimed to suit the unstructured architecture better. The major goal of this work, is to reduce the consumption of power, minimize the lookup cost, lower the bandwidth consumption, and increase the hit ratio. We compare our scheme with the traditional well-known benchmarked schemes. After evaluation, the  simulation results justify the effectiveness of the proposed protocol. The obtained results show that the proposed scheme substantially decreases the network traffic, lowers the battery power and bandwidth consumption, while having good search efficiency. Also, the search latency is minimized. The result justifies that RPSGB algo-rithm proposes to make resource searching much more efficient, and improves the statistics against the posed challenges.

Place, publisher, year, edition, pages
Springer, 2020.
Keywords [en]
Resource discovery, Rock-paper-scissors, Game theory, P2P, MANET, Simulation, Ad-hoc network, Peer-to-peer, Content discovery, MP2P, P2P MANETs, Search algorithm, NS-2, Unstructured, Mobile P2P
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:oru:diva-81634DOI: 10.1007/s11277-020-07282-6ISI: 000543227100032Scopus ID: 2-s2.0-85083829532OAI: oai:DiVA.org:oru-81634DiVA, id: diva2:1429053
Available from: 2020-05-07 Created: 2020-05-07 Last updated: 2022-02-08Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Arunachalam, Ajay

Search in DiVA

By author/editor
Arunachalam, Ajay
In the same journal
Wireless personal communications
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 215 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf