相关论文: Maximizing Reliability in WDM Networks through Lig…
We present DMaC, a novel distributed, finite-time algorithm that guarantees max-consensus in directed networks with unreliable communication links experiencing packet drops. Unlike existing methods, DMaC ensures all nodes compute the exact…
In modern energy networks, where operational efficiency and resilience are critical, this study introduces an in-depth analysis from a multiplex network perspective - defined as a network where multiple types of connections exist between…
This paper presents a machine learning strategy that tackles a distributed optimization task in a wireless network with an arbitrary number of randomly interconnected nodes. Individual nodes decide their optimal states with distributed…
Network optimization has generally been focused on solving network flow problems, but recently there have been investigations into optimizing network characteristics. Optimizing network connectivity to maximize the number of nodes within a…
Transportation infrastructures, particularly those supporting intermodal freight, are vulnerable to natural disasters and man-made disasters that could lead to severe service disruptions. These disruptions can drastically degrade the…
This paper analyzes the localization outage probability (LOP), the probability that the position error exceeds a given threshold, in randomly deployed wireless networks. Two typical cases are considered: a mobile agent uses all the…
Location information is often used as a proxy to infer the performance of a wireless communication link. Using a very simple model, this letter unveils a basic statistical relation between the location estimation uncertainty and wireless…
Real-world applications such as the internet of things, wireless sensor networks, smart grids, transportation networks, communication networks, social networks, and computer grid systems are typically modeled as network structures. Network…
This paper considers structural optimization under a reliability constraint, where the input distribution is only partially known. Specifically, when we only know that the expected value vector and the variance-covariance matrix of the…
The deterministic channel model for wireless relay networks proposed by Avestimehr, Diggavi and Tse `07 has captured the broadcast and inference nature of wireless communications and has been widely used in approximating the capacity of…
The allocation of scarce spectral resources to support as many user applications as possible while maintaining reasonable quality of service is a fundamental problem in wireless communication. We argue that the problem is best formulated in…
In several multiobjective decision problems Pairwise Comparison Matrices (PCM) are applied to evaluate the decision variants. The problem that arises very often is the inconsistency of a given PCM. In such a situation it is important to…
Unlike traditional routing procedures that, at the best, single out a unique route, multi-path routing protocols discover proactively several alternative routes. It has been recognized that multi-path routing can be more efficient than…
This paper investigates the problem of link scheduling to meet traffic demands with minimum airtime in a multi-transmit-receive (MTR) wireless network. MTR networks are a new class of networks, in which each node can simultaneously transmit…
The important problem of weighted sum rate maximization (WSRM) in a multicellular environment is intrinsically sensitive to channel estimation errors. In this paper, we study ways to maximize the weighted sum rate in a linearly precoded…
Traditional topology-based MANET routing protocols use stateful routing which increases the processing,communication and memory overheads. The high mobility of nodes in MANETs makes it difficult to maintain a deterministic route. To…
We consider the problem of sending a message from a sender $s$ to a receiver $r$ through an unreliable network by specifying in a protocol what each vertex is supposed to do if it receives the message from one of its neighbors. A protocol…
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper investigates how big the failure probability can be, before the…
This work addresses the problem of evaluating optimal link capacities of a packet-flow network for the objective of congestion minimization. We present a simple model of packet flow in networks and present a numerical approach to evaluate…
We investigate the capability of localizing node failures in communication networks from binary states (normal/failed) of end-to-end paths. Given a set of nodes of interest, uniquely localizing failures within this set requires that…