Distributed Target Engagement In Large Scale Mobile Sensor Networks PDF Download

Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Distributed Target Engagement In Large Scale Mobile Sensor Networks PDF full book. Access full book title Distributed Target Engagement In Large Scale Mobile Sensor Networks.

Distributed Target Engagement in Large-scale Mobile Sensor Networks

Distributed Target Engagement in Large-scale Mobile Sensor Networks
Author: Samaneh Hosseini Semnani
Publisher:
Total Pages: 194
Release: 2015
Genre:
ISBN:

Download Distributed Target Engagement in Large-scale Mobile Sensor Networks Book in PDF, ePub and Kindle

Sensor networks comprise an emerging field of study that is expected to touch many aspects of our life. Research in this area was originally motivated by military applications. Afterward sensor networks have demonstrated tremendous promise in many other applications such as infrastructure security, environment and habitat monitoring, industrial sensing, traffic control, and surveillance applications. One key challenge in large-scale sensor networks is the efficient use of the network's resources to collect information about objects in a given Volume of Interest (VOI). Multi-sensor Multi-target tracking in surveillance applications is an example where the success of the network to track targets in a given volume of interest, efficiently and effectively, hinges significantly on the network's ability to allocate the right set of sensors to the right set of targets so as to achieve optimal performance. This task can be even more complicated if the surveillance application is such that the sensors and targets are expected to be mobile. To ensure timely tracking of targets in a given volume of interest, the surveillance sensor network needs to maintain engagement with all targets in this volume. Thus the network must be able to perform the following real-time tasks: 1) sensor-to-target allocation; 2) target tracking; 3) sensor mobility control and coordination. In this research I propose a combination of the Semi-Flocking algorithm, as a multi-target motion control and coordination approach, and a hierarchical Distributed Constraint Optimization Problem (DCOP) modelling algorithm, as an allocation approach, to tackle target engagement problem in large-scale mobile multi-target multi-sensor surveillance systems. Sensor-to-target allocation is an NP-hard problem. Thus, for sensor networks to succeed in such application, an efficient approach that can tackle this NP-hard problem in real-time is disparately needed. This research work proposes a novel approach to tackle this issue by modelling the problem as a Hierarchical DCOP. Although DCOPs has been proven to be both general and efficient they tend to be computationally expensive, and often intractable for large-scale problems. To address this challenge, this research proposes to divide the sensor-to-target allocation problem into smaller sub-DCOPs with shared constraints, eliminating significant computational and communication costs. Furthermore, a non-binary variable modelling is presented to reduce the number of inter-agent constraints. Target tracking and sensor mobility control and coordination are the other main challenges in these networks. Biologically inspired approaches have recently gained significant attention as a tool to address this issue. These approaches are exemplified by the two well-known algorithms, namely, the Flocking algorithm and the Anti-Flocking algorithm. Generally speaking, although these two biologically inspired algorithms have demonstrated promising performance, they expose deficiencies when it comes to their ability to maintain simultaneous reliable dynamic area coverage and target coverage. To address this challenge, Semi-Flocking, a biologically inspired algorithm that benefits from key characteristics of both the Flocking and Anti-Flocking algorithms, is proposed. The Semi-Flocking algorithm approaches the problem by assigning a small flock of sensors to each target, while at the same time leaving some sensors free to explore the environment. Also, this thesis presents an extension of the Semi-Flocking in which it is combined with a constrained clustering approach to provide better coverage over maneuverable targets. To have a reliable target tracking, another extension of Semi-Flocking algorithm is presented which is a coupled distributed estimation and motion control algorithm. In this extension the Semi-Flocking algorithm is employed for the purpose of a multi-target motion control, and Kalman-Consensus Filter (KCF) for the purpose of motion estimation. Finally, this research will show that the proposed Hierarchical DCOP algorithm can be elegantly combined with the Semi-Flocking algorithm and its extensions to create a coupled control and allocation approach. Several experimental analysis conducted in this research illustrate how the operation of the proposed algorithms outperforms other approaches in terms of incurred computational and communication costs, area coverage, target coverage for both linear and maneuverable targets, target detection time, number of undetected targets and target coverage in noise conditions sensor network. Also it is illustrated that this algorithmic combination can successfully engage multiple sensors to multiple mobile targets such that the number of uncovered targets is minimized and the sensors' mean utilization factor sensor surveillance systems.is maximized.


Handbook of Sensor Networks

Handbook of Sensor Networks
Author: Ivan Stojmenovic
Publisher: John Wiley & Sons
Total Pages: 552
Release: 2005-09-19
Genre: Technology & Engineering
ISBN: 0471744131

