oru.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • 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 (engelsk)Inngår i: Diànnǎo xuékān (Journal of Computers), ISSN 1991-1599, Vol. 28, nr 1, s. 209-223Artikkel i tidsskrift (Fagfellevurdert) 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.

sted, utgiver, år, opplag, sider
Taiwan: Táibĕi: Zhōnghuá mínguó diànnǎo xuéhuì , 2017. Vol. 28, nr 1, s. 209-223
Emneord [en]
flooding, gossip, MANET, MP2P, peer-to-peer, resource search
HSV kategori
Identifikatorer
URN: urn:nbn:se:oru:diva-73151DOI: 10.3966/199115592017022801016Scopus ID: 2-s2.0-85015308582OAI: oai:DiVA.org:oru-73151DiVA, id: diva2:1296406
Tilgjengelig fra: 2019-03-15 Laget: 2019-03-15 Sist oppdatert: 2020-05-08bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Arunachalam, Ajay

Søk i DiVA

Av forfatter/redaktør
Arunachalam, Ajay

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 208 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf