MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)最新文献_第8页

Evaluating physical-layer security for secondary users in cognitive radio systems with attackers 有攻击者的认知无线电系统中辅助用户的物理层安全性评估

MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM) Pub Date : 2017-10-01 DOI: 10.1109/MILCOM.2017.8170855

D. Rawat, Olumide Malomo, C. Bajracharya, Min Song

{"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}

引用次数: 1

Hierarchical learning for automated malware classification 用于自动恶意软件分类的分层学习

MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM) Pub Date : 2017-10-01 DOI: 10.1109/MILCOM.2017.8170758

Shayok Chakraborty, J. W. Stokes, Lin Xiao, Dengyong Zhou, M. Marinescu, Anil Thomas

{"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}

引用次数: 3

Delay-tolerant data sharing in tactical environments 战术环境中的容延迟数据共享

MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM) Pub Date : 2017-10-01 DOI: 10.1109/MILCOM.2017.8170773

Sebastián Echeverría, G. Lewis, Marc Novakouski, Jeff Boleng

引用次数: 2

Shortest paths for routing information over temporally dynamic communication networks 在临时动态通信网络上路由信息的最短路径

MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM) Pub Date : 2017-10-01 DOI: 10.1109/MILCOM.2017.8170722

M. Hirsch, Azar Sadeghnejad, Héctor J. Ortiz-Peña

{"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}

引用次数: 4

User location determination using delay and Doppler measurements in LEO satellite systems 在低轨道卫星系统中使用延迟和多普勒测量来确定用户位置

MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM) Pub Date : 2017-10-01 DOI: 10.1109/MILCOM.2017.8170797

Y. Vasavada, Deepak Arur, C. Ravishankar, C. Barnett

{"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}

引用次数: 1

Assigning teams to tasks under time-varying coordination costs 在协调成本随时间变化的情况下为团队分配任务

MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM) Pub Date : 2017-10-01 DOI: 10.1109/MILCOM.2017.8170828

Yuan N. Li, P. Basu

{"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}

引用次数: 1

Underdetermined source number estimation based on complex wishart distribution using nested arrays 基于嵌套数组的复杂wishart分布的待定源数估计

MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM) Pub Date : 2017-10-01 DOI: 10.1109/MILCOM.2017.8170830

Yu Rong, D. Bliss

引用次数: 0

The design and implementation of a multicast address moving target defensive system for internet-of-things applications 物联网多播地址移动目标防御系统的设计与实现

MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM) Pub Date : 2017-10-01 DOI: 10.1109/MILCOM.2017.8170748

Kevin Andrea, A. Gumusalan, R. Simon, H. Harney

引用次数: 5

Efficient distribution of fragmented sensor data for obfuscation 用于混淆的碎片传感器数据的有效分布

MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM) Pub Date : 2017-10-01 DOI: 10.1109/MILCOM.2017.8170861

Jason A. Wampler, Chien Hsieh, Andrew Toth

{"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}

引用次数: 2

Compressive sensing based direction-of-arrival estimation using reweighted greedy block coordinate descent algorithm for ESPAR antennas 基于压缩感知的ESPAR天线到达方向估计——重加权贪婪块坐标下降算法

MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM) Pub Date : 2017-10-01 DOI: 10.1109/MILCOM.2017.8170862

H. Yazdani, A. Vosoughi, N. Rahnavard

{"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}

引用次数: 7