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
Reducing Routing Overhead in random walk protocol under MP2P Network
Department of Computer Science, School of Applied Statistics, National Institute of Development Administration, Bangkok, Thailand. (MRO)
Department of Computer Science, School of Applied Statistics, National Institute of Development Administration, Bangkok, Thailand.
2016 (English)In: International Journal of Electrical and Computer Engineering, ISSN 2088-8708, Vol. 6, no 6, p. 3121-3130Article in journal (Refereed) Published
Abstract [en]

Due to network dynamics in self-organizing networks the resource discovery effort increases. To discover objects in unstructured peer-to-peer network, peers rely on traditional methods like flooding, random walk and probabilistic forwarding methods. With inadequate knowledge of paths, the peers have to flood the query message which creates incredible network traffic and overhead. Many of the previous works based on random walk were done in wired network. In this context random walk was better than flooding. But under MANETs random walk approach behaved differently increasing the overhead, due to frequent link failures incurred by mobility. Decentralized applications based on peer-to-peer computing are best candidates to run over such dynamic network. Issues of P2P service discovery in wired networks have been well addressed in several earlier works. This article evaluates the performance of random walk based resource discovery protocol over P2P Mobile Adhoc Network (MP2P) and suggests an improved scheme to suit MANET. Our version reduces the network overhead, lowers the battery power consumption, minimizes the query delay while providing equally good success rate. The protocol is validated through extensive NS-2 simulations. It is clear from the results that our proposed scheme is an alternative to the existing ones for such highly dynamic mobile network scenario.

Place, publisher, year, edition, pages
Indonesia: Institute of Advanced Engineering and Science (IAES) , 2016. Vol. 6, no 6, p. 3121-3130
Keywords [en]
Mobile adhoc network, Peer to Peer, distributed computing, algorithms
National Category
Computer Systems
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:oru:diva-73152Scopus ID: 2-s2.0-85011976402OAI: oai:DiVA.org:oru-73152DiVA, id: diva2:1296410
Available from: 2019-03-15 Created: 2019-03-15 Last updated: 2019-09-24Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

ScopusReducing Routing Overhead in random walk protocol under MP2P Network

Authority records BETA

Arunachalam, Ajay

Search in DiVA

By author/editor
Arunachalam, Ajay
In the same journal
International Journal of Electrical and Computer Engineering
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 137 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