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

Colloque avec actes et comité de lecture. internationale.International audienceTo 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

Distribution of information in ad hoc networks

Ad-hoc networks are distributed, self-organized networks which do not need a fixed infrastructure. Entities in networks of this sort must collaborate to make network services - such as routing - functional. In these environments, many algorithms from wired networks cannot be naively adapted without congesting the network. The author's work is focused on the study of the information distribution protocol. Indeed, without application, ad-hoc network technologies are useless. Managing services consists of providing a reliable and easy way to develop distributed applications. This work contributes to this study in two specific ways. First, it provides a mathematical model that deals with the best possible site of information source nodes in a graph of infinite density. Thus, nodes can be laid out where desired. Second, it provides an algorithm which achieves an effective distribution of information among the nodes of the network. This algorithm can then be used to publish the description of a service among the network to make its research easy. This study"s results provide a settlement for the design of a distributed of information in ad-hoc networks. Moreover, the results can be used in other application fields such as QoS multi-path routing.http://archive.org/details/distributionofin109453335Tunisia Air Force author.Approved for public release; distribution is unlimited