An efficient peer-to-peer lookup protocol for location-aware mobile ad hoc networks

Dae-Woong  Kim; Chan-Ik  Park

2nd International ICST Conference on Mobile and Ubiquitous Systems: Networking and Services

Research Article

An efficient peer-to-peer lookup protocol for location-aware mobile ad hoc networks

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/MOBIQUITOUS.2005.12,
    author={ Dae-Woong  Kim and Chan-Ik  Park },
    title={An efficient peer-to-peer lookup protocol for location-aware mobile ad hoc networks},
    proceedings={2nd International ICST Conference on Mobile and Ubiquitous Systems: Networking and Services},
    publisher={IEEE},
    proceedings_a={MOBIQUITOUS},
    year={2005},
    month={11},
    keywords={},
    doi={10.1109/MOBIQUITOUS.2005.12}
}

Dae-Woong Kim
Chan-Ik Park
Year: 2005
An efficient peer-to-peer lookup protocol for location-aware mobile ad hoc networks
MOBIQUITOUS
IEEE
DOI: 10.1109/MOBIQUITOUS.2005.12

Dae-Woong Kim¹, Chan-Ik Park ¹

1: Dept. of Comput. Sci. & Eng., Pohang Univ. of Sci. & Technol., South Korea

Abstract

The rapid increase in the usage of mobile devices and the development of wireless technology bring to the needs of service lookup (i.e. discovery) methods in mobile networks. If a geographical distributed hash table (DHT) is directly applied to a location-aware mobile ad hoc network, the key redistribution overhead could be severe. To reduce the key redistribution overhead, we propose a novel peer-to-peer lookup protocol, two-phase geographical distributed hash table. The proposed protocol causes the home consistency problem because it uses two DHTs in tandem: we also provide a solution to the problem so that a query for a key can be routed correctly to the node which is currently responsible for the key.

Published: 2005-11-21
Publisher: IEEE

: http://dx.doi.org/10.1109/MOBIQUITOUS.2005.12