Academia.eduAcademia.edu

sensor scheduling

description109 papers
group1 follower
lightbulbAbout this topic
Sensor scheduling is the process of determining the optimal allocation and timing of sensor resources to collect data efficiently while minimizing energy consumption and maximizing information gain. It involves algorithms and strategies to manage sensor networks, ensuring effective monitoring and data acquisition in various applications.
lightbulbAbout this topic
Sensor scheduling is the process of determining the optimal allocation and timing of sensor resources to collect data efficiently while minimizing energy consumption and maximizing information gain. It involves algorithms and strategies to manage sensor networks, ensuring effective monitoring and data acquisition in various applications.

Key research themes

1. How can energy-efficient node scheduling schemes extend wireless sensor network lifetime while ensuring QoS requirements like coverage and connectivity?

This research area focuses on designing and analyzing scheduling algorithms that selectively activate subsets of sensor nodes over time to prolong network life by conserving energy, while simultaneously maintaining essential Quality of Service (QoS) parameters such as area coverage, network connectivity, fault tolerance, and security. Node scheduling leverages sensor redundancy to minimize active nodes in each time slot without sacrificing sensing performance and communication reliability, pertinent for remote and hostile deployment environments.

Key finding: The paper proposes an energy management life-cycle model and energy conservation pyramid emphasizing node scheduling as a flexible scheme that identifies multiple disjoint sets of non-redundant sensor nodes to activate in... Read more
Key finding: This paper presents a novel distributed scheduling medium access control (DSMAC) algorithm that leverages a geometric sensor placement strategy optimizing node deployment to achieve full region coverage and network... Read more
Key finding: The authors provide a self-adjusting node scheduling approach that dynamically manages duty cycles in heterogeneous sensor networks to meet differentiated coverage requirements, ensuring adequate coverage levels per network... Read more
Key finding: This work formulates the problem of scheduling sensors with heterogeneous coverage frequency requirements per target and proposes polynomial-time approximation algorithms that minimize the maximum number of concurrently... Read more

2. How can mobile sensor scheduling optimize spatiotemporal detection performance under constraints of limited mobility and energy?

This theme investigates integrating mobile sensors into static wireless sensor networks to dynamically reconfigure sensing coverage and improve detection performance. It addresses the challenges of limited mobile node counts, constrained movement speed and distance due to battery limitations, and efficient collaboration between static and mobile nodes. Key research here develops algorithms to schedule sensor movement that minimize energy-consuming mobility costs while ensuring high detection probability, low false alarms, and bounded detection delay for mission-critical applications.

Key finding: The authors propose a data-fusion-based detection model enabling collaboration between mobile and static sensors, and develop an optimal movement scheduling algorithm that minimizes the total distance mobile sensors must move... Read more

3. What are the trade-offs and algorithmic solutions for time slot allocation and duty cycling to reduce data collisions and latency in high data-load and mobile wireless sensor networks?

This research focuses on mitigating collision-induced data loss, latency, and energy wastage in wireless sensor networks, especially under data-intensive application scenarios and with mobile sensors. It explores MAC layer scheduling approaches that assign time slots in a distributed and scalable manner, addressing mobility, network overhead, and stringent delay constraints, thereby improving throughput and packet delivery while balancing resource usage across static and moving sensor nodes.

Key finding: The paper proposes a distributed scheduling algorithm employing virtual grids and Latin Squares properties for conflict-free time slot allocation without global coordination. The method efficiently handles network mobility... Read more
Key finding: Although primarily focused on coverage, this scheduling approach also reduces the maximum concurrent active sensors, effectively alleviating contention and collisions in dense sensor deployments by controlling duty cycles.... Read more
Key finding: This work introduces a sleep scheduling method designed to reduce broadcasting delay in alarm dissemination in large-scale WSNs monitoring rare critical events. By pre-designing traffic paths and orchestrating level-by-level... Read more

All papers in sensor scheduling

