Timeliness of Service Discovery in DEAPspace

  • Authors:
  • Michael Nidd

  • Affiliations:
  • -

  • Venue:
  • ICPP '00 Proceedings of the 2000 International Workshop on Parallel Processing
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new algorithm is presented, through which a computing device can detect the presence of neighboring devices, share configuration and service information with those devices, and 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.