Local index tree for mobile Peer-to-Peer networks

  • Wei Shi*
  • , Shanping Li
  • , Gang Peng
  • , Ma Tianchi
  • , Xin Lin
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

2 Scopus citations

Abstract

An effective algorithm for searching and retrieving information is proved to be critically relevant to the performance of mobile Peer-to-Peer (MP2P) systems. However, existing searching algorithms in MP2P environment are inefficient in respect of user response time and network traffic, due to the nature of limited bandwidth and mobility of the electronic devices. A searching algorithm Local Index Tree (LIT) is proposed in this paper. By building a index which keeps track of the relative locations of the peers near by, LIT reduces the number of query requests and accelerates the lookup process especially when the frequency of queries is relatively high. Simulations on NS2 show that LIT greatly reduces the user response time compared with existing searching mechanisms in MP2P systems while saving bandwidth of the network.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsHai Jin, Jianhua Sun, Yi Pan, Nong Xiao
PublisherSpringer Verlag
Pages650-656
Number of pages7
ISBN (Print)3540235647, 9783540235644
DOIs
StatePublished - 2004
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3251
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Local index tree for mobile Peer-to-Peer networks'. Together they form a unique fingerprint.

Cite this