Skip to main navigation Skip to search Skip to main content

Cluster-based Lookup Service with Global Hashing in Mobile Ad hoc Networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper proposes a novel cluster-based lookup service in mobile ad hoc networks. By exploiting a self-Adaptive multi-hop clustering, we avoid the empty region problem of grid system and omit the need of GPS device. The uniform distributed hash function is used in information querying to reduce the communication overhead. We also introduce another hashing function which is based on cluster size to shorten the querying delay time. In maintenance phase, we suppress the dependence of hashing function on cluster backbone by limiting the topology modification only at the start of each interval. Finally, simulation results demonstrate that our scheme reduces the communication overhead significantly. By varying different simulation parameters, we show that the proposed scheme is scalable and adaptive to many networks scenarios.

Original languageEnglish
Title of host publicationProceedings of the 5th International Conference on Ubiquitous Information Management and Communication, ICUIMC 2011
PublisherAssociation for Computing Machinery
ISBN (Electronic)9781450305716
DOIs
StatePublished - 21 Feb 2011
Event5th International Conference on Ubiquitous Information Management and Communication, ICUIMC 2011 - Seoul, Korea, Republic of
Duration: 21 Feb 201123 Feb 2011

Publication series

NameACM International Conference Proceeding Series

Conference

Conference5th International Conference on Ubiquitous Information Management and Communication, ICUIMC 2011
Country/TerritoryKorea, Republic of
CitySeoul
Period21/02/1123/02/11

Keywords

  • Ad hoc Networks
  • Multi-hop Clustering
  • Stability
  • Stretching Clustering
  • k-hop Dominating Set.

Fingerprint

Dive into the research topics of 'Cluster-based Lookup Service with Global Hashing in Mobile Ad hoc Networks'. Together they form a unique fingerprint.

Cite this