Resource-conservative service discovery in ad-hoc networks

Loading...
Thumbnail Image

URL

Journal Title

Journal ISSN

Volume Title

School of Electrical Engineering | Master's thesis
Checking the digitized thesis and permission for publishing
Instructions for the author

Date

Major/Subject

Mcode

T-110

Degree programme

Language

en

Pages

xi + 70 s. + liitt. 5

Series

Abstract

Service discovery is the process of searching a network for nodes hosting a particular service. In ad-hoc networks, all nodes are mobile and usually highly dynamic in nature causing a constant change to the network topology and, thus, to the availability and location of services. Contrary to fixed infrastructure networks, where centralized service databases are feasible, service discovery in ad-hoc networks must he implemented in a pure peer-to-peer fashion. In such a network, the service structure is decentralized across several nodes. While this imposes challenges and limitations on the design of service discovery protocols, it also allows for high-availability and reliability implementations. This thesis proposes one such protocol for service discovery. It is based on creating a load-adaptable, hybrid service distribution model that combines both reactive and proactive discovery according to the prevailing load. The approach strives to limit the consumed bandwidth yet provide reasonable response times and consistency for service queries. The protocol is simulated using the network simulator ns-2 and it performance analyzed and compared against a purely reactive lookup model.

Description

Supervisor

Aura, Tuomas

Thesis advisor

Kiravuo, Timo

Other note

Citation