Service Location Protocol Overhead in the Random Graph Model for Ad Hoc Networks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

Service Location Protocol Overhead in the Random Graph Model for Ad Hoc Networks

Abstract

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.
Fichier principal
Vignette du fichier
A02-R-148.pdf (209.47 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00107566 , version 1 (19-10-2006)

Identifiers

  • HAL Id : inria-00107566 , version 1

Cite

Hend Koubaa, Eric Fleury. Service Location Protocol Overhead in the Random Graph Model for Ad Hoc Networks. 7th IEEE Symposium on Computers and Communications - ISCC'2002, Jul 2002, Taormina, Italy, 6 p. ⟨inria-00107566⟩
101 View
153 Download

Share

Gmail Facebook X LinkedIn More