DSLM: a decentralized search for large and mobile networks

Yung-Ting Chuang*, Chung Yen Yu, Qian Wei Wu

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

As ubiquitous networked devices continue to play an increased role in the daily lives of most people, there is a growing desire to share ever more information and perspectives from across the world. In addition, with the recent technical advancements, the networks have turned to a large-scale wireless networks such as mobile ad hoc networks. However, the problem behind such wireless networks is the difficulty of data distribution and information retrieval in such decentralized and large mobile wireless networks, while still maintaining low overhead. Therefore, we present a system we call decentralized search for large and mobile wireless networks, or DSLM, which: (1) divides the entire network into smaller regions; (2) allows nodes to join, leave, distribute metadata, or make requests; (3) applies the LSH method to map the metadata or request to a geographical region; (4) uses a region-based geographic routing method to route messages between nodes; (5) allows nodes to maintain only a partial view of the network; and (6) applies a relocation method to address mobility issues. We finally demonstrate that our DSLM requires low overhead and could still achieve high retrieval rates and mobility resilience.

Original languageEnglish
Pages (from-to)738-767
Number of pages30
JournalJournal of Supercomputing
Volume74
Issue number2
DOIs
StatePublished - 1 Feb 2018

Keywords

  • Distributed search and retrieval
  • Mobile ad hoc networks
  • Network churn
  • Peer-to-peer
  • Probabilistic analysis
  • Wireless sensor networks

Fingerprint Dive into the research topics of 'DSLM: a decentralized search for large and mobile networks'. Together they form a unique fingerprint.

Cite this