Abstract

The success of experiences such as Seattle and Houston Wireless has attracted the attention on the so called wireless mesh community networks. These are wireless multihop networks spontaneously deployed by users willing to share communication resources. Due to the community spirit characterizing such networks, it is likely that users will be willing to share other resources besides communication resources, such as data, images, music, movies, disk quotas for distributed backup, and so on. To support resource exchange in these wireless mesh community networks, algorithms for efficient retrieval of information are required. In this paper we introduce Georoy, an algorithm for the efficient retrieval of the information on resource location based on the Viceroy peer-to-peer algorithm. Differently from Viceroy, Georoy exploits the capability of setting and managing a direct mapping between the resource ID and the node which maintains information about its location so as to speed up the search process. Simulation results show that Georoy enables efficient and scalable search of resources and can be successfully used in wireless mesh community networks.

Keywords: Wireless mesh networks; Community networks; Resource localization; Distributed hash tables; Scalability

Article Outline

1. Introduction

2. Related work and basic idea

3. The proposed location-aware DHT algorithm

3.1. The Viceroy algorithm

3.1.1. ID and level assignment

3.1.2. Overlay construction

3.1.3. Routing

3.1.4. Overlay maintenance

3.1.5. Viceroy’s properties

3.2. The Georoy algorithm

3.3. Georoy analysis

4. Mobility management procedures

4.1. LP joining/leaving procedures

4.2. Insertion/removal of resources to/from the distributed catalog

4.3. Information retrieval

4.4. LP handoff management

5. Performance evaluation

6. Conclusions and future work

References

Vitae