Vision systems are increasingly being deployed to perform complex surveillance tasks. While improved algorithms are being developed to perform these tasks, it is also important that data suitable for these algorithms be acquired -a... more
This paper presents a game theoretic approach for the management of multiple mobile sensors. Our approach can maintain tracks of smart targets under possibly adversarial environments. To ensure computational tractability, sensor... more
In a wireless sensor network, eliminating redundancies in area coverage in the deployment zone represents a major challenge where the stake is its lifetime increase. Current works dealing with this topic use different deterministic or... more
A critical aspect of applications with wireless sensor networks is network lifetime. Sensing and communications consume energy particularly in wireless multimedia sensor networks (WMSN) due to huge amount of data generated by the... more
To cover a set of targets with known locations within an area with limited or prohibited ground access using a wireless sensor network, one approach is to deploy the sensors remotely, from an aircraft. In this approach, the lack of... more
To cover a set of targets with known locations within an area with limited or prohibited ground access using a wireless sensor network, one approach is to deploy the sensors remotely, from an aircraft. In this approach, the lack of... more
We study the problem of sensor scheduling for multisensor multitarget tracking-to determine which sensors to activate over time to trade off tracking error with sensor usage costs. Formulating this problem as a Partially Observable Markov... more
In Electronic Support, a receiver must monitor a wide frequency spectrum in which threatening emitters operate. A common approach is to use sensors with high sensitivity but a narrow bandwidth. To maintain surveillance over the whole... more
In a wireless sensor network, eliminating redundancies in area coverage in the deployment zone represents a major challenge where the stake is its lifetime increase. Current works dealing with this topic use different deterministic or... more
This paper presents mathematical programming techniques for solving a class of multi-sensor scheduling problems. Robust optimization problems are formulated for both deterministic and stochastic cases using linear 0-1 programming... more
For the sensor network to operate successfully, the active nodes should maintain both sensing coverage and network connectivity. Furthermore, scheduling sleep intervals plays critical role for energy efficiency of wireless sensor... more
In Electronic Support, a receiver must monitor a wide frequency spectrum in which threatening emitters operate. A common approach is to use sensors with high sensitivity but a narrow bandwidth. To maintain surveillance over the whole... more
In this paper, we consider the scenario where many sensors cooperate to estimate a process. Only one sensor can take a measurement at any time step. We wish to come up with optimal sensor scheduling algorithms. The problem is motivated by... more
This work presents a framework for multi-robot tour guidance in a partially known environment with uncertainty, such as a museum. In the proposed centralized multi-robot planner, a simultaneous matching and routing problem (SMRP) is... more
We analyze the quality of monitoring (QoM) of stochastic events by a periodic sensor which monitors a point of interest (PoI) for q time every p time. We show how the amount of information captured at a PoI is affected by the proportion... more
We consider a pair of correlated processes in {Zn}n=-infin infin and {Zn}n=-infin infin, where the former is observable and the latter is hidden. The uncertainty in the estimation of Sn upon the finite past history of Z0 n-infin1 is... more
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process is observed by a single sensor which needs to be... more
We consider autonomous partially observable Markov decision processes (POMDP) where the control action influences the observation process only. Assuming the state and observation processes are stationary, time homogenous and their... more
In this paper, a physical layer security analysis of wireless sensor network in the presence of an attacker, employing opportunistic scheduling approach, is presented. The intended as well as unintended transmission paths experience the... more
λ 1 = 5, λ 0 = 2, T = 10 and varying prior probability p. It can be seen from (a)-(f) that as prior p moves from 0.5 to 0.999999, the optimal solution remains fixed at (5, 5, 0). (MATLAB-CODE F.6 & F.18.2). 2.9 Mutual information I(X; Y)... more
This paper considers the problem of sensor scheduling for the purposes of detection and tracking of "smart" targets. Smart targets are targets that can detect when they are under surveillance and react in a manner that makes future... more
The paper studies the problem of filtering a discrete-time linear system observed by a network of sensors. The sensors share a common communication medium to the estimator and transmission is bit and power budgeted. Under the assumption... more
We discuss blending sensor scheduling strategies with particle filtering (PF) methods to deal with the problem of tracking a 'smart' target, that is, a target being able to be aware it is being tracked and act in a manner that makes the... more
by Kui Wu
We consider the problem of periodic task scheduling in sensor nodes powered with energy harvesters. In particular, we focus on systems with stochastic energy sources such as solar panels, and we present two energy-aware scheduling... more
by Kui Wu
Wireless sensor networks consist of a large number of sensors and have been broadly used for intrusion detection in surveillance systems. To guarantee detection quality, such networks are usually over-engineered, i.e., more than required... more
by Kui Wu
Wireless sensor networks consist of a large number of sensors and have been broadly used for intrusion detection in surveillance systems. To guarantee detection quality, such networks are usually over-engineered, i.e., more than required... more
This paper was presented at the 6 th International Conference on Cooperative Control and Optimization, held in Gainesville, FL, 1-3 February 2006. This article will be published in the proceedings. One or more of the authors is a US... more
We discuss a novel control methodology for power management in heterogeneous distributed sensor networks. Many algorithms for resource management in sensor networks require a comprehensive model of the external environment and the sensor... more
The lifetime of a wireless sensor network (WSN) is a critical aspect as, in most of the applications, it is not possible to replace or recharge the batteries of the sensor nodes. The lifetime of a WSN with redundant deployment can be... more
by Kui Wu
Wireless sensor networks consist of a large number of sensors and have been broadly used for intrusion detection in surveillance systems. To guarantee detection quality, such networks are usually over-engineered, i.e., more than required... more
There is significant interest in using mobile sensors to protect geographical regions against hazards, in which the sensing resources are distributed according to the varying importance of the sub-regions, such as their numbers of... more
To cover a set of targets with known locations within an area with limited or prohibited ground access using a wireless sensor network, one approach is to deploy the sensors remotely, from an aircraft. In this approach, the lack of... more
This chapter reviews the principles of digitization, the design of digitally based instruments for clinical neurophysiology, and several common uses of digital processing, including averaging, digital filtering, and some types of... more
Hyperspectral remote sensing, also known as imaging spectroscopy, is based on the evaluation of reflected radiation in spectrally contiguous measuring channels. The detailed spectral characterization of atmospheric and surface absorption... more
In this paper, we investigate speeding up the execution time of Interval Algebra (IA) mechanically-steered multistatic and multisite radar scheduling using a general-purpose graphical processing unit (GP-GPU). Multistatic/multisite radar... more
Resource management improves the performance of multisensor systems through efficient sensor scheduling. An algorithm that utilizes Interval Algebra is presented to schedule multistatic measurements. Interval algebra can capture... more
Resource management improves the performance of multisensor systems through efficient sensor scheduling. An algorithm that utilizes Interval Algebra is presented to schedule multistatic measurements. Interval algebra can capture... more
by Kui Wu
Sensor scheduling plays a critical role for energy efficiency of wireless sensor networks. Traditional methods for sensor scheduling use either sensing coverage or network connectivity, but rarely both. In this paper, we deal with a... more
To cover a set of targets with known locations within an area with limited or prohibited ground access using a wireless sensor network, one approach is to deploy the sensors remotely, from an aircraft. In this approach, the lack of... more
This paper presents a game theoretic approach for the management of multiple mobile sensors. Our approach can maintain tracks of smart targets under possibly adversarial environments. To ensure computational tractability, sensor... more
We analyze the quality of monitoring (QoM) of stochastic events by a periodic sensor which monitors a point of interest (PoI) for q time every p time. We show how the amount of information captured at a PoI is affected by the proportion... more
Multi-action restless multi-armed bandits (RMABs) are a powerful framework for constrained resource allocation in which independent processes are managed. However, previous work only study the offline setting where problem dynamics are... more
Resource management improves the performance of multisensor systems through efficient sensor scheduling. An algorithm that utilizes Interval Algebra is presented to schedule multistatic measurements. Interval algebra can capture... more
We consider a sensor scheduling model where a set of identical sensors are used to hunt a larger set of heterogeneous targets, each of which is located at a corresponding site. Target states change randomly over discrete time slots... more
We analyze the quality of monitoring (QoM) of stochastic events by a periodic sensor which monitors a point of interest (PoI) for q time every p time. We show how the amount of information captured at a PoI is affected by the proportion... more
We analyze the quality of monitoring (QoM) of stochastic events by a periodic sensor which monitors a point of interest (PoI) for q time every p time. We show how the amount of information captured at a PoI is affected by the proportion... more
In Wireless Sensor Networks (WSN), a tradeoff between the network lifetime (limited by energy of sensors) and redundancy of actively sensing and communicating sensors (implicated by coverage requirements for the measured area) has to be... more
Resource management improves the performance of multisensor systems through efficient sensor scheduling. An algorithm that utilizes Interval Algebra is presented to schedule multistatic measurements. Interval algebra can capture... more
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measurements are then exchanged among all the sensors. What is the... more
Measurement losses adversely affect the performance of target tracking. The sensor network's life span depends on how efficiently the sensor nodes consume energy. In this paper, we focus on minimizing the total energy consumed by the... more
Download research papers for free!