Related papers: On the Network Reliability Problem of the Heteroge…

Sensor networks technologies had proved their great practicability in the real world, being just a matter of time until this kind of networks will be standardized and used in the field. This paper presents a new approach to secure the…

We propose a graph neural network (GNN)-based method to predict the distribution of penalties induced by outages in communication networks, where connections are protected by resources shared between working and backup paths. The GNN-based…

Distributed estimation in interconnected systems has gained increasing attention due to its relevance in diverse applications such as sensor networks, autonomous vehicles, and cloud computing. In real practice, the sensor network may suffer…

A fundamental problem in the design of wireless networks is to efficiently schedule transmission in a distributed manner. The main challenge stems from the fact that optimal link scheduling involves solving a maximum weighted independent…

This work studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes…

As an emerging artificial intelligence technology, graph neural networks (GNNs) have exhibited promising performance across a wide range of graph-related applications. However, information exchanges among neighbor nodes in GNN pose new…

Despite the exploding interest in graph neural networks there has been little effort to verify and improve their robustness. This is even more alarming given recent findings showing that they are extremely vulnerable to adversarial attacks…

Random key graphs are random graphs induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. For this class of random graphs we show the existence of a zero-one law for the…

Given an undirected graph $G$ whose edge weights change over $s$ time slots, the sub-tree scheduling for wireless sensor networks with partial coverage asks to partition the vertices of $G$ in $s$ non-empty trees such that the total weight…

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…

Graph neural network (GNN) is an efficient neural network model for graph data and is widely used in different fields, including wireless communications. Different from other neural network models, GNN can be implemented in a decentralized…

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…

The classic all-terminal network reliability problem posits a graph, each of whose edges fails independently with some given probability.

Now a day's Heterogeneous wireless network is a promising field of research interest. Various challenges exist in this hybrid combination like load balancing, resource management and so on. In this paper we introduce a reliable load…

Periodic gossip algorithms have generated a lot of interest due to their ability to compute the global statistics by using local pairwise communications among nodes. Simple execution, robustness to topology changes, and distributed nature…

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…

Information-theoretic security -- widely accepted as the strictest notion of security -- relies on channel coding techniques that exploit the inherent randomness of the propagation channels to significantly strengthen the security of…

Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of…

This report deals with security in wireless sensor networks (WSNs), especially in network layer. Multiple secure routing protocols have been proposed in the literature. However, they often use the cryptography to secure routing…

A networked system can be made resilient against adversaries and attacks if the underlying network graph is structurally robust. For instance, to achieve distributed consensus in the presence of adversaries, the underlying network graph…