Pub Date : 2017-10-01DOI: 10.1109/MILCOM.2017.8170855
D. Rawat, Olumide Malomo, C. Bajracharya, Min Song
Cognitive radio network (CRN) is regarded as an emerging technology for better spectrum efficiency where unlicensed secondary users (SUs) sense RF spectrum to find idle channels and access them opportunistically without causing any harmful interference to licensed primary users (PUs). However, RF spectrum sensing and sharing along with reconfigurable capabilities of SUs bring severe security vulnerabilities in the network. In this paper, we analyze physical-layer security (secrecy rates) of SUs in CRN in the presence of eavesdroppers, jammers and PU emulators (PUEs) where SUs compete not only with jammers and eavesdroppers who are trying to reduce SU's secrecy rates but also against PUEs who are trying to compel the SUs from their current channel by imitating the behavior of PUs. In addition, a legitimate SU competes with other SUs with a sharing attitude for dynamic spectrum access to gain a high secrecy rate, however, the malicious users (i.e., attackers) attempt to abuse the channels egotistically. The main contribution of this work is the design of a game theoretic approach to maximize utilities (that is proportional to secrecy rates) of SUs in the presence of eavesdroppers, jammers and PUEs. Furthermore, SUs use signal energy and cyclostationary feature detection along with location verification technique to detect PUEs. As the proposed approach is generic and considers different attackers, it can be particularized to a situation with eavesdroppers only, jammers only or PUEs only while evaluating physical-layer security of SUs in CRN. We evaluate the performance of the proposed approach using results obtained from simulations. The results show that the proposed approach outperforms other existing methods.
认知无线电网络(Cognitive radio network, CRN)是一种新兴的频谱效率技术，通过非授权的辅助用户(su)感知射频频谱，发现空闲信道，并在不对授权的主用户(pu)造成任何有害干扰的情况下利用它们。然而，射频频谱的感知和共享以及单元的可重构能力给网络带来了严重的安全漏洞。在本文中，我们分析了在窃听者、干扰者和PU仿真器(pue)存在的情况下，CRN中SU的物理层安全性(保密率)，其中SU不仅与试图降低SU保密率的干扰者和窃听者竞争，而且还与试图通过模仿PU的行为迫使SU离开当前信道的pue竞争。此外，合法的用户以共享的态度与其他用户竞争动态频谱访问，以获得较高的保密率，而恶意用户(即攻击者)则试图以自我为中心滥用信道。这项工作的主要贡献是设计了一种博弈论方法，以在窃听者、干扰者和pue存在的情况下最大化SUs的效用(与保密率成正比)。此外，SUs使用信号能量和循环平稳特征检测以及位置验证技术来检测pue。由于该方法具有通用性，且考虑了不同的攻击者，因此在评估CRN中单个用户的物理层安全性时，可以将其细化为仅窃听者、仅干扰者或仅pue的情况。我们使用仿真结果来评估所提出方法的性能。结果表明，该方法优于其他现有方法。
{"title":"Evaluating physical-layer security for secondary users in cognitive radio systems with attackers","authors":"D. Rawat, Olumide Malomo, C. Bajracharya, Min Song","doi":"10.1109/MILCOM.2017.8170855","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170855","url":null,"abstract":"Cognitive radio network (CRN) is regarded as an emerging technology for better spectrum efficiency where unlicensed secondary users (SUs) sense RF spectrum to find idle channels and access them opportunistically without causing any harmful interference to licensed primary users (PUs). However, RF spectrum sensing and sharing along with reconfigurable capabilities of SUs bring severe security vulnerabilities in the network. In this paper, we analyze physical-layer security (secrecy rates) of SUs in CRN in the presence of eavesdroppers, jammers and PU emulators (PUEs) where SUs compete not only with jammers and eavesdroppers who are trying to reduce SU's secrecy rates but also against PUEs who are trying to compel the SUs from their current channel by imitating the behavior of PUs. In addition, a legitimate SU competes with other SUs with a sharing attitude for dynamic spectrum access to gain a high secrecy rate, however, the malicious users (i.e., attackers) attempt to abuse the channels egotistically. The main contribution of this work is the design of a game theoretic approach to maximize utilities (that is proportional to secrecy rates) of SUs in the presence of eavesdroppers, jammers and PUEs. Furthermore, SUs use signal energy and cyclostationary feature detection along with location verification technique to detect PUEs. As the proposed approach is generic and considers different attackers, it can be particularized to a situation with eavesdroppers only, jammers only or PUEs only while evaluating physical-layer security of SUs in CRN. We evaluate the performance of the proposed approach using results obtained from simulations. The results show that the proposed approach outperforms other existing methods.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115557236","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 : 2017-10-01DOI: 10.1109/MILCOM.2017.8170758
Shayok Chakraborty, J. W. Stokes, Lin Xiao, Dengyong Zhou, M. Marinescu, Anil Thomas
Despite widespread use of commercial anti-virus products, the number of malicious files detected on home and corporate computers continues to increase at a significant rate. Recently, anti-virus companies have started investing in machine learning solutions to augment signatures manually designed by analysts. A malicious file's determination is often represented as a hierarchical structure consisting of a type (e.g. Worm, Backdoor), a platform (e.g. Win32, Win64), a family (e.g. Rbot, Rugrat) and a family variant (e.g. A, B). While there has been substantial research in automated malware classification, the aforementioned hierarchical structure, which can provide additional information to the classification models, has been ignored. In this paper, we propose the novel idea and study the performance of employing hierarchical learning algorithms for automated classification of malicious files. To the best of our knowledge, this is the first research effort which incorporates the hierarchical structure of the malware label in its automated classification and in the security domain, in general. It is important to note that our method does not require any additional effort by analysts because they typically assign these hierarchical labels today. Our empirical results on a real world, industrial-scale malware dataset of 3.6 million files demonstrate that incorporation of the label hierarchy achieves a significant reduction of 33.1% in the binary error rate as compared to a non-hierarchical classifier which is traditionally used in such problems.
{"title":"Hierarchical learning for automated malware classification","authors":"Shayok Chakraborty, J. W. Stokes, Lin Xiao, Dengyong Zhou, M. Marinescu, Anil Thomas","doi":"10.1109/MILCOM.2017.8170758","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170758","url":null,"abstract":"Despite widespread use of commercial anti-virus products, the number of malicious files detected on home and corporate computers continues to increase at a significant rate. Recently, anti-virus companies have started investing in machine learning solutions to augment signatures manually designed by analysts. A malicious file's determination is often represented as a hierarchical structure consisting of a type (e.g. Worm, Backdoor), a platform (e.g. Win32, Win64), a family (e.g. Rbot, Rugrat) and a family variant (e.g. A, B). While there has been substantial research in automated malware classification, the aforementioned hierarchical structure, which can provide additional information to the classification models, has been ignored. In this paper, we propose the novel idea and study the performance of employing hierarchical learning algorithms for automated classification of malicious files. To the best of our knowledge, this is the first research effort which incorporates the hierarchical structure of the malware label in its automated classification and in the security domain, in general. It is important to note that our method does not require any additional effort by analysts because they typically assign these hierarchical labels today. Our empirical results on a real world, industrial-scale malware dataset of 3.6 million files demonstrate that incorporation of the label hierarchy achieves a significant reduction of 33.1% in the binary error rate as compared to a non-hierarchical classifier which is traditionally used in such problems.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116051563","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 : 2017-10-01DOI: 10.1109/MILCOM.2017.8170773
Sebastián Echeverría, G. Lewis, Marc Novakouski, Jeff Boleng
Personnel operating in tactical environments heavily rely on information sharing to perform their missions. Solutions deployed in these environments need to focus on reliability and performance, in addition to usability to work as unattended as possible due to the often chaotic nature of operations. In this paper we propose a solution for delay-tolerant data sharing, in particular file sharing, using well supported, common networking protocols. The solution is based on the concept of broadcatching, which combines a delay-tolerant protocol such as BitTorrent with a publish/subscribe mechanism such as RSS to enable “many to one” information sharing. Experimental data shows that it is a promising approach for enabling reliable, mostly unattended data sharing on tactical networks in tactical environments.
{"title":"Delay-tolerant data sharing in tactical environments","authors":"Sebastián Echeverría, G. Lewis, Marc Novakouski, Jeff Boleng","doi":"10.1109/MILCOM.2017.8170773","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170773","url":null,"abstract":"Personnel operating in tactical environments heavily rely on information sharing to perform their missions. Solutions deployed in these environments need to focus on reliability and performance, in addition to usability to work as unattended as possible due to the often chaotic nature of operations. In this paper we propose a solution for delay-tolerant data sharing, in particular file sharing, using well supported, common networking protocols. The solution is based on the concept of broadcatching, which combines a delay-tolerant protocol such as BitTorrent with a publish/subscribe mechanism such as RSS to enable “many to one” information sharing. Experimental data shows that it is a promising approach for enabling reliable, mostly unattended data sharing on tactical networks in tactical environments.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124022721","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 : 2017-10-01DOI: 10.1109/MILCOM.2017.8170722
M. Hirsch, Azar Sadeghnejad, Héctor J. Ortiz-Peña
There has been a significant increase in the number of sensors deployed to accomplish military missions. These sensors might be on manned or unmanned resources, and might collect quantitative and/or qualitative information important for mission success. Of critical importance for mission success is ensuring that the collected information is routed to the people/systems that need the information for the proper making of decisions. For military applications, routing of information across a communication network has typically been accomplished using fixed, a priori defined, routing paths. When bandwidth between resources is unlimited, this presents no problems. However, in bandwidth constrained environments, when not all information is able to be routed across the network, then fixed routing paths presents limitations in information reaching appropriate consumers. In this research, we consider the advantages to using dynamic shortest temporal path routes for the information, as opposed to fixed routing paths. Multiple metrics show empirically the benefit to dynamic shortest path routes.
{"title":"Shortest paths for routing information over temporally dynamic communication networks","authors":"M. Hirsch, Azar Sadeghnejad, Héctor J. Ortiz-Peña","doi":"10.1109/MILCOM.2017.8170722","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170722","url":null,"abstract":"There has been a significant increase in the number of sensors deployed to accomplish military missions. These sensors might be on manned or unmanned resources, and might collect quantitative and/or qualitative information important for mission success. Of critical importance for mission success is ensuring that the collected information is routed to the people/systems that need the information for the proper making of decisions. For military applications, routing of information across a communication network has typically been accomplished using fixed, a priori defined, routing paths. When bandwidth between resources is unlimited, this presents no problems. However, in bandwidth constrained environments, when not all information is able to be routed across the network, then fixed routing paths presents limitations in information reaching appropriate consumers. In this research, we consider the advantages to using dynamic shortest temporal path routes for the information, as opposed to fixed routing paths. Multiple metrics show empirically the benefit to dynamic shortest path routes.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115653045","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 : 2017-10-01DOI: 10.1109/MILCOM.2017.8170797
Y. Vasavada, Deepak Arur, C. Ravishankar, C. Barnett
Although an external Global Navigational Satellite System (GNSS) solution is often relied upon for fixing the location of user terminals (UTs), fixing the UT position autonomously in LEO satellite systems is a tractable problem which has a system benefit. An autonomous solution comes to use if the GNSS solution becomes unavailable either temporarily (e.g., due to a delay in initial GNSS position fix) or for prolonged periods (due to major outages or regulatory constraints), or if the system security policies do not allow transmission of the user position over the air. In this paper, we describe two nonlinear root-finding algorithms (applicable either at the UT or at the satellite Gateway (GW)) that take as the inputs the delay and Doppler offset measurements from the physical layer receiver and generate an estimate of the user location (and optionally velocity) as the output. Algorithm simulation results suggest that a high accuracy estimate (in which position error exceeds 1 km in less than 10% cases) is possible when UT has visibility to more than one satellite, while less accurate results (e.g., ∼ 20% chance of position errors exceeding 2 km) are achievable in a single satellite scenario.
{"title":"User location determination using delay and Doppler measurements in LEO satellite systems","authors":"Y. Vasavada, Deepak Arur, C. Ravishankar, C. Barnett","doi":"10.1109/MILCOM.2017.8170797","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170797","url":null,"abstract":"Although an external Global Navigational Satellite System (GNSS) solution is often relied upon for fixing the location of user terminals (UTs), fixing the UT position autonomously in LEO satellite systems is a tractable problem which has a system benefit. An autonomous solution comes to use if the GNSS solution becomes unavailable either temporarily (e.g., due to a delay in initial GNSS position fix) or for prolonged periods (due to major outages or regulatory constraints), or if the system security policies do not allow transmission of the user position over the air. In this paper, we describe two nonlinear root-finding algorithms (applicable either at the UT or at the satellite Gateway (GW)) that take as the inputs the delay and Doppler offset measurements from the physical layer receiver and generate an estimate of the user location (and optionally velocity) as the output. Algorithm simulation results suggest that a high accuracy estimate (in which position error exceeds 1 km in less than 10% cases) is possible when UT has visibility to more than one satellite, while less accurate results (e.g., ∼ 20% chance of position errors exceeding 2 km) are achievable in a single satellite scenario.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128738746","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 : 2017-10-01DOI: 10.1109/MILCOM.2017.8170828
Yuan N. Li, P. Basu
Coordination among workers within a collaborative team environment is a key factor to its success but it is challenging to come up with a general model for relative costs and benefits of coordination. In a typical work environment, teams with sufficient aggregate expertise are selected to work on an incoming sequence of tasks one by one; it is often the case that the cost of coordination among the same set of workers within a team decreases over time for future tasks of similar difficulty since the workers get more familiar with each other. We study the problem of assigning available teams with adequate aggregate expertise to arriving tasks when the coordination cost can vary over time, as long as it does not increase over time. We propose an efficient team-to-task assignment algorithm that minimizes aggregate costs (due to assignment, coordination and context-switching). The algorithm automatically finds the number of times a specific team should be assigned to a task in the sequence by applying dynamic programming iteratively and guarantees a local optimal solution. We also study a strategy for team assembly in this time varying coordination cost scenario.
{"title":"Assigning teams to tasks under time-varying coordination costs","authors":"Yuan N. Li, P. Basu","doi":"10.1109/MILCOM.2017.8170828","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170828","url":null,"abstract":"Coordination among workers within a collaborative team environment is a key factor to its success but it is challenging to come up with a general model for relative costs and benefits of coordination. In a typical work environment, teams with sufficient aggregate expertise are selected to work on an incoming sequence of tasks one by one; it is often the case that the cost of coordination among the same set of workers within a team decreases over time for future tasks of similar difficulty since the workers get more familiar with each other. We study the problem of assigning available teams with adequate aggregate expertise to arriving tasks when the coordination cost can vary over time, as long as it does not increase over time. We propose an efficient team-to-task assignment algorithm that minimizes aggregate costs (due to assignment, coordination and context-switching). The algorithm automatically finds the number of times a specific team should be assigned to a task in the sequence by applying dynamic programming iteratively and guarantees a local optimal solution. We also study a strategy for team assembly in this time varying coordination cost scenario.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125371007","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 : 2017-10-01DOI: 10.1109/MILCOM.2017.8170830
Yu Rong, D. Bliss
We propose a likelihood test for a covariance estimated from sample data which is used to determine the number of narrow band source signals. This Minimum Description Length (MDL) estimator is shown to be robust against deviations from the assumption of equal noise level across the array. A number of source Direction-Of-Arrivals (DOA) greater than the number of physical array elements is of interest. We propose a novel spatial smoothing algorithm which accurately estimates parameters for the covariance likelihood test. Improved parameter estimation performance is achieved when compared with the conventional spatial smoothing algorithm. Finally, the proposed source number estimator is validated through numerical results and compared with other recently developed approaches.
{"title":"Underdetermined source number estimation based on complex wishart distribution using nested arrays","authors":"Yu Rong, D. Bliss","doi":"10.1109/MILCOM.2017.8170830","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170830","url":null,"abstract":"We propose a likelihood test for a covariance estimated from sample data which is used to determine the number of narrow band source signals. This Minimum Description Length (MDL) estimator is shown to be robust against deviations from the assumption of equal noise level across the array. A number of source Direction-Of-Arrivals (DOA) greater than the number of physical array elements is of interest. We propose a novel spatial smoothing algorithm which accurately estimates parameters for the covariance likelihood test. Improved parameter estimation performance is achieved when compared with the conventional spatial smoothing algorithm. Finally, the proposed source number estimator is validated through numerical results and compared with other recently developed approaches.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127518475","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 : 2017-10-01DOI: 10.1109/MILCOM.2017.8170748
Kevin Andrea, A. Gumusalan, R. Simon, H. Harney
Distributed Denial of Service (DDoS) attacks serve to diminish the ability of the network to perform its intended function over time. The paper presents the design, implementation and analysis of a protocol based upon a technique for address agility called DDoS Resistant Multicast (DRM). After describing the our architecture and implementation we show an analysis that quantifies the overhead on network performance. We then present the Simple Agile RPL multiCAST (SARCAST), an Internet-of-Things routing protocol for DDoS protection. We have implemented and evaluated SARCAST in a working IoT operating system and testbed. Our results show that SARCAST provides very high levels of protection against DDoS attacks with virtually no impact on overall performance.
{"title":"The design and implementation of a multicast address moving target defensive system for internet-of-things applications","authors":"Kevin Andrea, A. Gumusalan, R. Simon, H. Harney","doi":"10.1109/MILCOM.2017.8170748","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170748","url":null,"abstract":"Distributed Denial of Service (DDoS) attacks serve to diminish the ability of the network to perform its intended function over time. The paper presents the design, implementation and analysis of a protocol based upon a technique for address agility called DDoS Resistant Multicast (DRM). After describing the our architecture and implementation we show an analysis that quantifies the overhead on network performance. We then present the Simple Agile RPL multiCAST (SARCAST), an Internet-of-Things routing protocol for DDoS protection. We have implemented and evaluated SARCAST in a working IoT operating system and testbed. Our results show that SARCAST provides very high levels of protection against DDoS attacks with virtually no impact on overall performance.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127822515","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 : 2017-10-01DOI: 10.1109/MILCOM.2017.8170861
Jason A. Wampler, Chien Hsieh, Andrew Toth
The inherent nature of unattended sensors makes these devices most vulnerable to detection, exploitation, and denial in contested environments. Physical access is often cited as the easiest way to compromise any device or network. A new mechanism for mitigating these types of attacks developed under the Assistant Secretary of Defense for Research and Engineering, ASD(R&E) project, “Smoke Screen in Cyberspace”, was previously demonstrated in a live, over-the-air experiment. Smoke Screen encrypts, slices up, and disburses redundant fragments of files throughout the network. This paper describes enhancements to the disbursement of the file fragments routing improving the efficiency and time to completion of fragment distribution by defining the exact route, fragments should take to the destination. This is the first step in defining a custom protocol for the discovery of participating nodes and the efficient distribution of fragments in a mobile network. Future work will focus on the movement of fragments to avoid traffic analysis and avoid the collection of the entire fragment set that would enable an adversary to reconstruct the original piece of data.
{"title":"Efficient distribution of fragmented sensor data for obfuscation","authors":"Jason A. Wampler, Chien Hsieh, Andrew Toth","doi":"10.1109/MILCOM.2017.8170861","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170861","url":null,"abstract":"The inherent nature of unattended sensors makes these devices most vulnerable to detection, exploitation, and denial in contested environments. Physical access is often cited as the easiest way to compromise any device or network. A new mechanism for mitigating these types of attacks developed under the Assistant Secretary of Defense for Research and Engineering, ASD(R&E) project, “Smoke Screen in Cyberspace”, was previously demonstrated in a live, over-the-air experiment. Smoke Screen encrypts, slices up, and disburses redundant fragments of files throughout the network. This paper describes enhancements to the disbursement of the file fragments routing improving the efficiency and time to completion of fragment distribution by defining the exact route, fragments should take to the destination. This is the first step in defining a custom protocol for the discovery of participating nodes and the efficient distribution of fragments in a mobile network. Future work will focus on the movement of fragments to avoid traffic analysis and avoid the collection of the entire fragment set that would enable an adversary to reconstruct the original piece of data.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"2010 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123819132","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 : 2017-10-01DOI: 10.1109/MILCOM.2017.8170862
H. Yazdani, A. Vosoughi, N. Rahnavard
In this paper, we consider the problem of direction-of-arrival (DoA) estimation using electronically steerable parasitic array radiator (ESPAR) antenna based on compressive sensing. For an ESPAR antenna, the beampatterns and sparse model of DoA estimation problem in terms of overcomplete dictionary and sampling grid is presented. The DoA estimation problem is formulated as a mixed-norm ℓ2,1 minimization problem and the reactance domain multiple signal classification (RD-MUSIC) spatial spectrum for ESPAR antenna is introduced. Then, we propose reweighted greedy block coordinate descent (RW-GBCD) and reweighted ℓ2,1-SVD (RW-ℓ2,1-SVD) algorithms for DOA estimation using ESPAR. The performance of RW-GBCD for DoA estimation is compared to that of GBCD, ℓ2,1-SVD and RD-MUSIC algorithms. RW-GBCD benefits from less computational complexity compared to RW-ℓ2,1-SVD. Simulation results demonstrate that the performance of RW-GBCD is better than that of GBCD and ℓ2,1-SVD. When angle separation is less than 10°, RW-ℓ2,1-SVD outperforms RW-GBCD. However, when angle separation is more than 10°, the performance of RW-GBCD in terms of root mean square error (RMSE) is approximately the same as that of RW-ℓ2,1-SVD.
{"title":"Compressive sensing based direction-of-arrival estimation using reweighted greedy block coordinate descent algorithm for ESPAR antennas","authors":"H. Yazdani, A. Vosoughi, N. Rahnavard","doi":"10.1109/MILCOM.2017.8170862","DOIUrl":"https://doi.org/10.1109/MILCOM.2017.8170862","url":null,"abstract":"In this paper, we consider the problem of direction-of-arrival (DoA) estimation using electronically steerable parasitic array radiator (ESPAR) antenna based on compressive sensing. For an ESPAR antenna, the beampatterns and sparse model of DoA estimation problem in terms of overcomplete dictionary and sampling grid is presented. The DoA estimation problem is formulated as a mixed-norm ℓ<inf>2,1</inf> minimization problem and the reactance domain multiple signal classification (RD-MUSIC) spatial spectrum for ESPAR antenna is introduced. Then, we propose reweighted greedy block coordinate descent (RW-GBCD) and reweighted ℓ<inf>2,1</inf>-SVD (RW-ℓ<inf>2,1</inf>-SVD) algorithms for DOA estimation using ESPAR. The performance of RW-GBCD for DoA estimation is compared to that of GBCD, ℓ<inf>2,1</inf>-SVD and RD-MUSIC algorithms. RW-GBCD benefits from less computational complexity compared to RW-ℓ<inf>2,1</inf>-SVD. Simulation results demonstrate that the performance of RW-GBCD is better than that of GBCD and ℓ<inf>2,1</inf>-SVD. When angle separation is less than 10°, RW-ℓ<inf>2,1</inf>-SVD outperforms RW-GBCD. However, when angle separation is more than 10°, the performance of RW-GBCD in terms of root mean square error (RMSE) is approximately the same as that of RW-ℓ<inf>2,1</inf>-SVD.","PeriodicalId":113767,"journal":{"name":"MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126300098","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
扫码关注我们
求助内容：
应助结果提醒方式：