loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Seventh IEEE Symposium on Computers and Communications (ISCC'02)
Service Location Protocol Overhead in the Random Graph Model for Ad Hoc Networks
Ramada Hotel, Taormina-Giardini Naxos, Italy
July 01-July 04
ISBN: 0-7695-1671-8
Hend Koubaa, LORIA - INRIA
Eric Fleury, LORIA - INRIA
To deploy a protocol in a network, a deep performance study has to be curried. In particular, in the case of ad hoc networks, this performance is principally tied to overhead optimization. In fact, bandwidth limitation and frequent collisions in ad hoc networks represent constraints upon deploying applications which overhead is important. In this paper, we are interested in minimizing overhead due to the deployment of an application we think is relevant to be deployed in ad hoc networks. This application, called service location, aims to make it possible for a mobile user to know about provided services in the network. In this context, we propose an analysis to estimate consumed overhead in different service location approaches. Our analysis is motivated by network and ad hoc application modeling and estimation of overhead due to service covering and request handling.
Citation:
Hend Koubaa, Eric Fleury, "Service Location Protocol Overhead in the Random Graph Model for Ad Hoc Networks," iscc, pp.49, Seventh IEEE Symposium on Computers and Communications (ISCC'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.