DIALM

We consider communication in radio networks modeled either as arbitrary graphs, or as collections of points in the plane, equipped with given ranges of reachability. We survey results concerning the time of broadcasting and gossiping in such networks ...

Given n sensors and m targets, a monitoring schedule is a partition of the sensor set such that each part of the partition can monitor all targets. Monitoring schedules are used to maximize the time all targets are monitored when there is no possibility ...

We present conflict-free and contention-based medium access control (MAC) protocols designed for resource-aware data collection in sensor networks. We are interested in the performance of these schemes when used in in-network data aggregation systems. ...

Self-stabilization ([Dij74], [Dolev00] is an important property of any dynamic long-lived system. Self-stabilizing systems may start operating in any arbitrary state, and can therefore recover following a temporary violation of the assumption made by ...

The study of information dissemination in social networks is an important endeavour, encompassing a variety of questions ranging from the purely technological to the spread of viruses and the diffusion of ideas in human communities. In order to gain ...

We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G=(V,E) with edge-weights w(e):e ∈ E and node battery capacities (b(v):v ∈ V), and two nodes r,s ∈ V, find a maximum integral rs-flow f so that for every node ...

In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node knows how many nodes there are in its geographical proximity, and another, ...

Given n arbitrarily distributed single-hop wireless links, using the physical interference model, the objective is to minimize the scheduling length. This is an open problem (Problem 1) proposed by Locher et al. [21]. In this paper, we solve this open ...

In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node continues this process until the packet arrives at its destination. This is ...

If V is a set of n points in the unit square [0,1]², and if R:V-> Re₊ is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: [v,w] is an undirected edge if and only if the Euclidean distance d(v,w) is less ...

We introduce and study random distance graph. A random distance, D(n,g) results from placing n points uniformly at random on the unit area disk and connecting every two points independently with probability g(d), where d is the distance between the ...

Motivated by the gateway placement problem in wireless networks, we consider the geometric k-centre problem on unit disc graphs: given a set of points P in the plane, find a set F of k points in the plane that minimizes the maximum graph distance from ...

In this paper, we present and discuss a distributed algorithm for the local message passing communication model that constructs a (1-ε)-approximate Maximum Weight Matching in a graph (ε > 0). The approach has a deterministic runtime of O(1/ε² log n. T_...