Related papers: High-Energy-First (HEF) Heuristic for Energy-Effic…
We consider the remote estimation of a time-correlated signal using an energy harvesting (EH) sensor. The sensor observes the unknown signal and communicates its observations to a remote fusion center using an amplify-and-forward strategy.…
Recently, Wireless Rechargeable Sensor Networks (WRSNs) that leveraged the advantage of wireless energy transfer technology have opened a promising opportunity in solving the limited energy issue. However, an ineffective charging strategy…
As many sensor network applications require deployment in remote and hard-to-reach areas, it is critical to ensure that such networks are capable of operating unattended for long durations. Consequently, the concept of using nodes with…
Joint optimization of scheduling and estimation policies is considered for a system with two sensors and two non-collocated estimators. Each sensor produces an independent and identically distributed sequence of random variables, and each…
Energy Harvesting (EH) is a novel technique to prolong the lifetime of the wireless networks such as wireless sensor networks or Ad-Hoc networks, by providing an unlimited source of energy for their nodes. In this sense, it has emerged as a…
Most of the wireless sensor networks consist of static sensors, which can be deployed in a wide environment for monitoring applications. While transmitting the data from source to static sink, the amount of energy consumption of the sensor…
In the dynamic set cover problem, the input is a dynamic universe of elements and a fixed collection of sets. As elements are inserted or deleted, the goal is to efficiently maintain an approximate minimum set cover. While the past decade…
In this paper, we present a novel problem of optimal placement of sensor nodes in wirelessly rechargeable Wireless Sensor Networks (WSNs) wrt. a charging requirement constraint and a task utility requirement constraint. We call this problem…
The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field is monitored by its sensor nodes. This problem has attracted a lot of interest over the years and as a result,…
We consider a wireless sensor network, consisting of N heterogeneous sensors and a fusion center (FC), tasked with detecting a known signal in uncorrelated Gaussian noises. Each sensor can harvest randomly arriving energy and store it in a…
Wireless sensor networks have attracted much attention because of many applications in the fields of industry, military, medicine, agriculture, and education. In addition, the vast majority of researches has been done to expand its…
This paper considers three related mobile robot multi-target sensory coverage and inspection planning problems in 2-D environments. In the first problem, a mobile robot must find the shortest path to observe multiple targets with a limited…
In this paper we study the problem of tracking an object moving randomly through a network of wireless sensors. Our objective is to devise strategies for scheduling the sensors to optimize the tradeoff between tracking performance and…
In a rechargeable wireless sensor network, the data packets are generated by sensor nodes at a specific data rate, and transmitted to a base station. Moreover, the base station transfers power to the nodes by using Wireless Power Transfer…
This paper investigates the optimal signal detection problem with a particular interest in large-scale multiple-input multiple-output (MIMO) systems. The problem is NP-hard and can be solved optimally by searching the shortest path on the…
For both the edge deletion heuristic and the maximum-degree greedy heuristic, we study the problem of recognizing those graphs for which that heuristic can approximate the size of a minimum vertex cover within a constant factor of r, where…
Social groups give the opportunity for a new form of caching. In this paper, we investigate how a social group of users can jointly optimize bandwidth usage, by each caching parts of the data demand, and then opportunistically share these…
Given a set of directional visual sensors, the $k$-coverage problem determines the orientation of minimal directional sensors so that each target is covered at least $k$ times. As the problem is NP-complete, a number of heuristics have been…
In this paper, we study the performance of greedy scheduling in multihop wireless networks, where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. The…
One of the main concerns in traditional Wireless Sensor Networks (WSNs) is energy efficiency. In this work, we analyze two techniques that can extend network lifetime. The first is Ambient \emph{Energy Harvesting} (EH), i.e., the capability…