Related papers: Relay Augmentation for Lifetime Extension of Wirel…
In this paper, we consider a wireless powered communication network where multiple users with RF energy harvesting capabilities communicate to a hybrid energy and information access point (HAP) in full-duplex mode. Each user has to transmit…
This paper studies a novel mobile relaying technique, where relays of high mobility are employed to assist the communications from source to destination. By exploiting the predictable channel variations introduced by relay mobility, we…
This paper addresses the problem of optimizing sensor deployment locations to reconstruct and also predict a spatiotemporal field. A novel deep learning framework is developed to find a limited number of optimal sampling locations and based…
We study the NP-hard problem of approximating a Minimum Routing Cost Spanning Tree in the message passing model with limited bandwidth (CONGEST model). In this problem one tries to find a spanning tree of a graph $G$ over $n$ nodes that…
Connectivity and coverage are two crucial problems for wireless sensor networks. Several studies have focused on proposing solutions for improving and adjusting the initial deployment of a wireless sensor network to meet these two criteria.…
Processing graphs with temporal information (the temporal graphs) has become increasingly important in the real world. In this paper, we study efficient solutions to temporal graph applications using new algorithms for Incremental Minimum…
Energy is one of the most important and scarce resources in Wireless Sensor Networks (WSN). WSN nodes work with the embedded operating system called TinyOS, which addresses the constrains of the WSN nodes such as limited processing power,…
This paper proposes a stable sparse rapidly-exploring random trees (SST) algorithm to solve the optimal motion planning problem for hybrid systems. At each iteration, the proposed algorithm, called HySST, selects a vertex with the lowest…
In this paper, we investigate a novel minimum length scheduling problem to determine the optimal power control, and scheduling for constant and continuous rate models, while considering concurrent transmission of users, energy causality,…
One of the fundamental issue in wireless sensor network is conserving energy and thus extending the lifetime of the network. In this paper we investigate the coverage problem in camera sensor networks by developing two algorithms which…
This paper presents a robust and efficient method for tracking topological features in time-varying scalar data. Structures are tracked based on the optimal matching between persistence diagrams with respect to the Wasserstein metric. This…
In Wireless Sensor Network, sensor nodes life time is the most critical parameter. Many researches on these lifetime extension are motivated by LEACH scheme, which by allowing rotation of cluster head role among the sensor nodes tries to…
To reduce the latency of Backpressure (BP) routing in wireless multi-hop networks, we propose to enhance the existing shortest path-biased BP (SP-BP) and sojourn time-based backlog metrics, since they introduce no additional time step-wise…
Due to its broad applications in practice, the minimum spanning tree problem and its all kinds of variations have been studied extensively during the last decades, for which a host of efficient exact and heuristic algorithms have been…
We investigate methods for network association that improve the reliability of uplink transmissions in dense wireless heterogeneous networks. The stochastic geometry analysis shows that the double association, in which an uplink…
To make better use of file diversity provided by random caching and improve the successful transmission probability (STP) of a file, we consider retransmissions with random discontinuous transmission (DTX) in a large-scale cache-enabled…
The resiliency of a network is its ability to remain \emph{effectively} functioning also when any of its nodes or links fails. However, to reduce operational and set-up costs, a network should be small in size, and this conflicts with the…
This paper proposes a novel distributed reduced--rank scheme and an adaptive algorithm for distributed estimation in wireless sensor networks. The proposed distributed scheme is based on a transformation that performs dimensionality…
Topology control, including topology construction and maintenance phases, is a vital conception for wireless ad-hoc networks of any kind, expressly the wireless sensor networks (WSN). Topology maintenance, the latter phase, concerns several…
In the Steiner Tree Augmentation Problem (STAP), we are given a graph $G = (V,E)$, a set of terminals $R \subseteq V$, and a Steiner tree $T$ spanning $R$. The edges $L := E \setminus E(T)$ are called links and have non-negative costs. The…