Related papers: Data Dissemination Problem in Wireless Networks
The distributed index coding problem is studied, whereby multiple messages are stored at different servers to be broadcast to receivers with side information. First, the existing composite coding scheme is enhanced for the centralized…
A general open problem in networking is: what are the fundamental limits to the performance that is achievable with some given amount of resources? More specifically, if each node in the network has information about only its $1$-hop…
We study the replacement paths problem in the $\mathsf{CONGEST}$ model of distributed computing. Given an $s$-$t$ shortest path $P$, the goal is to compute, for every edge $e$ in $P$, the shortest-path distance from $s$ to $t$ avoiding $e$.…
This thesis is concerned with the design of distributed algorithms for solving optimization problems. We consider networks where each node has exclusive access to a cost function, and design algorithms that make all nodes cooperate to find…
Many problems of interest for cyber-physical network systems can be formulated as Mixed-Integer Linear Programs in which the constraints are distributed among the agents. In this paper we propose a distributed algorithmic framework to solve…
In a model of network communication based on a random walk in an undirected graph, what subset of nodes (subject to constraints on the set size), enable the fastest spread of information? The dynamics of spread is described by a process…
We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We present a new algorithm for computation of the maximum value which is order optimal in the number of transmissions…
Given a graph and a subset of its nodes, referred to as source nodes, the minimum broadcast problem asks for the minimum number of steps in which a signal can be transmitted from the sources to all other nodes in the graph. In each step,…
Pliable index coding considers a server with m messages, and n clients where each has as side information a subset of the messages. We seek to minimize the number of transmissions the server should make, so that each client receives (any)…
A wireless network's design must include the optimization of the area of coverage of its wireless transmitters - mobile and base stations in cellular networks, wireless access points in WLANs, or nodes on a transmit schedule in a wireless…
Consider a wireless network where each communication link has a minimum bandwidth quality-of-service requirement. Certain pairs of wireless links interfere with each other due to being in the same vicinity, and this interference is modeled…
Given a wireless network where some pairs of communication links interfere with each other, we study sufficient conditions for determining whether a given set of minimum bandwidth quality-of-service (QoS) requirements can be satisfied. We…
In this paper, we study the minimum dominating set (MDS) problem and the minimum total dominating set MTDS) problem which have many applications in real world. We propose a new idea to compute approximate MDS and MTDS. Next, we give an…
Data shuffling between distributed cluster of nodes is one of the critical steps in implementing large-scale learning algorithms. Randomly shuffling the data-set among a cluster of workers allows different nodes to obtain fresh data…
Optimal percolation is the problem of finding the minimal set of nodes such that if the members of this set are removed from a network, the network is fragmented into non-extensive disconnected clusters. The solution of the optimal…
Distributed configuration management is imperative for wireless infrastructureless networks where each node adjusts locally its physical and logical configuration through information exchange with neighbors. Two issues remain open. The…
In this paper we consider the problem of communication scheduling in wireless networks with respect to the SINR(Signal to Interference plus Noise Ratio) constraint in metric spaces. The nodes are assigned linear powers, i.e. for each sender…
Emerging optical and virtualization technologies enable the design of more flexible and demand-aware networked systems, in which resources can be optimized toward the actual workload they serve. For example, in a demand-aware datacenter…
Overheads incurred by routing protocols diminish the capacity available for relaying useful data in a mobile wireless ad hoc network. Discovering lower bounds on the amount of protocol overhead incurred for routing data packets is important…
Recently, there has been an increasing interest in designing distributed convex optimization algorithms under the setting where the data matrix is partitioned on features. Algorithms under this setting sometimes have many advantages over…