Related papers: Sparse power-efficient topologies for wireless ad …
One of the limitations of wireless sensor nodes is their inherent limited energy resource. Besides maximizing the lifetime of the sensor node, it is preferable to distribute the energy dissipated throughout the wireless sensor network in…
Wireless Sensor Networks (WSNs) are highly distributed networks consisting of a large number of tiny, low-cost, light-weight wireless nodes deployed to monitor an environment or a system. Each node in a WSN consists of three subsystems: the…
In this paper we propose a distributed algorithm for the estimation and control of the connectivity of ad-hoc networks in the presence of a random topology. First, given a generic random graph, we introduce a novel stochastic power…
We consider the problem of dominating set-based virtual backbone used for routing in asymmetric wireless ad-hoc networks. These networks have non-uniform transmission ranges and are modeled using the well-established disk graphs. The…
Sparse recovery can recover sparse signals from a set of underdetermined linear measurements. Motivated by the need to monitor large-scale networks from a limited number of measurements, this paper addresses the problem of recovering sparse…
We propose Sparse Neural Network architectures that are based on random or structured bipartite graph topologies. Sparse architectures provide compression of the models learned and speed-ups of computations, they can also surpass their…
In this work, we analyze the advantages of multi-hop data fragmentation in unattended wireless sensor networks (UWSN) and propose a lightweight protocol to achieve it. UWSN has recently become an important aspect in various areas of sensor…
We consider a wireless ad hoc network in the presence of eavesdroppers (EDs), where the nodes are distributed according to independent Poisson point processes (PPPs). The legitimate nodes follow the half-duplex mode of operation employing…
Connectivity of wireless sensor networks (WSNs) is a fundamental global property expected to be maintained even though some sensor nodes are at fault. In this paper, we investigate the connectivity of random geometric graphs (RGGs) in the…
Deep learning is widely used in wireless communications but struggles with fixed neural network sizes, which limit their adaptability in environments where the number of users and antennas varies. To overcome this, this paper introduced a…
The sensor nodes in a Wireless Sensor Network are generally constrained with limited power supply. Efficient power management is a must for any sensor network to keep the sensor nodes in the network to be operational for a longer period of…
The interference at a wireless node s can be modelled by the number of wireless nodes whose transmission ranges cover s. Given a set of positions for wireless nodes, the interference minimization problem is to assign a transmission radius…
The revolution of wireless sensors networks (WSNs) has highly augmented the expectations of people to get the work done efficiently, but there is little bit impediment to deal with deployed nodes in WSNs. The nature of used routing and…
WSNs are envisioned to consist of many small devices that can sense the environment and communicate the data as required. The most critical requirement for widespread sensor networks is power efficiency since battery replacement is not…
The topology of a wireless multi-hop network can be controlled by varying the transmission power at each node. In this paper, we give a detailed analysis of a cone-based distributed topology control algorithm. This algorithm, introduced in…
We study a wireless ad-hoc sensor network (WASN) where $N$ sensors gather data from the surrounding environment and transmit their sensed information to $M$ fusion centers (FCs) via multi-hop wireless communications. This node deployment…
This paper, based on $k$-NN graph, presents symmetric $(k,j)$-NN graph $(1 \leq j < k)$, a brand new topology which could be adopted by a series of network-based structures. We show that the $k$ nearest neighbors of a node exert disparate…
Distributed power allocation is important for interference-limited wireless networks with dense transceiver pairs. In this paper, we aim to design low signaling overhead distributed power allocation schemes by using graph neural networks…
In a wireless network the set of transmitting nodes changes frequently because of the MAC scheduler and the traffic load. Previously, connectivity in wireless networks was analyzed using static geometric graphs, and as we show leads to an…
We investigate the connectivity of a wireless sensor network secured by the heterogeneous key predistribution scheme under an independent on/off channel model. The heterogeneous scheme induces an inhomogeneous random key graph, denoted by…