相关论文: How Well Can Graphs Represent Wireless Interferenc…

We study the wireless scheduling problem in the SINR model. More specifically, given a set of $n$ links, each a sender-receiver pair, we wish to partition (or \emph{schedule}) the links into the minimum number of slots, each satisfying…

Studying network robustness for wireless sensor networks(WSNs) is an exciting topic of research as sensor nodes often fail due to hardware degradation, resource constraints, and environmental changes. The application of spectral graph…

Given a graph $F$, let $I(F)$ be the class of graphs containing $F$ as an induced subgraph. Let $W[F]$ denote the minimum $k$ such that $I(F)$ is definable in $k$-variable first-order logic. The recognition problem of $I(F)$, known as…

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…

Modern control systems routinely employ wireless networks to exchange information between spatially distributed plants, actuators and sensors. With wireless networks defined by random, rapidly changing transmission conditions that challenge…

We introduce and explore a family of vertex-coloring problems which, surprisingly enough, have not been considered before despite stemming from the problem of Wi-Fi channel assignment. Given a spectrum of colors, endowed with a matrix of…

The analysis of signal-to-interference ratios (SIRs) in wireless networks is instrumental to derive important performance metrics, including reliability, throughput, and delay. While a host of results on SIR distributions are now available,…

Since its first use by Euler on the problem of the seven bridges of K\"onigsberg, graph theory has shown excellent abilities in solving and unveiling the properties of multiple discrete optimization problems. The study of the structure of…

Inductive $k$-independent graphs generalize chordal graphs and have recently been advocated in the context of interference-avoiding wireless communication scheduling. The NP-hard problem of finding maximum-weight induced $c$-colorable…

The design of energy and spectrally efficient Wireless Sensor Networks (WSN) is crucial to support the upcoming expansion of IoT/M2M mobile data traffic. In this work, we consider an energy harvesting WSN where sensor data are periodically…

This thesis focuses on link scheduling in wireless mesh networks by taking into account physical layer characteristics. The assumption made throughout is that a packet is received successfully only if the Signal to Interference and Noise…

A new precoding-based intersession network coding (NC) scheme has recently been proposed, which applies the interference alignment technique, originally devised for wireless interference channels, to the 3-unicast problem of directed…

This paper studies the maximization of the weighted sum energy efficiency (WSEE). We derive a first-order optimal algorithm applicable to a wide class of communication scenarios exhibiting very fast convergence. We also discuss how to…

We consider the problem of aggregating data in a dynamic graph, that is, aggregating the data that originates from all nodes in the graph to a specific node, the sink. We are interested in giving lower bounds for this problem, under…

Network inference is the process of deciding what is the true unknown graph underlying a set of interactions between nodes. There is a vast literature on the subject, but most known methods have an important drawback: the inferred graph is…

This paper considers a wireless communication network consisting of multiple interfering multicast sessions. Different from a unicast system where each transmitter has only one receiver, in a multicast system, each transmitter has multiple…

Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructible if they do get disrupted. These desirable properties of networks can be measured…

Communication over a multiple access channel is considered. Each user modulates his signal as a superposition of redundant data streams where interconnection of data bits can be represented by means of a sparse graph. The receiver observes…

Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…

In several applications in distributed systems, an important design criterion is ensuring that the network is sparse, i.e., does not contain too many edges, while achieving reliable connectivity. Sparsity ensures communication overhead…