In this paper, we present a family of adaptive protocols, called SPIN (Sensor Protocols for Information via Negotiation), that efficiently disseminates information among sensors in an energy-constrained wireless sensor network. Nodes running a SPIN communication protocol name their data using high-level data descriptors, called meta-data. They use meta-data negotiations to eliminate the transmission of redundant data throughout the network. In addition, SPIN nodes can base their communication decisions both upon application-specific knowledge of the data and upon knowledge of the resources that are available to them. This allows the sensors to efficiently distribute data given a limited energy supply. We simulate and analyze the performance of two specific SPIN protocols, comparing them to other possible approaches and a theoretically optimal protocol. We find that the SPIN protocols can deliver 60% more data for a given amount of energy than conventional approaches. We also find that, in terms of dissemination rate and energy usage, the SPlN protocols perform close to the theoretical optimum.

/pdf/adaptive-protocols-for-information-dissemination-in-wireless-2lo594hki6.pdf

Adaptive protocols for information dissemination in wireless sensor networks

In the Hamadryas baboon, males are substantially larger than females. A troop of baboons is subdivided into a number of ‘one-male groups’, consisting of one adult male and one or more females with their young. The male prevents any of ‘his’ females from moving too far from him. Kummer (1971) performed the following experiment. Two males, A and B, previously unknown to each other, were placed in a large enclosure. Male A was free to move about the enclosure, but male B was shut in a small cage, from which he could observe A but not interfere. A female, unknown to both males, was then placed in the enclosure. Within 20 minutes male A had persuaded the female to accept his ownership. Male B was then released into the open enclosure. Instead of challenging male A , B avoided any contact, accepting A’s ownership.

Evolution and the Theory of Games

Topology Control (TC) is one of the most important techniques used in wireless ad hoc and sensor networks to reduce energy consumption (which is essential to extend the network operational time) and radio interference (with a positive effect on the network traffic carrying capacity). The goal of this technique is to control the topology of the graph representing the communication links between network nodes with the purpose of maintaining some global graph property (e.g., connectivity), while reducing energy consumption and/or interference that are strictly related to the nodes' transmitting range. In this article, we state several problems related to topology control in wireless ad hoc and sensor networks, and we survey state-of-the-art solutions which have been proposed to tackle them. We also outline several directions for further research which we hope will motivate researchers to undertake additional studies in this field.

/pdf/topology-control-in-wireless-ad-hoc-and-sensor-networks-3e17u396zt.pdf

Topology Control in Wireless Ad Hoc and Sensor Networks

In this paper, we present a family of adaptive protocols, called SPIN (Sensor Protocols for Information via Negotiation), that efficiently disseminate information among sensors in an energy-constrained wireless sensor network. Nodes running a SPIN communication protocol name their data using high-level data descriptors, called meta-data. They use meta-data negotiations to eliminate the transmission of redundant data throughout the network. In addition, SPIN nodes can base their communication decisions both upon application-specific knowledge of the data and upon knowledge of the resources that are available to them. This allows the sensors to efficiently distribute data given a limited energy supply. We simulate and analyze the performance of four specific SPIN protocols: SPIN-PP and SPIN-EC, which are optimized for a point-to-point network, and SPIN-BC and SPIN-RL, which are optimized for a broadcast network. Comparing the SPIN protocols to other possible approaches, we find that the SPIN protocols can deliver 60% more data for a given amount of energy than conventional approaches in a point-to-point network and 80% more data for a given amount of energy in a broadcast network. We also find that, in terms of dissemination rate and energy usage, the SPIN protocols perform close to the theoretical optimum in both point-to-point and broadcast networks.

/pdf/negotiation-based-protocols-for-disseminating-information-in-1i6jhgr0p8.pdf

Negotiation-based protocols for disseminating information in wireless sensor networks

This self-contained introduction to the distributed control of robotic networks offers a distinctive blend of computer science and control theory. The book presents a broad set of tools for understanding coordination algorithms, determining their correctness, and assessing their complexity; and it analyzes various cooperative strategies for tasks such as consensus, rendezvous, connectivity maintenance, deployment, and boundary estimation. The unifying theme is a formal model for robotic networks that explicitly incorporates their communication, sensing, control, and processing capabilities--a model that in turn leads to a common formal language to describe and analyze coordination algorithms.Written for first- and second-year graduate students in control and robotics, the book will also be useful to researchers in control theory, robotics, distributed algorithms, and automata theory. The book provides explanations of the basic concepts and main results, as well as numerous examples and exercises.Self-contained exposition of graph-theoretic concepts, distributed algorithms, and complexity measures for processor networks with fixed interconnection topology and for robotic networks with position-dependent interconnection topology Detailed treatment of averaging and consensus algorithms interpreted as linear iterations on synchronous networks Introduction of geometric notions such as partitions, proximity graphs, and multicenter functions Detailed treatment of motion coordination algorithms for deployment, rendezvous, connectivity maintenance, and boundary estimation

