Related papers: Efficient Algorithms and Routing Protocols for Han…
We investigate the vulnerabilities of consensus-based distributed optimization protocols to nodes that deviate from the prescribed update rule (e.g., due to failures or adversarial attacks). We first characterize certain fundamental…
We consider the problem of secure unicast transmission between two nodes in a directed graph, where an adversary eavesdrops/jams a subset of nodes. This adversarial setting is in contrast to traditional ones where the adversary controls a…
In this paper, we consider a bidirectional relay network with half-duplex nodes and block fading where the nodes transmit with a fixed transmission rate. Thereby, user 1 and user 2 exchange information only via a relay node, i.e., a direct…
Robust network design, which aims to guarantee network availability under various failure scenarios while optimizing performance/cost objectives, has received significant attention. Existing approaches often rely on model-based…
Routing algorithms for wireless sensor networks can be broadly divided into two classes - proactive and reactive. Proactive routing is suitable for a network with a fixed topology. On the other hand, reactive routing is more suitable for a…
This paper studies online shortest path routing over multi-hop networks. Link costs or delays are time-varying and modeled by independent and identically distributed random processes, whose parameters are initially unknown. The parameters,…
This paper presents a self-organizing protocol for dynamic (unstructured P2P) overlay networks, which allows to react to the variability of node arrivals and departures. Through local interactions, the protocol avoids that the departure of…
Whether as telecommunications or power systems, networks are very important in everyday life. Maintaining these networks properly functional and connected, even under attacks or failures, is of special concern. This topic has been…
Protecting against link failures in communication networks is essential to increase robustness, accessibility, and reliability of data transmission. Recently, network coding has been proposed as a solution to provide agile and cost…
Link and node failures are common two fundamental problems that affect operational networks. Hence, protection of communication networks is essential to increase their reliability, performance, and operations. Much research work has been…
A central issue in complex networks is tolerance to random failures and intentional attacks. Current literature emphasizes the dichotomy between networks with a power-law node connectivity distribution, which are robust to random failures…
The performance of Mobile Ad hoc networks (MANET) depends on the cooperation of all active nodes. However, supporting a MANET is a cost-intensive activity for a mobile node. From a single mobile node perspective, the detection of routes as…
Centrality metrics have been widely applied to identify the nodes in a graph whose removal is effective in decomposing the graph into smaller sub-components. The node--removal process is generally used to test network robustness against…
This paper presents an analytical framework to model fault-tolerance in unstructured peer-to-peer overlays, represented as complex networks. We define a distributed protocol peers execute for managing the overlay and reacting to node…
In this work and the supporting Parts II [2] and III [3], we provide a rather detailed analysis of the stability and performance of asynchronous strategies for solving distributed optimization and adaptation problems over networks. We…
Internet is composed of numbers of independent autonomous systems. BGP is used to disseminate reachability information and establishing path between autonomous systems. Each autonomous system is allowed to select a single route to a…
Communication in poor network environment is always a difficult problem, since troubles such as bit errors and packet loss may often occur. It is generally believed that it is impossible to transmit data both accurately and efficiently in…
Intelligent routing in networks has opened up many challenges in modelling and methods, over the past decade. Many techniques do exist for routing on such an environment where path determination was carried out by advertisement, position…
Graph neural networks (GNNs) work remarkably well in semi-supervised node regression, yet a rigorous theory explaining when and why they succeed remains lacking. To address this gap, we study an aggregate-and-readout model that encompasses…
We propose a generic system model for a special category of interdependent networks, demand-supply networks, in which the demand and the supply nodes are associated with heterogeneous loads and resources, respectively. Our model sheds a…