Download Handbook of Sensor Networks Book in PDF, ePub and Kindle

The State Of The Art Of Sensor Networks Written by an international team of recognized experts in sensor networks from prestigious organizations such as Motorola, Fujitsu, the Massachusetts Institute of Technology, Cornell University, and the University of Illinois, Handbook of Sensor Networks: Algorithms and Architectures tackles important challenges and presents the latest trends and innovations in this growing field. Striking a balance between theoretical and practical coverage, this comprehensive reference explores a myriad of possible architectures for future commercial, social, and educational applications, and offers insightful information and analyses of critical issues, including: * Sensor training and security * Embedded operating systems * Signal processing and medium access * Target location, tracking, and sensor localization * Broadcasting, routing, and sensor area coverage * Topology construction and maintenance * Data-centric protocols and data gathering * Time synchronization and calibration * Energy scavenging and power sources With exercises throughout, students, researchers, and professionals in computer science, electrical engineering, and telecommunications will find this an essential read to bring themselves up to date on the key challenges affecting the sensors industry.


Distributed Tracking and Information-drivien Control for Mobile Sensor Networks

Distributed Tracking and Information-drivien Control for Mobile Sensor Networks
Author: Parisa Jalalkamali
Publisher:
Total Pages: 238
Release: 2012
Genre:
ISBN:

Download Distributed Tracking and Information-drivien Control for Mobile Sensor Networks Book in PDF, ePub and Kindle

"The main research objective of this thesis is to address distributed target tracking for mobile sensor networks. Based on real-life limitations, we are particularly interested in mobile sensors with Limited Sensing Range (LSR). There are three possible multi-target tracking scenarios for n mobile sensors tracking m targets: i) many sensors tracking few targets n ” m (e.g. tracking high-valued targets), ii) a few sensors track many targets n “ m (e.g. the sensor coverage problem and situational awareness in a crowded airport terminal), and iii) swarms of sensors tracking swarms of targets n,m ” 1 (e.g. selflocalization of autonomous vehicles in intellegent transportation systems). First, we show that all three problems can be posed as coupled distributed estimation and control problems for mobile sensor networks. To tackle this estimation and control problem, we propose a unified theoretical framework in which every mobile agent (or sensor) has a two-fold objective: a) maintaining a safe distance (or minimum separation) from neighboring mobile agents during target tracking and b) enhancing the quality of sensed information collectively by the team of sensors to improve the performance of distributed estimation. In many real-life applications, the quality of sensed data is a function of the proximity to the target. We propose an information-theoretic measure for quality of sensed data by each sensor called the information value as the trace of the Fisher Information Matrix (FIM). This metric of quality of sensed data plays a key role in all of our proposed distributed tracking and control algorithms. We show that objective a) of any mobile agent is fundamentally a "collision-avoidance" (or "separation") objective that is a byproduct of flocking behavior for multi-agent systems [48], while objective b) for LSR-type sensors requires solving an additional control problem to enhance the collective information value of the team of agents. We refer to the latter problem as the information-driven control problem. For distributed tracking on mobile networks, we apply Information Filter and Kalman-Consensus Filter (KCF) as effective algorithms for distributed multi-target tracking on networks. The other problem of interest is the formal stability analysis of the coupled distributed estimation and flocking-based mobility-control and self-deployment algorithms for problems i) and ii). We prove that the error dynamics of the KCF and the structural dynamics of the flock of sensors from a cascade nonlinear system and provide a Lyapunov-based stability analysis of case i). We present additional theoretical results on analysis of information-driven control and tracking algoritjms for problems i) and ii) together with successful experimental results. In addition, we identify the key questions regarding problem iii) that remains the subject of ongoing and future research."


Frontiers in Algorithmics

Frontiers in Algorithmics
Author: Franco P. Preparata
Publisher: Springer
Total Pages: 360
Release: 2008-06-07
Genre: Computers
ISBN: 3540693114

Download Frontiers in Algorithmics Book in PDF, ePub and Kindle

