Pub Date : 2012-10-01DOI: 10.1109/MILCOM.2012.6415780
Dung T. Nguyen, Nam P. Nguyen, M. Thai
Online Social Networks (OSNs) have recently emerged as one of the most effective channels for information sharing and discovery due to their ability of allowing users to read and create new content simultaneously. While this advantage provides users more rooms to decide which content to follow, it also makes OSNs fertile grounds for the wide spread of misinformation which can lead to undesirable consequences. In order to guarantee the trustworthiness of content sharing in OSNs, it is thus essential to have a strategic investigation on the first and foremost concern: the sources of misinformation. In this paper, we study k-Suspector problem which aims to identify the top k most suspected sources of misinformation. We propose two effective approaches namely ranking-based and optimization-based algorithms. We further extend our solutions to cope with the incompleteness of collected data as well as multiple attacks, which mostly occur in reality. Experimental results on real-world datasets show that our approaches achieve competitive detection ratios in a timely manner in comparison with available methods.
在线社交网络(Online Social Networks, OSNs)最近成为最有效的信息共享和发现渠道之一，因为它们允许用户同时阅读和创建新内容。虽然这一优势为用户提供了更多的空间来决定关注哪些内容，但它也使osn成为广泛传播错误信息的沃土，从而导致不良后果。因此，为了保证osn中内容共享的可信度，必须对错误信息的来源这一首要问题进行战略调查。在本文中，我们研究了k-怀疑问题，该问题旨在识别前k个最可疑的错误信息来源。我们提出了两种有效的方法，即基于排名和基于优化的算法。我们进一步扩展了我们的解决方案，以应对收集的数据不完整和多重攻击，这主要发生在现实中。在真实数据集上的实验结果表明，与现有方法相比，我们的方法在及时的检测率方面具有竞争力。
{"title":"Sources of misinformation in Online Social Networks: Who to suspect?","authors":"Dung T. Nguyen, Nam P. Nguyen, M. Thai","doi":"10.1109/MILCOM.2012.6415780","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415780","url":null,"abstract":"Online Social Networks (OSNs) have recently emerged as one of the most effective channels for information sharing and discovery due to their ability of allowing users to read and create new content simultaneously. While this advantage provides users more rooms to decide which content to follow, it also makes OSNs fertile grounds for the wide spread of misinformation which can lead to undesirable consequences. In order to guarantee the trustworthiness of content sharing in OSNs, it is thus essential to have a strategic investigation on the first and foremost concern: the sources of misinformation. In this paper, we study k-Suspector problem which aims to identify the top k most suspected sources of misinformation. We propose two effective approaches namely ranking-based and optimization-based algorithms. We further extend our solutions to cope with the incompleteness of collected data as well as multiple attacks, which mostly occur in reality. Experimental results on real-world datasets show that our approaches achieve competitive detection ratios in a timely manner in comparison with available methods.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"11 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91209491","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 : 2012-10-01DOI: 10.1109/MILCOM.2012.6415641
Jason D. Ellis, M. Pursley
We present and evaluate two low-complexity protocols for adaptive transmission in tactical packet radio systems that employ higher layer fountain codes. The adaptive-rate coding protocol is permitted to adjust the rate of the channel code between each pair of consecutive packets. The adaptive modulation and coding protocol can change the modulation between each pair of consecutive packets, but it can adjust the code rate only between consecutive frames of packets. Each protocol responds to dynamic fading and other time-varying propagation losses. For control of the adaptation, the protocols rely solely on a simple statistic derived by the receiver. They require no channel measurements, parameter estimates, pilot symbols, or training. The throughput performance of each protocol is evaluated for a Rayleigh fading channel modeled by a finite-state Markov chain. We show that our adaptive-rate coding protocol in tandem with higher layer fountain coding outperforms fountain coding with fixed-rate channel coding. We also compare the performance of our adaptive-rate coding protocol with the performance of a hypothetical ideal adaptive-rate coding protocol for which the transmitter is given perfect channel state information for the previous packet. We demonstrate that our protocol performs nearly as well as the ideal protocol.
{"title":"Adaptive-rate channel coding for packet radio systems with higher layer fountain coding","authors":"Jason D. Ellis, M. Pursley","doi":"10.1109/MILCOM.2012.6415641","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415641","url":null,"abstract":"We present and evaluate two low-complexity protocols for adaptive transmission in tactical packet radio systems that employ higher layer fountain codes. The adaptive-rate coding protocol is permitted to adjust the rate of the channel code between each pair of consecutive packets. The adaptive modulation and coding protocol can change the modulation between each pair of consecutive packets, but it can adjust the code rate only between consecutive frames of packets. Each protocol responds to dynamic fading and other time-varying propagation losses. For control of the adaptation, the protocols rely solely on a simple statistic derived by the receiver. They require no channel measurements, parameter estimates, pilot symbols, or training. The throughput performance of each protocol is evaluated for a Rayleigh fading channel modeled by a finite-state Markov chain. We show that our adaptive-rate coding protocol in tandem with higher layer fountain coding outperforms fountain coding with fixed-rate channel coding. We also compare the performance of our adaptive-rate coding protocol with the performance of a hypothetical ideal adaptive-rate coding protocol for which the transmitter is given perfect channel state information for the previous packet. We demonstrate that our protocol performs nearly as well as the ideal protocol.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"30 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89832929","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 : 2012-10-01DOI: 10.1109/MILCOM.2012.6415829
D. Ripplinger, A. Narula-Tam, K. Szeto
Airborne networks often use frequency hopping to be jam resistant. Because users are highly mobile and can have large propagation delays, otherwise orthogonal frequency hopping patterns appear asynchronous, and hop-by-hop collisions will occur. We compare the achievable throughput and delay of scheduling schemes versus random access schemes in this context via modeling and simulation. Because collisions occur even when nodes are scheduled at the slot level, much less throughput is attainable, as compared to the case of orthogonal hopping patterns. Random access achieves even less throughput because it cannot control exactly how many users are active in a slot, only the average. This results in scheduling offering roughly a 10% to 20% gain in throughput over random access, depending on parameters such as code block length, the number of frequencies hopped over, and the number of users. However, a static schedule, also known as Time Division Multiple Access or TDMA, is shown to have very large delays for high traffic loads. Dynamic scheduling can achieve the throughput of TDMA and the delay of random access, but it incurs additional overhead for coordination between users which may outweigh the throughput gain. Alternatively, random access with time hopping has the potential of achieving the throughput of TDMA, but at some cost of delay.
{"title":"Scheduling vs. random access in frequency hopped airborne networks","authors":"D. Ripplinger, A. Narula-Tam, K. Szeto","doi":"10.1109/MILCOM.2012.6415829","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415829","url":null,"abstract":"Airborne networks often use frequency hopping to be jam resistant. Because users are highly mobile and can have large propagation delays, otherwise orthogonal frequency hopping patterns appear asynchronous, and hop-by-hop collisions will occur. We compare the achievable throughput and delay of scheduling schemes versus random access schemes in this context via modeling and simulation. Because collisions occur even when nodes are scheduled at the slot level, much less throughput is attainable, as compared to the case of orthogonal hopping patterns. Random access achieves even less throughput because it cannot control exactly how many users are active in a slot, only the average. This results in scheduling offering roughly a 10% to 20% gain in throughput over random access, depending on parameters such as code block length, the number of frequencies hopped over, and the number of users. However, a static schedule, also known as Time Division Multiple Access or TDMA, is shown to have very large delays for high traffic loads. Dynamic scheduling can achieve the throughput of TDMA and the delay of random access, but it incurs additional overhead for coordination between users which may outweigh the throughput gain. Alternatively, random access with time hopping has the potential of achieving the throughput of TDMA, but at some cost of delay.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90909068","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 : 2012-10-01DOI: 10.1109/MILCOM.2012.6415812
Luoyang Fang, Dongliang Duan, Liuqing Yang
Frequency estimation for single-tone complex sinusoidal signals under additive white Gaussian noise is a classical and fundamental problem in many applications, such as communications, radar, sonar and power systems. In this paper, we propose a new algorithm by interpolating discrete Fourier transform (DFT) samples. Different from other existing interpolation methods for frequency estimation, our algorithm is based on a much simpler expression and has mathematically tractable bias expression in closed form, which can potentially assist future bias correction. Simulations confirm that our proposed algorithm outperforms all existing alternatives in the literature with comparable complexity.
{"title":"A new DFT-based frequency estimator for single-tone complex sinusoidal signals","authors":"Luoyang Fang, Dongliang Duan, Liuqing Yang","doi":"10.1109/MILCOM.2012.6415812","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415812","url":null,"abstract":"Frequency estimation for single-tone complex sinusoidal signals under additive white Gaussian noise is a classical and fundamental problem in many applications, such as communications, radar, sonar and power systems. In this paper, we propose a new algorithm by interpolating discrete Fourier transform (DFT) samples. Different from other existing interpolation methods for frequency estimation, our algorithm is based on a much simpler expression and has mathematically tractable bias expression in closed form, which can potentially assist future bias correction. Simulations confirm that our proposed algorithm outperforms all existing alternatives in the literature with comparable complexity.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"15 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76885769","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 : 2012-10-01DOI: 10.1109/MILCOM.2012.6415834
Marco M. Carvalho, R. Ford
In this paper we introduce a new approach to Virtual World-based Command and Control environments for multi-domain operations. Our target scenario is a military coalition operation in a common operation setting. All coalition partners participate in a common virtual command and control environment while different operational contexts take place simultaneously, at different levels of information release. Context-dependent information release is regulated through policies that are seamlessly enforced by the command and control framework without requiring the explicit participation (or knowledge) of users. A prototype of the proposed capability was implemented and demonstrated as an extension to OpenSim. In this paper, we describe our approach, some details of our prototype implementation, and our preliminary capability demonstrations.
{"title":"NextVC2 — A next generation virtual world command and control","authors":"Marco M. Carvalho, R. Ford","doi":"10.1109/MILCOM.2012.6415834","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415834","url":null,"abstract":"In this paper we introduce a new approach to Virtual World-based Command and Control environments for multi-domain operations. Our target scenario is a military coalition operation in a common operation setting. All coalition partners participate in a common virtual command and control environment while different operational contexts take place simultaneously, at different levels of information release. Context-dependent information release is regulated through policies that are seamlessly enforced by the command and control framework without requiring the explicit participation (or knowledge) of users. A prototype of the proposed capability was implemented and demonstrated as an extension to OpenSim. In this paper, we describe our approach, some details of our prototype implementation, and our preliminary capability demonstrations.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"57 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78055371","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 : 2012-10-01DOI: 10.1109/MILCOM.2012.6415613
John J. Windish
Scale Time Offset Robust Modulation (STORM) is a waveform design technique involving the simultaneous transmission of a base waveform as well as a time-scaled and time-delayed copy of that waveform. For some applications this technique is attractive as a possible candidate to enhance synchronization performance, due to the different tradeoffs of its performance properties. This paper first presents background for the STORM technique. From there, a theoretical analysis of the performance of STORM as a possible timing synchronization mechanism is presented.
{"title":"Synchronization performance using Scale Time Offset Robust Modulation","authors":"John J. Windish","doi":"10.1109/MILCOM.2012.6415613","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415613","url":null,"abstract":"Scale Time Offset Robust Modulation (STORM) is a waveform design technique involving the simultaneous transmission of a base waveform as well as a time-scaled and time-delayed copy of that waveform. For some applications this technique is attractive as a possible candidate to enhance synchronization performance, due to the different tradeoffs of its performance properties. This paper first presents background for the STORM technique. From there, a theoretical analysis of the performance of STORM as a possible timing synchronization mechanism is presented.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"174 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78016140","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 : 2012-10-01DOI: 10.1109/MILCOM.2012.6415562
D. Zheng, Helen Tang, F. Yu, Helen Tang
Cooperative communication is proposed to form a virtual MIMO system through strategic relay selection to improve communication quality in wireless networks, including mobile ad hoc networks (MANETs). Due to their unorganized and decentralized infrastructure, MANETs with cooperative communications (CO-MANETs) are vulnerable to attacks initiated on relays. Although encryption and authentication protocols may prevent compromised data transmission when a selected relay is attacked, their cost is high. In this paper, we propose a game theoretic approach to quantitatively analyze the attack strategies of the attacker so as to make rational decision on relay selection and the authentication parameter adaptation to reach the trade-off between security and Quality of Service (QoS) in CO-MANETs. Simulation results show the effectiveness of the proposed approach for security and QoS co-design in CO-MANETs.
{"title":"A game theoretic approach for security and Quality of Service (QoS) co-design in MANETs with cooperative communications","authors":"D. Zheng, Helen Tang, F. Yu, Helen Tang","doi":"10.1109/MILCOM.2012.6415562","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415562","url":null,"abstract":"Cooperative communication is proposed to form a virtual MIMO system through strategic relay selection to improve communication quality in wireless networks, including mobile ad hoc networks (MANETs). Due to their unorganized and decentralized infrastructure, MANETs with cooperative communications (CO-MANETs) are vulnerable to attacks initiated on relays. Although encryption and authentication protocols may prevent compromised data transmission when a selected relay is attacked, their cost is high. In this paper, we propose a game theoretic approach to quantitatively analyze the attack strategies of the attacker so as to make rational decision on relay selection and the authentication parameter adaptation to reach the trade-off between security and Quality of Service (QoS) in CO-MANETs. Simulation results show the effectiveness of the proposed approach for security and QoS co-design in CO-MANETs.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"23 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73062153","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 : 2012-10-01DOI: 10.1109/MILCOM.2012.6415796
Andrew D. Jurik, Shaun T. Hutton, J. Tarr
The ability of intrusion detection systems to identify anomalous behavior successfully has lagged behind their ability to recognize activity based on signatures. Anomaly detection techniques for enterprises typically use statistical traffic models to accommodate varying network traffic profiles and limit the volume of false alerts. We offer a set of characteristics to identify constrained networked systems in which we hypothesize that anomaly detection techniques are well suited and useful. We offer a specific, concrete approach, Hamming Masks, for identifying expected behavior in a constrained networked system and recognizing unexpected behavior. We demonstrate the applicability of Hamming Masks for two different data sets and find that the distinctions between the enterprise data set and the constrained networked system data set are large.
{"title":"Hamming Masks: Toward defending constrained networked systems","authors":"Andrew D. Jurik, Shaun T. Hutton, J. Tarr","doi":"10.1109/MILCOM.2012.6415796","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415796","url":null,"abstract":"The ability of intrusion detection systems to identify anomalous behavior successfully has lagged behind their ability to recognize activity based on signatures. Anomaly detection techniques for enterprises typically use statistical traffic models to accommodate varying network traffic profiles and limit the volume of false alerts. We offer a set of characteristics to identify constrained networked systems in which we hypothesize that anomaly detection techniques are well suited and useful. We offer a specific, concrete approach, Hamming Masks, for identifying expected behavior in a constrained networked system and recognizing unexpected behavior. We demonstrate the applicability of Hamming Masks for two different data sets and find that the distinctions between the enterprise data set and the constrained networked system data set are large.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"30 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74852640","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 : 2012-10-01DOI: 10.1109/MILCOM.2012.6415669
B. Farroha, D. Farroha
This study examines trust in the framework of service-based systems and discusses why it is difficult to achieve. We propose a discipline we term trust engineering, which considers the interactions of trust-enhancing technology, system architecture, and the development life cycle. The traditional view of security solutions have focused on preventing external threats such as malware in the forms of viruses, hackers and worms through perimeter from penetrating the organizations system where solutions that include firewalls and antivirus software were the leading mitigating techniques. While still aware of outside threats, companies are now coming to understand they can no longer ignore inside violations concerning data at rest or data on the move in order to protect the organization's private and confidential information. So information security and privacy is quickly becoming critical whether it is internal or external. This paper investigates trust-enhancing approaches, articulating a strategy based on three main thrusts: developing secure software systems (confidence), executing software in a protected, controlled environment (control), and monitoring software for cyber threats (discovery). Applying these three thrusts in combination with the proper architectural and life cycle perspective provides the best strategy for increasing our trust in software-based and service-based systems.
{"title":"The trust engineering framework: Architecting native security to defend against the next generation threats","authors":"B. Farroha, D. Farroha","doi":"10.1109/MILCOM.2012.6415669","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415669","url":null,"abstract":"This study examines trust in the framework of service-based systems and discusses why it is difficult to achieve. We propose a discipline we term trust engineering, which considers the interactions of trust-enhancing technology, system architecture, and the development life cycle. The traditional view of security solutions have focused on preventing external threats such as malware in the forms of viruses, hackers and worms through perimeter from penetrating the organizations system where solutions that include firewalls and antivirus software were the leading mitigating techniques. While still aware of outside threats, companies are now coming to understand they can no longer ignore inside violations concerning data at rest or data on the move in order to protect the organization's private and confidential information. So information security and privacy is quickly becoming critical whether it is internal or external. This paper investigates trust-enhancing approaches, articulating a strategy based on three main thrusts: developing secure software systems (confidence), executing software in a protected, controlled environment (control), and monitoring software for cyber threats (discovery). Applying these three thrusts in combination with the proper architectural and life cycle perspective provides the best strategy for increasing our trust in software-based and service-based systems.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"28 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79331522","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 : 2012-10-01DOI: 10.1109/MILCOM.2012.6415599
D. Torrieri
When a spread-spectrum receiver in a network discovers that it is processing a jamming signal transmitted by a compromised node, its first response is to attempt to identify the compromised node. In this paper, an adaptive array is used to find the direction to the jamming source despite the presence of interference signals transmitted by both legitimate network nodes and external sources. Unlike other direction-finding algorithms, the desired-signal classification (DESIC) algorithm requires no information or special assumptions about the interference signals to effectively cancel them and find the desired direction. Simulation experiments show that the DESIC algorithm provides an excellent performance in many scenarios, even when the received signals cannot be resolved by the widely used MUSIC algorithm.
{"title":"Direction finding of a compromised node in a spread-spectrum network","authors":"D. Torrieri","doi":"10.1109/MILCOM.2012.6415599","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415599","url":null,"abstract":"When a spread-spectrum receiver in a network discovers that it is processing a jamming signal transmitted by a compromised node, its first response is to attempt to identify the compromised node. In this paper, an adaptive array is used to find the direction to the jamming source despite the presence of interference signals transmitted by both legitimate network nodes and external sources. Unlike other direction-finding algorithms, the desired-signal classification (DESIC) algorithm requires no information or special assumptions about the interference signals to effectively cancel them and find the desired direction. Simulation experiments show that the DESIC algorithm provides an excellent performance in many scenarios, even when the received signals cannot be resolved by the widely used MUSIC algorithm.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"23 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84264667","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
扫码关注我们
求助内容：
应助结果提醒方式：