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.
By: Michael Nidd
Published in: Proceedings of 29th International Conference on Parallel Processing (ICPP 2000), Pervasive Computing Workshop, ed. by P. Sadayappan. , Los Alamitos, IEEE, p.73-80 in 2000
Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.
Questions about this service can be mailed to reports@us.ibm.com .