Related papers: Node Isolation of Secure Wireless Sensor Networks …
Previous work on network coding capacity for random wired and wireless networks have focused on the case where the capacities of links in the network are independent. In this paper, we consider a more realistic model, where wireless…
The methods of non-homogeneous random graphs calibration are developed for social networks simulation. The graphs are calibrated by the degree distributions of the vertices and the edges. The mathematical foundation of the methods is formed…
We study a heterogeneous two-tier wireless sensor network in which N heterogeneous access points (APs) collect sensing data from densely distributed sensors and then forward the data to M heterogeneous fusion centers (FCs). This…
Let $N$ local decision makers in a sensor network communicate with their neighbors to reach a decision \emph{consensus}. Communication is local, among neighboring sensors only, through noiseless or noisy links. We study the design of the…
In random graph models, the degree distribution of an individual node should be distinguished from the (empirical) degree distribution of the graph that records the fractions of nodes with given degree. We introduce a general framework to…
We study a multi-type SIR epidemic process among a heterogeneous population that interacts through a network. When we base social contact on a random graph with given vertex degrees, we give limit theorems on the fraction of infected…
Soft Random Geometric Graphs (SRGGs) have been widely applied to various models including those of wireless sensor, communication, social and neural networks. SRGGs are constructed by randomly placing nodes in some space and making pairwise…
Sensor networks aim at monitoring their surroundings for event detection and object tracking. But, due to failure, or death of sensors, false signal can be transmitted. In this paper, we consider the problems of distributed fault detection…
Future wireless networks are required to support 1000 times higher data rate, than the current LTE standard. In order to meet the ever increasing demand, it is inevitable that, future wireless networks will have to develop seamless…
Heterogeneous applications could be assimilated within the same wireless sensor network with the aid of modern motes that have multiple sensor boards on a single radio board. Different types of data generated from such types of motes might…
Complex systems, ranging from soft materials to wireless communication, are often organised as random geometric networks in which nodes and edges evenly fill up the volume of some space. Studying such networks is difficult because they…
We introduce the problem of finding a spanning tree along with a partition of the tree edges into fewest number of feasible sets, where constraints on the edges define feasibility. The motivation comes from wireless networking, where we…
Rigidity theory enables us to specify the conditions of unique localizability in the cooperative localization problem of wireless sensor networks. This paper presents a combinatorial rigidity approach to measure (i) generic rigidity and…
In this manuscript, we consider the problems of channel assignment in wireless networks and data migration in heterogeneous storage systems. We show that a soft edge coloring approach to both problems gives rigorous approximation…
In this paper, we study classification and regression error bounds for inhomogenous data that are independent but not necessarily identically distributed. First, we consider classification of data in the presence of non-stationary noise and…
The fault tolerance of random graphs with unbounded degrees with respect to connectivity is investigated, which relates to the reliability of wireless sensor networks with unreliable relay nodes. The model evaluates the network breakdown…
A fundamental problem in wireless sensor networks is to connect a given set of sensors while minimizing the \emph{receiver interference}. This is modeled as follows: each sensor node corresponds to a point in $\mathbb{R}^d$ and each…
We consider the problem of binary power control, or link scheduling, in wireless interference networks, where the power control policy is trained using graph representation learning. We leverage the interference graph of the wireless…
The optimal allocation of channels and power resources plays a crucial role in ensuring minimal interference, maximal data rates, and efficient energy utilisation. As a successful approach for tackling resource management problems in…
Wireless sensor networks (WSNs) have recently attracted a lot of interest in the research community due their wide range of applications. Unfortunately, these networks are vulnerable to numerous security threats that can adversely affect…