The Annual International Frontiers in Algorithmics Workshop is a focused - rum on current trends in research on algorithms, discrete structures, and their applications. It intends to bring together international experts at the research frontiers in those areas to exchange ideas and to present signi?cant new results. The mission of the workshop is to stimulate the various ?elds for which al- rithmics can become a crucial enabler, and to strengthen the ties between the Eastern and Western algorithmics research communities. The Second Inter- tional Frontiers in Algorithmics Workshop (FAW 2008) took place in Changsha, China, June 19–21, 2008. In response to the Call for Papers, 80 papers were submitted from 15 co- tries and regions: Canada, China, France, Germany, Greece, Hong Kong, India, Iran, Japan, Mexico, Norway, Singapore, South Korea, Taiwan, and the USA. After a six-week period of careful reviewing and discussion, the Program C- mittee accepted 32 submissions for presentation at the conference. These papers were selected for nine special focus tracks in the areas of biomedical inform- ics, discrete structures, geometric information processing and communication, games and incentive analysis, graph algorithms, internet algorithms and pro- cols, parameterized algorithms, design and analysis of heuristics, approximate and online algorithms, and machine learning. The program of FAW 2008 also included three keynote talks by Xiaotie Deng, John E. Hopcroft, and Milan Sonka.


High Accuracy Distributed Target Detection and Classification in Sensor Networks Based on Mobile Agent Framework

High Accuracy Distributed Target Detection and Classification in Sensor Networks Based on Mobile Agent Framework
Author:
Publisher:
Total Pages:
Release: 2004
Genre:
ISBN:

Download High Accuracy Distributed Target Detection and Classification in Sensor Networks Based on Mobile Agent Framework Book in PDF, ePub and Kindle

High-accuracy distributed information exploitation plays an important role in sensor networks. This dissertation describes a mobile-agent-based framework for target detection and classification in sensor networks. Specifically, we tackle the challenging problems of multiple target detection, high-fidelity target classification, and unknown-target identification. In this dissertation, we present a progressive multiple-target detection approach to estimate the number of targets sequentially and implement it using a mobile-agent framework. To further improve the performance, we present a cluster-based distributed approach where the estimated results from different clusters are fused. Experimental results show that the distributed scheme with the Bayesian fusion method have better performance in the sense that they have the highest detection probability and the most stable performance. In addition, the progressive intra-cluster estimation can reduce data transmission by 83.22% and conserve engery by 81.64% compared to the centralized scheme. For collaborative target classification, we develop a general purpose multi-modality, multi-sensor fusion hierarchy for information integration in sensor networks. The hierarchy is composed of four levels of enabling algorithms: local signal processing, temporal fusion, multi-modality fusion, and multi-sensor fusion using a mobile-agent-based framework. The fusion hierarchy ensures fault tolerance and thus generates robust results. In the meanwhile, it also takes into account energy efficiency. Experimental results based on two field demos show constant improvement of classification accuracy over different levels of the hierarchy. Unknown target identification in sensor networks corresponds to the capability of detecting targets without any a priori information, and of modifying the knowledge base dynamically. In this dissertation, we present a collaborative method to solve this problem among multiple sensors. When applied to the military vehicles data set collected in a field demo, about 80% unknown target samples can be recognized correctly, while the known target classification accuracy stays above 95%.


Distributed Sensing Coverage Maintenance in Sensor Networks

Distributed Sensing Coverage Maintenance in Sensor Networks
Author: Bin Tong
Publisher:
Total Pages: 118
Release: 2006
Genre:
ISBN:

Download Distributed Sensing Coverage Maintenance in Sensor Networks Book in PDF, ePub and Kindle

Sensing coverage is one of the key performance indicators of a large-scale sensor network. Sensing coverage holes may appear anywhere in the network field at any time due to random deployment, depletion of sensor battery power, or natural events in the deployment environment such as strong wind blowing some sensors away. Discovering the exact boundaries of coverage holes is important because it enables fast and efficient patching of coverage holes. In this thesis, we propose a framework of sensing coverage maintenance in sensor networks. In our framework, a sensor network consists of stationary and mobile sensors, where mobile sensors are used as patching hosts. We divide the coverage maintenance into two components: coverage hole discovery and coverage hole patching, and propose new solutions to both components. (1) We present two efficient distributed algorithms that periodically discover the precise boundaries of coverage holes. Our algorithms can handle the case that the transmission range of a sensor is smaller than twice the sensing range of the sensor. This case is largely ignored by previous work. (2) We present an efficient hole patching algorithm, which runs in linear time, based on the knowledge of the precise boundary of each coverage hole. We further propose new solutions for looking up available patching hosts, and movement planning. We present rigorous mathematical proofs of the correctness of the proposed hole discovery algorithms. We also show the running time and the performance bound in terms of mobile sensors needed of our hole patching algorithm through solid mathematical analysis. Our simulation results show that our distributed discovery algorithms are much more efficient than their centralized counterparts in terms of network overhead and total discovery time while still achieving the same correctness in discovering the boundaries of coverage holes. Furthermore, our patching algorithm performs well in terms of number of mobile sensors needed with a linear running time, and our hole patching scheme can achieve fast hole patching time when moving mobile sensors in a parallel manner.