Service discovery in DEAPspace

The DEAPspace group at IBM Research, Zurich Lab is developing a system in which services can be shared between proximate devices. The target environment is single-hop short-range wireless systems, and the solution must offer prompt responsiveness for transient devices. In this article, the service discovery algorithm is presented. Through this new algorithm, a computing device can detect the presence of neighboring devices, share configuration and service information with those devices, and also notice when devices become unavailable. Targeted for wireless ad hoc single-hop networks, this solution improves the responsiveness of devices to changes in their environments. The effectiveness of this algorithm is demonstrated through comparison with others that achieve similar goals, considering the responsiveness to changes in the local environment, power consumption, and bandwidth requirement of devices.

[1]  Michael J. Accetta.  Resource Location Protocol , 1983, RFC.

[2]  Zygmunt J. Haas,et al.  Determining the optimal configuration for the zone routing protocol , 1999, IEEE J. Sel. Areas Commun..

[3]  Michael Nidd.  Timeliness of service discovery in DEAPspace , 2000, Proceedings 2000. International Workshop on Parallel Processing.

[4]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[5]  Ralph E. Droms,et al.  Dynamic Host Configuration Protocol , 1993, RFC.

[6]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[7]  Dirk Husemann,et al.  DEAPspace - Transient ad hoc networking of pervasive devices , 2001, Comput. Networks.

[8]  Alan Jones,et al.  Low power rendezvous in embedded wireless networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).