/pdf/distributed-control-of-robotic-networks-a-mathematical-1q6nfcvi2l.pdf

Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms

We investigate initial information, unbounded memory and randomization in gathering mobile agents on a grid. We construct a state machine, such that it is possible to gather, with probability 1, all configurations of its copies. This machine has initial input, unbounded memory, and is randomized. We show that no machine having any two of these capabilities but not the third, can be used to gather, with high probability, all configurations. 
We construct deterministic Turing Machines that are used to gather all connected configurations, and we construct deterministic finite automata that are used to gather all contractible connected configurations.

Use of Information, Memory and Randomization in Asynchronous Gathering

We consider transducers with set output, ie, finite state machines which produce a set of output symbols upon reading any input symbol When a word consisting of input symbols is read, the union of corresponding output sets is produced Such transducers are instrumental in some important data classification tasks, such as multi-field packet classification Two transducers are called equivalent if they produce equal output upon reading any input word In practical data classification applications, it is important to store in memory only one transducer of every equivalence class, in order to save memory space This yields the need of finding, in any equivalence class, one transducer, called canonical which is easy to compute, given any transducer from this class One of the results of this paper is the construction of an algorithm which completes this task Assuming that the input and output alphabets are of bounded size, for a given n-state transducer T, our algorithm finds the canonical transducer ?(T) equivalent to T in time O(n log n)

https://link.springer.com/content/pdf/10.1007%2F3-540-45655-4_33.pdf

Transducers with Set Output

Dans cet article nous etudions l'election de leader distribuee dans des reseaux anonymes. Dans ce modele l'ensemble des noeuds produisent en sortie un chemin simple vers l'un d'entre eux, ce dernier sera alors qualifie de leader. Nous etudions en particulier le cas de l'election dans des arbres anonymes lorsque le temps alloue est inferieur au diametre de l'arbre considere. Si aucune information supplementaire n'est accessible, les noeuds ne pouvant pas avoir une vision complete du reseau, l'election est impossible et ce quel que soit l'algorithme utilise. Nous etudions donc le compromis entre la quantite d'information initialement requise par les noeuds et le temps τ leur etant alloue pour realiser l'election. Nous utilisons le modele des algorithmes avec conseil dans lequel un oracle ayant une connaissance complete du reseau, fournit un conseil unique sous forme d'une chaine binaire, a l'ensemble des noeuds avant que ceux-ci n'initient leurs calculs. Pour la majorite des valeurs de τ nos bornes inferieures et superieures sont proches a un facteur multiplicatif pres, ou different seulement d'un facteur logarithmique. Pour un arbre T de diametre diam ≤ D et un temps τ = diam − 1 la borne sur la quantite d'information requise (en nombre de bits) est Θ(log D). En reduisant le temps d'une unite, i.e., pour τ = diam − 2 la quantite d'information requise pour elire depend de la parite du diametre, elle est de Θ(log D) lorsque diam est pair et de Θ(log n) sinon. Pour tout temps τ ∈ [β · diam, diam − 3] avec β > 1/2, notre borne superieure est O(n log n D) et notre borne inferieure de Ω(n D) a l'exception du cas ou diam est pair et τ est exactement diam − 3, cas pour lequel le probleme reste ouvert. Enfin, pour des temps α · diam avec α < 1/2, nous montrons que l'information requise a une taille de Θ(n).

Cet article est une version courte de l'article Time vs. Information Tradeoffs for Leader Election in Anonymous Trees paru a SODA'16.

https://hal.archives-ouvertes.fr/hal-01303693/document

Compromis temps-information pour l'élection de leader dans des arbres anonymes

Deterministic distributed construction of T-dominating sets in time T

We study virtual path layouts in ATM networks. Packets are routed along virtual paths in the network by maintaining a routing field whose subfields determine intermediate destinations of the packet, i.e., the endpoints of virtual paths on its way to the final destination. Most of the research on virtual path layouts has focused on tradeoffs between load (i.e., the maximum number of virtual paths passing through a link) and the hop number of the layout (i.e., the maximum number of virtual paths needed to travel between any two nodes). There is however another important limitation on construction of layouts, resulting from technological properties of switches situated at nodes. This bound is the degree of the layout (i.e., the maximum number of virtual paths with a common endpoint). In this paper we study relations between these three parameters of virtual path layouts, for the all-to-all problem. For any integer h, we show tradeoffs between load and degree of h-hop layouts in the ring and in the mesh by establishing upper and lower bounds on these parameters. Our bounds on the degree of an h-hop layout of given load are asymptotically tight and the bounds on the load of an h-hop layout of given degree are asymptotically tight for constant h.

Andrzej Pelc

Papers

Use of Information, Memory and Randomization in Asynchronous Gathering

Transducers with Set Output

Compromis temps-information pour l'élection de leader dans des arbres anonymes

Deterministic distributed construction of T-dominating sets in time T

Trade-offs between load and degree in virtual path layouts