Timeliness of service discovery in deapspace

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.