oru.sePublications
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
Issues of Implementing Random Walk and Gossip Based Resource Discovery Protocols in P2P MANETs & Suggestions for Improvement
Department of Computer Science, National Institute of Development Administration (NIDA), Bangkok, Thailand.
Department of Computer Science, National Institute of Development Administration (NIDA), Bangkok, Thailand.
2015 (English)In: Procedia Computer Science, ISSN 1877-0509, E-ISSN 1877-0509, Vol. 57, p. 509-518Article in journal (Refereed) Published
Abstract [en]

Wireless multi-hop networks attracted much attention in recent years. Mobile Ad-hoc Network (MANET) being one of such networks has its own limitations in terms of resource discovery with unstable topology and paths through the networks. So eventually traditional searching techniques are still widely used. Peer-to-Peer (P2P) model is the major candidate for the internet traffic mainly due to its decentralized nature. This article evaluates classic flooding, random walk and gossip based resource discovery algorithms under mobile peer-to-peer (MP2P) networks and studied their performance. Further we suggest way to improve these algorithms to suit and work better under MANET. We compare the performance in terms of success rate, query response time, network overhead, battery power consumed, overall dropped packets, MAC load, network bandwidth, packet delivery ratio, network routing load and end to end delay. The experiments are validated through NS-2 simulations.

Place, publisher, year, edition, pages
Elsevier, 2015. Vol. 57, p. 509-518
Keywords [en]
flooding, random walk, gossip, MANET, Peer-to-Peer, resource discovery, MP2P
National Category
Computer Sciences
Research subject
Computer Science; Computer Science
Identifiers
URN: urn:nbn:se:oru:diva-81635DOI: 10.1016/j.procs.2015.07.374ISI: 000361632400060Scopus ID: 2-s2.0-84944055850OAI: oai:DiVA.org:oru-81635DiVA, id: diva2:1429063
Conference
3rd International Conference on Recent Trends in Computing 2015 (ICRTC-2015), Delhi, India, March 12-13, 2015.
Available from: 2020-05-07 Created: 2020-05-07 Last updated: 2020-05-10Bibliographically approved

Open Access in DiVA

Issues of Implementing Random Walk and Gossip Based Resource Discovery Protocols in P2P MANETs & Suggestions for Improvement(1729 kB)8 downloads
File information
File name FULLTEXT01.pdfFile size 1729 kBChecksum SHA-512
6e4d3d3fd50f85bd889bcfff1d191f89cbcea8f10c1ea11308b135336f7abf4d4d7ff0c2bcbf782e0146c4cdf0f11c2a111cd5ba050a01f661a1629da090cf6d
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records BETA

Arunachalam, Ajay

Search in DiVA

By author/editor
Arunachalam, Ajay
In the same journal
Procedia Computer Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 8 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

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