oru.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
A broadcast based random query gossip algorithm for resource search in non-DHT mobile Peer-to-Peer networks
Department of Computer Science, Graduate School of Applied Statistics, National Institute of Development Administration, Thailand. (MRO)
Department of Computer Science, Graduate School of Applied Statistics, National Institute of Development Administration, Thailand.
2017 (English)In: Diànnǎo xuékān, ISSN 1991-1599, Vol. 28, no 1, p. 209-223Article in journal (Refereed) Published
Abstract [en]

This paper presents a resource discovery scheme for decentralized non-DHT Mobile Peer-to-Peer (MP2P) networks. In a mobile environment, the energy of mobile device is very critical. The aim of the proposed technique is to reduce the network overhead, lower battery power consumption and minimize query delay while improving the chance to resolve the query at every successive stage. Peer-to-Peer applications have gained a lot of attention in past years due to its decentralized nature. Resource searching algorithms are one of the major focuses of P2P network. Mobile Ad hoc Network (MANET) with its changing topology further poses additional challenges and thus increasing the search effort. Methods like flooding, random walk and probabilistic forwarding techniques are good candidates to run over such dynamic network. In this work, we study the flooding, random walk and gossip based resource discovery protocols on a P2P Mobile Ad hoc Network. We observed that the classic gossip algorithm does not work well under MANET as in the case of a wired network. We focus to improve the algorithm to suit and work better under such dynamic network scenario. The proposed system presents a light weight resource discovery design to suit the mobility requirement of ad hoc networks to optimize the search performance while at the same time minimize the extra usage of mobile and network resources. For quick and energy efficient search scheme, we explore a novel addressed jumping approach. Our algorithm is entirely distributed, and hence will scale well even to the growing size of the network. The efficiency of our proposed algorithm is validated through extensive NS-2 simulations. The results show that our proposed scheme gives better performance than the widely used techniques. We also validate through statistical hypothesis testing of simulation data.

Place, publisher, year, edition, pages
Taiwan: Táibĕi: Zhōnghuá mínguó diànnǎo xuéhuì , 2017. Vol. 28, no 1, p. 209-223
Keywords [en]
flooding, gossip, MANET, MP2P, peer-to-peer, resource search
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:oru:diva-73151DOI: 10.3966/199115592017022801016Scopus ID: 2-s2.0-85015308582OAI: oai:DiVA.org:oru-73151DiVA, id: diva2:1296406
Available from: 2019-03-15 Created: 2019-03-15 Last updated: 2019-03-25Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Arunachalam, Ajay

Search in DiVA

By author/editor
Arunachalam, Ajay
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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