An Enhanced CPA Algorithm for Real-Time Target Tracking in Wireless Sensor Networks

2009 ◽  
Vol 5 (5) ◽  
pp. 619-643 ◽  
Author(s):  
Qing Yang ◽  
Alvin Lim ◽  
Kenan Casey ◽  
Raghu-Kisore Neelisetti

Real-time tracking of moving targets using wireless sensor networks has been a challenging problem because of the high velocity of the targets and the limited resources of the sensors. CPA (closest point of approach) algorithms are appropriate for tracking fast-moving targets since the tracking error is roughly inversely proportional to the square root of the target velocity. However, this approach requires a specific node configuration with reference to the target trajectory which may not always be possible in randomly deployed sensor networks. Moreover, our mathematical analysis of the original CPA algorithm shows that it suffers from huge localization errors due to inaccuracies in sensor location and measured CPA times. To address these issues, we propose an enhanced CPA (ECPA) algorithm which requires only five sensors around the target to achieve the reliability and efficiency we want for computing the bearing of the target trajectory, the relative position between the sensors and the trajectory, and the velocity of the target. To validate the ECPA algorithm, we designed and implemented this algorithm over an actual data-centric acoustic sensor network as well as simulating it in an NS-2 simulator. The results of our field experiments and simulations show that we can achieve our goals of detecting the target and predicting its location, velocity and direction of travel with reasonable accuracy.

2011 ◽  
Vol E94-B (2) ◽  
pp. 569-572
Author(s):  
Soochang PARK ◽  
Euisin LEE ◽  
Juhyun JUNG ◽  
Sang-Ha KIM

Author(s):  
Neetika Jain ◽  
Sangeeta Mittal

Background: Real Time Wireless Sensor Networks (RT-WSN) have hard real time packet delivery requirements. Due to resource constraints of sensors, these networks need to trade-off energy and latency. Objective: In this paper, a routing protocol for RT-WSN named “SPREAD” has been proposed. The underlying idea is to reserve laxity by assuming tighter packet deadline than actual. This reserved laxity is used when no deadline-meeting next hop is available. Objective: As a result, if due to repeated transmissions, energy of nodes on shortest path is drained out, then time is still left to route the packet dynamically through other path without missing the deadline. Results: Congestion scenarios have been addressed by dynamically assessing 1-hop delays and avoiding traffic on congested paths. Conclusion: Through extensive simulations in Network Simulator NS2, it has been observed that SPREAD algorithm not only significantly reduces miss ratio as compared to other similar protocols but also keeps energy consumption under control. It also shows more resilience towards high data rate and tight deadlines than existing popular protocols.


2013 ◽  
Vol 347-350 ◽  
pp. 975-979
Author(s):  
Rong Zhao ◽  
Cai Hong Li ◽  
Yun Jian Tan ◽  
Jun Shi ◽  
Fu Qiang Mu ◽  
...  

This paper presents a Debris Flow Disaster Faster-than-early Forecast System (DFS) with wireless sensor networks. Debris flows carrying saturated solid materials in water flowing downslope often cause severe damage to the lives and properties in their path. Faster-than-early or faster-than-real-time forecasts are imperative to save lives and reduce damage. This paper presents a novel multi-sensor networks for monitoring debris flows. The main idea is to let these sensors drift with the debris flow, to collect flow information as they move along, and to transmit the collected data to base stations in real time. The Raw data are sent to the cloud processing center from the base station. And the processed data and the video of the debris flow are display on the remote PC. The design of the system address many challenging issues, including cost, deployment efforts, and fast reaction.


Sign in / Sign up

Export Citation Format

Share Document