The DEAPspace service discovery algorithm provides an efficient, decentralised mechanism for service discovery in wireless ad-hoc, single-hop networks. The basic workings of this algorithm are reviewed, and modifications are presented that can reduce the power requirements for weaker devices by allowing some devices to run modified versions of this algorithm. The modifications are analysed in terms of their helpfulness to weak devices, and of their effect on unmodified devices in proximity with these special devices.
By: Michael Nidd
Published in: RZ3254 in 2000
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .