Efficient Binary scheme for Training Heterogeneous Sensor Actor NetworksReport as inadecuate

Efficient Binary scheme for Training Heterogeneous Sensor Actor Networks - Download this document for free, or read online. Document in PDF available to download.

1 Department of Computer Science and Mathematics 2 LIPN - Laboratoire d-Informatique de Paris-Nord 3 ODU - Comp. Science Depart. Old Dominion University 4 DISI - Department of Computer Science and Engineering Bologna

Abstract : Sensor networks are expected to evolve into long-lived, autonomous networked systems whose main mission is to provide in-situ users – called actors – with real-time information in support of specific goals supportive of their mission. The network is populated with a heterogeneous set of tiny sensors. The free sensors alternate between sleep and awake periods, under program control in response to computational and communication needs. The periodic sensors alternate between sleep periods and awake periods of predefined lengths, established at the fabrication time. The architectural model of an actor-centric network used in this work comprises in addition to the tiny sensors a set of mobile actors that organize and manage the sensors in their vicinity. We take the view that the sensors deployed are anonymous and unaware of their geographic location. Importantly, the sensors are not, a priori, organized into a network. It is, indeed, the interaction between the actors and the sensor population that organizes the sensors in a disk around each actor into a short-lived, mission-specific, network that exists for the purpose of serving the actor and that will be disbanded when the interaction terminates. The task of setting up this form of actor-centric network involves a training stage where the sensors acquire dynamic coordinates relative to the actor in their vicinity. The main contribution of this work is to propose an energy- efficient training protocol for actor-centric heterogeneous sensor networks. Our protocol outperforms all know training protocols in the number of sleep-awake transitions per sensor needed by the training process. Specifically, in the presence of $k$ coronas, no sensor will experience more than$ \lceil logk ceil$ sleep-awake transitions and awake periods.

Keywords : Sensor networks Heterogeneous networks Actor networks Binary scheme Training protocol analysis of distributed algorithms

Author: F. Barsi - A. Navarra - Cristina Pinotti - Christian Lavault - Vlady Ravelomanana - Stephan Olariu - A.A. Bertossi -

Source: https://hal.archives-ouvertes.fr/


Related documents