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
Minimizing Redundant Messages and Improving Search Efficiency under Highly Dynamic Mobile P2P Network
Department of Computer Science, Graduate School of Applied Statistics, National Institute of Development Administration, Thailand. (MRO)ORCID iD: 0000-0003-1827-9698
Department of Computer Science, Graduate School of Applied Statistics, National Institute of Development Administration, Thailand.
2016 (English)In: Journal of Engineering Science and Technology Review, ISSN 1791-9320, E-ISSN 1791-2377, Vol. 9, no 1, p. 23-35Article in journal (Refereed) Published
Abstract [en]

Resource Searching is one of the key functional tasks in large complex networks. With the P2P architecture, millions of peers connect together instantly building a communication pattern. Searching in mobile networks faces additional limitations and challenges. Flooding technique can cope up with the churn and searches aggressively by visiting almost all the nodes. But it exponentially increases the network traffic and thus does not scale well. Further the duplicated query messages consume extra battery power and network bandwidth. The blind flooding also suffers from long delay problem in P2P networks. In this paper, we propose optimal density based flooding resource discovery schemes. Our first model takes into account local graph topology information to supplement the resource discovery process while in our extended version we also consider the neighboring node topology information along with the local node information to further effectively use the mobile and network resources. Our proposed method reduces collision at the same time minimizes effect of redundant messages and failures. Overall the methods reduce network overhead, battery power consumption, query delay, routing load, MAC load and bandwidth usage while also achieving good success rate in comparison to the other techniques. We also perform a comprehensive analysis of the resource discovery schemes to verify the impact of varying node speed and different network conditions.

Place, publisher, year, edition, pages
Greece: Technological Education Institute of Kavala , 2016. Vol. 9, no 1, p. 23-35
Keywords [en]
MANET, Mobile Peer-to-Peer, Flooding, Node Density
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:oru:diva-73150DOI: 10.25103/jestr.091.05Scopus ID: 2-s2.0-84988411390OAI: oai:DiVA.org:oru-73150DiVA, id: diva2:1296402
Available from: 2019-03-15 Created: 2019-03-15 Last updated: 2022-11-15Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopusFull-text

Authority records

Arunachalam, Ajay

Search in DiVA

By author/editor
Arunachalam, Ajay
In the same journal
Journal of Engineering Science and Technology Review
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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