An efficient peer-to-peer lookup protocol for location-aware mobile ad hoc networks
Daewoong Kim, Chanik Park · 2005
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.