Title :
Timeliness of service discovery in DEAPspace
Author_Institution :
IBM Res. Div., Zurich, Switzerland
Abstract :
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
Keywords :
mobile computing; portable computers; wireless LAN; DEAPspace; computing device; configuration information sharing; neighbouring device detection; service discovery timeliness; service information sharing; transmissions; wireless ad-hoc single-hop networks; Ad hoc networks; Bandwidth; Frequency; Intelligent networks; Laboratories; Multicast protocols; Network servers; Portable computers; Resource management; Wireless application protocol;
Conference_Titel :
Parallel Processing, 2000. Proceedings. 2000 International Workshops on
Conference_Location :
Toronto, Ont.
Print_ISBN :
0-7695-0771-9
DOI :
10.1109/ICPPW.2000.869090
