Frank, Christian and Karl, Holger (2004), "Consistency challenges of service discovery in mobile ad hoc networks", MSWiM '04: Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems: 105--114.
Abstract: Emerging urban ad hoc networks resulting from a large number
of individual WLAN users challenge the way users could explore
and interact with their physical surroundings. Robust and efficient
service discovery and routing protocols in such networks are a necessary
ingredient. Although a lightweight service discovery proposal
integrated with ad hoc routing exists, an implementation and
performance evaluation with respect to overhead and correctness
have so far been missing.
Moreover, the different service providers in an urban scenario,
which (more or less) frequently and actively change their status,
demand more flexible handling of cached information on neighboring
providers than what is currently proposed. We therefore contribute
mechanisms that maintain cache consistency and show that
explicitly removing cache entries on existing neighboring providers
is well invested effort. We finally evaluate whether ad hoc network
latency can implicitly help our protocol in retrieving the physically
closest provider, using an 802.11 model. Additionally, we provide
a general architectural framework for enabling lightweight service
discovery on top of most reactive routing protocols.
Keywords: service discovery, ad hoc networks, ubiquitous computing
Webpage Link |
Show BibTex
Hide BibTex |
Search web for title |
Report as unrelated |
Submit correction
@inproceedings { 1023684,
abstract = {Emerging urban ad hoc networks resulting from a large number
of individual WLAN users challenge the way users could explore
and interact with their physical surroundings. Robust and efficient
service discovery and routing protocols in such networks are a necessary
ingredient. Although a lightweight service discovery proposal
integrated with ad hoc routing exists, an implementation and
performance evaluation with respect to overhead and correctness
have so far been missing.
Moreover, the different service providers in an urban scenario,
which (more or less) frequently and actively change their status,
demand more flexible handling of cached information on neighboring
providers than what is currently proposed. We therefore contribute
mechanisms that maintain cache consistency and show that
explicitly removing cache entries on existing neighboring providers
is well invested effort. We finally evaluate whether ad hoc network
latency can implicitly help our protocol in retrieving the physically
closest provider, using an 802.11 model. Additionally, we provide
a general architectural framework for enabling lightweight service
discovery on top of most reactive routing protocols.},
keywords = {service discovery, ad hoc networks, ubiquitous computing},
address = {New York, NY, USA},
publisher = {ACM},
doi = {http://doi.acm.org/10.1145/1023663.1023684},
location = {Venice, Italy},
pages = {105--114},
isbn = {1-58113-953-5},
year = {2004},
booktitle = {MSWiM '04: Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems},
title = {Consistency challenges of service discovery in mobile ad hoc networks},
author = {Frank , Christian and Karl , Holger}
}
|