DHT-Based Mobile Service Discovery Protocol for Mobile Ad Hoc Networks
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
Building multicast trees in ad-hoc networks
Autonomics '08 Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems
TinyTorrents: integrating peer-to-peer and wireless sensor networks
WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
Migration policies for location-centric data storage in mobile ad-hoc networks
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Scalability of name resolution for ambient networks
WWIC'06 Proceedings of the 4th international conference on Wired/Wireless Internet Communications
Distributed node location in clustered multi-hop wireless networks
AINTEC'05 Proceedings of the First Asian Internet Engineering conference on Technologies for Advanced Heterogeneous Networks
Distributed lookup in structured peer-to-peer ad-hoc networks
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
Location-aware private service discovery in pervasive computing environment
Information Sciences: an International Journal
Hi-index | 0.00 |
This paper focuses on the problem of implementing a distributed hash table (DHT) in wireless ad hoc networks. Scarceness of resources and node mobility turn routing into a challenging problem and therefore, we claim that building a DHT as an overlay network (like in wired environments) is not the best option. Hence, we present a proof-of-concept DHT, called Cell Hash Routing (CHR), designed from scratch to cope with problems like limited available energy, communication range or node mobility. CHR overcomes these problems, by using position information to organize a DHT of clusters instead of individual nodes. By using position-based routing on top of these clusters, CHR is very efficient. Furthermore, its localized routing and its load sharing schemes, make CHR very scalable in respect to network size and density. For these reasons, we believe that CHR is a simple and yet powerful adaptation of the DHT concept for wireless ad hoc environments.