Cluster-based lookup service with global hashing in mobile ad hoc networks

Authors:
Jongpil Jeong;Hyunseung Choo
Affiliations:
Sungkyunkwan University, Suwon, Korea;Sungkyunkwan University, Suwon, Korea
Venue:
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Year:
2011

Citing 3
Cited 0

Scalable routing protocol for ad hoc networks

Wireless Networks
DART: dynamic address routing for scalable ad hoc and mesh networks

IEEE/ACM Transactions on Networking (TON)
A survey of clustering schemes for mobile ad hoc networks

IEEE Communications Surveys & Tutorials

Quantified Score

Hi-index	0.00

Visualization

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.