By Topic

Timeliness of service discovery in DEAPspace

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
M. Nidd ; IBM Res. Div., Zurich, Switzerland

A new algorithm is presented, through which a computing device can detect the presence of neighbouring 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 reduces the number of transmissions required from individual devices. The effectiveness of this algorithm is demonstrated through comparison with others that achieve similar goals

Published in:

Parallel Processing, 2000. Proceedings. 2000 International Workshops on

Date of Conference: