DocumentCode
356590
Title
Timeliness of service discovery in DEAPspace
Author
Nidd, Michael
Author_Institution
IBM Res. Div., Zurich, Switzerland
fYear
2000
fDate
2000
Firstpage
73
Lastpage
80
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing, 2000. Proceedings. 2000 International Workshops on
Conference_Location
Toronto, Ont.
ISSN
1530-2016
Print_ISBN
0-7695-0771-9
Type
conf
DOI
10.1109/ICPPW.2000.869090
Filename
869090
Link To Document