Pub Date : 2009-07-08DOI: 10.1109/CISDA.2009.5356528
Mahbod Tavallaee, E. Bagheri, Wei Lu, A. Ghorbani
During the last decade, anomaly detection has attracted the attention of many researchers to overcome the weakness of signature-based IDSs in detecting novel attacks, and KDDCUP'99 is the mostly widely used data set for the evaluation of these systems. Having conducted a statistical analysis on this data set, we found two important issues which highly affects the performance of evaluated systems, and results in a very poor evaluation of anomaly detection approaches. To solve these issues, we have proposed a new data set, NSL-KDD, which consists of selected records of the complete KDD data set and does not suffer from any of mentioned shortcomings.
{"title":"A detailed analysis of the KDD CUP 99 data set","authors":"Mahbod Tavallaee, E. Bagheri, Wei Lu, A. Ghorbani","doi":"10.1109/CISDA.2009.5356528","DOIUrl":"https://doi.org/10.1109/CISDA.2009.5356528","url":null,"abstract":"During the last decade, anomaly detection has attracted the attention of many researchers to overcome the weakness of signature-based IDSs in detecting novel attacks, and KDDCUP'99 is the mostly widely used data set for the evaluation of these systems. Having conducted a statistical analysis on this data set, we found two important issues which highly affects the performance of evaluated systems, and results in a very poor evaluation of anomaly detection approaches. To solve these issues, we have proposed a new data set, NSL-KDD, which consists of selected records of the complete KDD data set and does not suffer from any of mentioned shortcomings.","PeriodicalId":6407,"journal":{"name":"2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications","volume":"28 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2009-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81353187","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-07-08DOI: 10.1109/CISDA.2009.5356558
Z. Ding, H. Leung
In this article, we consider the bias issue in a passive tracking system which utilizes a mobile passive sensor network, where bearing-only sensors such as Inferred or ESM are used. Biases due to nonlinear transformations have already been recognized, but have not been studied for this particular case of converted pseudo measurements in a mobile passive sensor network. Based on the Taylor series, the bias equations for a network of two passive sensors are derived. Monte Carlo simulation is used for analysis. There are two other non-linear transformations which are related to this study: 1. range/azimuth to X/Y; 2. range/azimuth to latitude/longitude. Insightful studies with explicit expressions are available for the first nonlinear transformation, but not for the second and the new nonlinear transformations. This article will provide an approximate solution and simulation study for the new nonlinear transformation.
{"title":"Bias phenomenon and analysis of a nonlinear transformation in a mobile passive sensor network","authors":"Z. Ding, H. Leung","doi":"10.1109/CISDA.2009.5356558","DOIUrl":"https://doi.org/10.1109/CISDA.2009.5356558","url":null,"abstract":"In this article, we consider the bias issue in a passive tracking system which utilizes a mobile passive sensor network, where bearing-only sensors such as Inferred or ESM are used. Biases due to nonlinear transformations have already been recognized, but have not been studied for this particular case of converted pseudo measurements in a mobile passive sensor network. Based on the Taylor series, the bias equations for a network of two passive sensors are derived. Monte Carlo simulation is used for analysis. There are two other non-linear transformations which are related to this study: 1. range/azimuth to X/Y; 2. range/azimuth to latitude/longitude. Insightful studies with explicit expressions are available for the first nonlinear transformation, but not for the second and the new nonlinear transformations. This article will provide an approximate solution and simulation study for the new nonlinear transformation.","PeriodicalId":6407,"journal":{"name":"2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications","volume":"97 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2009-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74481336","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-07-08DOI: 10.1109/CISDA.2009.5356523
A. Ghanmi, A. Martel, J. Berger, A. Boukhtouta
This paper presents a methodology framework for the design of robust and effective military supply networks integrating various supply chain management dimensions. The proposed network design approach accounts for dynamic market demand, capacity, supply and resource conditions in a time-varying uncertain environment. The framework is based upon a two-level decomposition scheme combining design and user model components. The proposed stochastic multi-stage design model problem consists of determining the number and location of facilities (depots) required to satisfy an anticipated set of customer's demands and customer allocation (mission) to depots over a given time horizon. The user model is exploited to produce scenario-based anticipations to the design model required for network design problem-solving, and to assess network design solutions. The user model component mixes lot-sizing decisions with transportation assets assignments. Simulation is expected to be used to dynamically generate stochastic events supporting the construction of solution at both levels. Preliminary results on a military operational support hubs case study are reported and briefly analyzed for a simplified asset pre-positioning problem.
{"title":"A framework for the design of a military operational supply network","authors":"A. Ghanmi, A. Martel, J. Berger, A. Boukhtouta","doi":"10.1109/CISDA.2009.5356523","DOIUrl":"https://doi.org/10.1109/CISDA.2009.5356523","url":null,"abstract":"This paper presents a methodology framework for the design of robust and effective military supply networks integrating various supply chain management dimensions. The proposed network design approach accounts for dynamic market demand, capacity, supply and resource conditions in a time-varying uncertain environment. The framework is based upon a two-level decomposition scheme combining design and user model components. The proposed stochastic multi-stage design model problem consists of determining the number and location of facilities (depots) required to satisfy an anticipated set of customer's demands and customer allocation (mission) to depots over a given time horizon. The user model is exploited to produce scenario-based anticipations to the design model required for network design problem-solving, and to assess network design solutions. The user model component mixes lot-sizing decisions with transportation assets assignments. Simulation is expected to be used to dynamically generate stochastic events supporting the construction of solution at both levels. Preliminary results on a military operational support hubs case study are reported and briefly analyzed for a simplified asset pre-positioning problem.","PeriodicalId":6407,"journal":{"name":"2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications","volume":"291 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2009-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76312350","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-07-08DOI: 10.1109/CISDA.2009.5356557
Frank Akujobi, I. Lambadaris, E. Kranakis
Detection of slow worms is particularly challenging due to the stealthy nature of their propagation techniques and their ability to blend with normal traffic patterns. In this paper, we propose a distributed detection approach based on the Generalized Evidence Processing (GEP) theory, a sensor integration and data fusion technique. With GEP theory, evidence collected by distributed detectors determine the probability associated with a detection decision under a hypothesis. The collected evidence is combined to arrive at an optimal fused detection decision by minimizing a cummulative decision risk function. Typically, malicious traffic flows of varying scanning rates can occur in the wild, and the difficulty in detecting slow scanning worms in particular can be exacerbated by interference from other traffic flows scanning at faster rates. Our proposed detection technique uses a window-based self adapting profiler to filter detected malicious traffic profiles with scanning rates greater than the low scanning rates we are interested in. Experiments on a live test-bed are used to demonstrate behavior of the technique.
{"title":"Detection of slow malicious worms using multi-sensor data fusion","authors":"Frank Akujobi, I. Lambadaris, E. Kranakis","doi":"10.1109/CISDA.2009.5356557","DOIUrl":"https://doi.org/10.1109/CISDA.2009.5356557","url":null,"abstract":"Detection of slow worms is particularly challenging due to the stealthy nature of their propagation techniques and their ability to blend with normal traffic patterns. In this paper, we propose a distributed detection approach based on the Generalized Evidence Processing (GEP) theory, a sensor integration and data fusion technique. With GEP theory, evidence collected by distributed detectors determine the probability associated with a detection decision under a hypothesis. The collected evidence is combined to arrive at an optimal fused detection decision by minimizing a cummulative decision risk function. Typically, malicious traffic flows of varying scanning rates can occur in the wild, and the difficulty in detecting slow scanning worms in particular can be exacerbated by interference from other traffic flows scanning at faster rates. Our proposed detection technique uses a window-based self adapting profiler to filter detected malicious traffic profiles with scanning rates greater than the low scanning rates we are interested in. Experiments on a live test-bed are used to demonstrate behavior of the technique.","PeriodicalId":6407,"journal":{"name":"2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications","volume":"30 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2009-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90307960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-07-08DOI: 10.1109/CISDA.2009.5356559
Hai-Jun Rong, N. Sundararajan
In the paper, two fuzzy-neuro control schemes are presented for an aircraft automatic landing problem under the failures of stuck control surfaces and severe winds. The scheme incorporates a fuzzy-neuro controller which augments an existing conventional controller called Baseline Trajectory Following Controller (BTFC). Two fuzzy-neuro controllers have been designed using the recently proposed fuzzy-neuro algorithms named Sequential Adaptive Fuzzy Inference System (SAFIS) and Online Sequential Fuzzy Extreme Learning Machine (OS-Fuzzy-ELM) and a detailed performance comparison has been made. For this study, the following fault scenarios have been considered: i) Single fault of either aileron or elevator stuck at certain deflections and ii) Double fault cases where one aileron and one elevator at the same or opposite direction are stuck at different deflections. The simulation studies indicate that the OS-Fuzzy-ELM achieves better fault-tolerant capabilities compared with SAFIS.
{"title":"Fuzzy-neuro fault-tolerant control schemes for aircraft autolanding under actuator failures","authors":"Hai-Jun Rong, N. Sundararajan","doi":"10.1109/CISDA.2009.5356559","DOIUrl":"https://doi.org/10.1109/CISDA.2009.5356559","url":null,"abstract":"In the paper, two fuzzy-neuro control schemes are presented for an aircraft automatic landing problem under the failures of stuck control surfaces and severe winds. The scheme incorporates a fuzzy-neuro controller which augments an existing conventional controller called Baseline Trajectory Following Controller (BTFC). Two fuzzy-neuro controllers have been designed using the recently proposed fuzzy-neuro algorithms named Sequential Adaptive Fuzzy Inference System (SAFIS) and Online Sequential Fuzzy Extreme Learning Machine (OS-Fuzzy-ELM) and a detailed performance comparison has been made. For this study, the following fault scenarios have been considered: i) Single fault of either aileron or elevator stuck at certain deflections and ii) Double fault cases where one aileron and one elevator at the same or opposite direction are stuck at different deflections. The simulation studies indicate that the OS-Fuzzy-ELM achieves better fault-tolerant capabilities compared with SAFIS.","PeriodicalId":6407,"journal":{"name":"2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications","volume":"157 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2009-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76890607","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-07-08DOI: 10.1109/CISDA.2009.5356546
H. G. Kayack, A. N. Zincir-Heywood, M. Heywood, S. Burschka
This work focuses on testing anomaly detectors from the perspective of a Multi-objective Evolutionary Exploit Generator (EEG). Such a framework provides users of anomaly detection systems two capabilities. Firstly, no knowledge of protected data structures need to be assumed (i.e. the detector is a black-box), where the time, knowledge and availability of tools to perform such an analysis might not be generally available. Secondly, the evolved exploits are then able to demonstrate weaknesses in the ensuing detector parameterization. Therefore, the system administrator can identify the suitable parameters for the effective operation of the detector. EEG is employed against two second generation anomaly detectors, namely pH and pH with schema mask, on four UNIX applications in order to perform a vulnerability assessment and make a comparison between the two detectors.
{"title":"Optimizing anomaly detector deployment under evolutionary black-box vulnerability testing","authors":"H. G. Kayack, A. N. Zincir-Heywood, M. Heywood, S. Burschka","doi":"10.1109/CISDA.2009.5356546","DOIUrl":"https://doi.org/10.1109/CISDA.2009.5356546","url":null,"abstract":"This work focuses on testing anomaly detectors from the perspective of a Multi-objective Evolutionary Exploit Generator (EEG). Such a framework provides users of anomaly detection systems two capabilities. Firstly, no knowledge of protected data structures need to be assumed (i.e. the detector is a black-box), where the time, knowledge and availability of tools to perform such an analysis might not be generally available. Secondly, the evolved exploits are then able to demonstrate weaknesses in the ensuing detector parameterization. Therefore, the system administrator can identify the suitable parameters for the effective operation of the detector. EEG is employed against two second generation anomaly detectors, namely pH and pH with schema mask, on four UNIX applications in order to perform a vulnerability assessment and make a comparison between the two detectors.","PeriodicalId":6407,"journal":{"name":"2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications","volume":"85 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2009-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84110663","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-07-08DOI: 10.1109/CISDA.2009.5356549
Derek Elsaesser
This paper examines the concept of replacing a few expensive high-accuracy radio direction-finding (DF) sensors operating in a stand-off baseline with many low-accuracy DF sensors deployed on existing military vehicles located throughout an area of interest. A formula is presented to estimate the geolocation accuracy that could be achieved for a given number of sensors with a specified DF accuracy. Monte Carlo and virtual simulation of sensors with varying DF accuracy is used to assess the accuracy and reliability of the geolocation estimates that could be achieved. Geolocation results are computed using Stansfield's method and a technique developed at DRDC Ottawa, called the Discrete Probability Density (DPD) method, and compared to the theoretical location accuracy limit predicted by the Cramer-Rao Lower Bound. The DPD method is shown to provide more accurate and more reliable geolocation estimates than Stansfield's method when incorporating large quantities of low-accuracy DF data. This suggests that the DPD method could be used with several less-expensive low-accuracy DF sensors to provide improved emitter geolocation capability compared to the conventional deployment of a few high-accuracy DF sensors.
{"title":"Emitter geolocation using low-accuracy direction-finding sensors","authors":"Derek Elsaesser","doi":"10.1109/CISDA.2009.5356549","DOIUrl":"https://doi.org/10.1109/CISDA.2009.5356549","url":null,"abstract":"This paper examines the concept of replacing a few expensive high-accuracy radio direction-finding (DF) sensors operating in a stand-off baseline with many low-accuracy DF sensors deployed on existing military vehicles located throughout an area of interest. A formula is presented to estimate the geolocation accuracy that could be achieved for a given number of sensors with a specified DF accuracy. Monte Carlo and virtual simulation of sensors with varying DF accuracy is used to assess the accuracy and reliability of the geolocation estimates that could be achieved. Geolocation results are computed using Stansfield's method and a technique developed at DRDC Ottawa, called the Discrete Probability Density (DPD) method, and compared to the theoretical location accuracy limit predicted by the Cramer-Rao Lower Bound. The DPD method is shown to provide more accurate and more reliable geolocation estimates than Stansfield's method when incorporating large quantities of low-accuracy DF data. This suggests that the DPD method could be used with several less-expensive low-accuracy DF sensors to provide improved emitter geolocation capability compared to the conventional deployment of a few high-accuracy DF sensors.","PeriodicalId":6407,"journal":{"name":"2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications","volume":"168 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2009-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72672547","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-07-08DOI: 10.1109/CISDA.2009.5356544
Saeed Samet, A. Miri
Association rule mining provides useful knowledge from raw data in different applications such as health, insurance, marketing and business systems. However, many real world applications are distributed among two or more parties, each of which wants to keep its sensitive information private, while they collaboratively gaining some knowledge from their data. Therefore, secure and distributed solutions are needed that do not have a central or third party accessing the parties' original data. In this paper, we present a new protocol for privacy-preserving association rule mining to overcome the security flaws in existing solutions, with better performance, when data is vertically partitioned among two or more parties. Two sub-protocols for secure binary dot product and cardinality of set intersection for binary vectors are also designed which are used in the main protocols as building blocks.
{"title":"Secure two and multi-party association rule mining","authors":"Saeed Samet, A. Miri","doi":"10.1109/CISDA.2009.5356544","DOIUrl":"https://doi.org/10.1109/CISDA.2009.5356544","url":null,"abstract":"Association rule mining provides useful knowledge from raw data in different applications such as health, insurance, marketing and business systems. However, many real world applications are distributed among two or more parties, each of which wants to keep its sensitive information private, while they collaboratively gaining some knowledge from their data. Therefore, secure and distributed solutions are needed that do not have a central or third party accessing the parties' original data. In this paper, we present a new protocol for privacy-preserving association rule mining to overcome the security flaws in existing solutions, with better performance, when data is vertically partitioned among two or more parties. Two sub-protocols for secure binary dot product and cardinality of set intersection for binary vectors are also designed which are used in the main protocols as building blocks.","PeriodicalId":6407,"journal":{"name":"2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications","volume":"111 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2009-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73403435","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-07-08DOI: 10.1109/CISDA.2009.5356551
P. Sarunic, R. Evans, W. Moran
An algorithm for trajectory optimization of autonomous aerial vehicles performing multiple target tracking is proposed. The problem is approached by formulating it as a partially observed Markov decision process (POMDP) and developing a moving-horizon solution taking into account short and long term costs. To evaluate the effectiveness of the approach a simulation involving multiple UAVs and targets is performed.
{"title":"Control of unmanned aerial vehicles for passive detection and tracking of multiple emitters","authors":"P. Sarunic, R. Evans, W. Moran","doi":"10.1109/CISDA.2009.5356551","DOIUrl":"https://doi.org/10.1109/CISDA.2009.5356551","url":null,"abstract":"An algorithm for trajectory optimization of autonomous aerial vehicles performing multiple target tracking is proposed. The problem is approached by formulating it as a partially observed Markov decision process (POMDP) and developing a moving-horizon solution taking into account short and long term costs. To evaluate the effectiveness of the approach a simulation involving multiple UAVs and targets is performed.","PeriodicalId":6407,"journal":{"name":"2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications","volume":"52 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2009-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75785986","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-07-08DOI: 10.1109/CISDA.2009.5356552
G. Labonté
The importance of local intervention capability for the assertion of Canadian Sovereignty in the Northwest Passage is recognized. However, Canada lacks the ability to deploy, on demand, assets to search a wide area for rescue or surveillance purposes in the North. This fact motivated our investigation of the feasibility of a rapid intervention system based on a carrier-scouts design in which a number of unmanned aerial vehicles (UAVs) would be transported, air launched and recovered by a carrier aircraft. These UAVs would have the ability to self-organize in formations that correspond to the task at hand. When searching for a target, they would fly in a linear pattern so that the search area swept per hour and the probability of detecting the target would be considerably increased. A 1973 report by the Tactical Combat Aircraft Programs of the Boeing Aerospace Company for the US Air Force and a 2007 thesis by Chalamont indicate that airborne launch and recovery of many UAVs from a carrier aircraft is feasible and requires only already existing technology. We propose here a solution to the remaining problem of managing simultaneously the many UAVs that are required by the vastness of the areas to be surveyed, with a minimum number of human controllers and communications. Namely, we present algorithms for the self-organization of the UAVs in the required formations. These allow for surveillance operations during which close-up images would be acquired of activities in a region of interest, and searching an area for assets in distress and providing a visual presence for such. We reach the conclusion that our proposed local intervention system with flocking UAVs is feasible and would provide a valuable asset for asserting Canadian Sovereignty in the North.
{"title":"Canadian artic Sovereignty: Local intervention by flocking UAVs","authors":"G. Labonté","doi":"10.1109/CISDA.2009.5356552","DOIUrl":"https://doi.org/10.1109/CISDA.2009.5356552","url":null,"abstract":"The importance of local intervention capability for the assertion of Canadian Sovereignty in the Northwest Passage is recognized. However, Canada lacks the ability to deploy, on demand, assets to search a wide area for rescue or surveillance purposes in the North. This fact motivated our investigation of the feasibility of a rapid intervention system based on a carrier-scouts design in which a number of unmanned aerial vehicles (UAVs) would be transported, air launched and recovered by a carrier aircraft. These UAVs would have the ability to self-organize in formations that correspond to the task at hand. When searching for a target, they would fly in a linear pattern so that the search area swept per hour and the probability of detecting the target would be considerably increased. A 1973 report by the Tactical Combat Aircraft Programs of the Boeing Aerospace Company for the US Air Force and a 2007 thesis by Chalamont indicate that airborne launch and recovery of many UAVs from a carrier aircraft is feasible and requires only already existing technology. We propose here a solution to the remaining problem of managing simultaneously the many UAVs that are required by the vastness of the areas to be surveyed, with a minimum number of human controllers and communications. Namely, we present algorithms for the self-organization of the UAVs in the required formations. These allow for surveillance operations during which close-up images would be acquired of activities in a region of interest, and searching an area for assets in distress and providing a visual presence for such. We reach the conclusion that our proposed local intervention system with flocking UAVs is feasible and would provide a valuable asset for asserting Canadian Sovereignty in the North.","PeriodicalId":6407,"journal":{"name":"2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications","volume":"45 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2009-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75122258","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：