Résumé: Wireless ad hoc sensor networks have the potential to provide the missing interface between the physical world and the Internet, thus impacting a large number of users. This connection will enable computational treatments of the physical world in ways never before possible. In this far reaching scenario, Quality of Service can be expressed in terms of accuracy and/or latency of observing events and the overall state of the physical world. Consequently, one of the fundamental problems in sensor networks is the calculation of coverage, which can be defined as a measure of the ability to detect objects within a sensor filed. Exposure is directly related to coverage in that it is an integral measure of how well the sensor network can observe an object, moving on an arbitrary path, over a period of time. After elucidating the importance of exposure, we formally define exposure and study its properties. We have developed an efficient and effective algorithm for exposure calculations in sensor networks, specifically for finding minimal exposure paths. The minimal exposure path provides valuable information about the worst case exposure-based coverage in sensor networks. The algorithm can be applied to any given distribution of sensors, sensor and sensitivity models, and characteristics of the network. Furthermore, it provides an unbounded level of accuracy as a function of run time and storage. Finally, we provide an extensive collection of experimental results and study the scaling behavior of exposure and the proposed algorithm for its calculation.

Langue: Anglais
Index décimal 621 .Physique appliquée (électrotechnique, génie civil, génie mécanique, ingénierie appliquée, principes physiques en ingénierie)
Thème Informatique

Mots clés:
réseau sans fil
Sonde