Related papers: Energy-Efficient Naming in Beeping Networks
Prolonged network lifetime, scalability and efficient load balancing are essential for optimal performance of a wireless sensor network. Clustering provides an effective way of extending the lifetime of a sensor network. Clustering is the…
In Mobile Ad-Hoc networks, broadcasting is a fundamental operation in the network layer. A node transmits a rebroadcast message to any or all other nodes whenever it receives for the first time. It will generate several redundant…
We consider a Min-Power Bounded-Hops Symmetric Connectivity problem that consists in the construction of communication spanning tree on a given graph, where the total energy consumption spent for the data transmission is minimized and the…
We consider communication-efficient weighted and unweighted (uniform) random sampling from distributed data streams presented as a sequence of mini-batches of items. This is a natural model for distributed streaming computation, and our…
We study robust and efficient distributed algorithms for searching, storing, and maintaining data in dynamic Peer-to-Peer (P2P) networks. P2P networks are highly dynamic networks that experience heavy node churn (i.e., nodes join and leave…
We consider the problem of constructing distributed overlay networks, where nodes in a reconfigurable system can create or sever connections with nodes whose identifiers they know. Initially, each node knows only its own and its neighbors'…
The distributed optimization problem has become increasingly relevant recently. It has a lot of advantages such as processing a large amount of data in less time compared to non-distributed methods. However, most distributed approaches…
Given a budget and arbitrary cost for selecting each node, the budgeted influence maximization (BIM) problem concerns selecting a set of seed nodes to disseminate some information that maximizes the total number of nodes influenced (termed…
In this work, we are concerned with maximizing the lifetime of a cluster of sensors engaged in single-hop communication with a base-station. In a data-gathering network, the spatio-temporal correlation in sensor data induces…
In this paper, we present two randomized distributed algorithms in wireless ad hoc networks. We consider that the network is structured into pairs of nodes (sender, receiver) in a decay space. We take into account the following: Each node…
We consider the standard message passing model; we assume the system is fully synchronous: all processes start at the same time and time proceeds in synchronised rounds. In each round each vertex can transmit a different message of size…
This paper analyzes the throughput of industrial communication networks under a secrecy constraint. The proposed scenario is composed by sensors that measure some relevant information of the plant that is first processed by aggregator node…
This paper considers distributed computing on an anonymous quantum network, a network in which no party has a unique identifier and quantum communication and computation are available. It is proved that the leader election problem can…
This paper deals with energy management in a district where multiple buildings can communicate over a time-varying network and aim at optimizing the use of shared resources like storage systems. We focus on building cooling, and propose an…
This comment recalls a previously proposed encoding scheme involving two synchronized random number generators (RNGs) to compress the transmission message. It is also claimed that the recently proposed random number modulation (RNM) scheme…
This paper concerns designing distributed algorithms that are singularly optimal, i.e., algorithms that are simultaneously time and message optimal, for the fundamental leader election problem in networks. Our main result is a randomized…
Modeling distributed computing in a way enabling the use of formal methods is a challenge that has been approached from different angles, among which two techniques emerged at the turn of the century: protocol complexes, and directed…
The broadcast throughput in a network is defined as the average number of messages that can be transmitted per unit time from a given source to all other nodes when time goes to infinity. Classical broadcast algorithms treat messages as…
We present an $O(\log^3\log n)$-round distributed algorithm for the $(\Delta+1)$-coloring problem, where each node broadcasts only one $O(\log n)$-bit message per round to its neighbors. Previously, the best such broadcast-based algorithm…
The {Congested Clique} is a distributed-computing model for single-hop networks with restricted bandwidth that has been very intensively studied recently. It models a network by an $n$-vertex graph in which any pair of vertices can…