Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but because of its extreme redundancy, it is impractical in dense networks. Indeed in large wireless networks, the use of flooding algorithms may lead to broadcast storms where the number of collisions is so large that it causes sys...

This paper proposes and investigates a framework for clique gossip protocols. As complete subnetworks, the existence of cliques is ubiquitous in various social, computer, and engineering networks. By clique gossiping, nodes interact with each other along a sequence of cliques. Clique-gossip protocols are defined as arbitrary linear node interactions where node states are vectors evolving as lin...

This paper continues with the study of the communication modes introduced in, University of Paderborn. (Extended abstract presented at WG'93.)] as a generalization of the standard one-way and two-way modes allowing to send messages between processors of interconnection networks via vertex-disjoint paths in one communication step. The complexity of communication algorithms is measured by the num...

To balance production and consumption on the power grid, efforts are mostly made on the production side. Demand response allows to harness electricity consumption to overcome the constraints brought by the democratisation of renewable energy sources and self-production. In this context, the main problem is to coordinate agents, representing the network’s nodes, in order for them to be able to a...

We study distributed algorithms, also known as gossip algorithms, for information dissemination in an arbitrary connected network of nodes. Distributed algorithms have applications to peer-to-peer, sensor, and ad hoc networks, in which nodes operate under limited computational, communication, and energy resources. These constraints naturally give rise to “gossip” algorithms: schemes in which no...

Many ad hoc routing algorithms rely on broadcast flooding for location discovery or more generally for secure routing applications, particularly when dealing with Byzantine threats. Flooding is a robust algorithm but, because of its extreme redundancy, it is impractical in dense networks. Indeed in large wireless networks, the use of flooding algorithms may lead to a broadcast storm in which th...

In this paper, we consider a privacy preserving scenario where users in the network want to perform distributed target source estimation with a wireless acoustic sensor network (WASN), without revealing the actual source of interest to other entities in the network. This implies that users do not share the steering vector of the beamformer with any other party. For distributed multi-channel noi...

We consider scheduling distributable threads that are subject to dependencies (e.g., due to mutual exclusion constraints) in ad hoc networks, in the presence of node and link failures, message losses, and dynamic node joins and departures. We present a gossip-based distributed scheduling algorithm, called Real-Time Gossip algorithm for Dependencies (or RTG-D). RTG-D builds upon our prior algori...