In 2001, the Federal Communications Commission made available a large block of spectrum known as the 60 GHz band. The 60 GHz band is attractive because it provides the opportunity of multi-Gbps data rates with unlicensed commercial use. One of the main challenges facing the use of this band is poor propagation characteristics including high path loss and strong attenuation due to oxygen absorption. Antenna arrays have been proposed as a means of combating these effects. In this paper we study the feasibility of outdoor communication in the 60 GHz band. Because arrays are required for antenna gain and adaptability, we explore the use of arrays as a form of equalization in the presence of channel-induced intersymbol interference. A site-specific study is conducted using ray tracing to model an outdoor environment on the Virginia Tech campus. The performance of outdoor links is evaluated through simulation of the bit error probability.
{"title":"Feasibility Study of Outdoor Wireless Communication in the 60 GHz Band","authors":"D. Jakubisin, Claudio R. C. M. da Silva","doi":"10.1109/MILCOM.2013.213","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.213","url":null,"abstract":"In 2001, the Federal Communications Commission made available a large block of spectrum known as the 60 GHz band. The 60 GHz band is attractive because it provides the opportunity of multi-Gbps data rates with unlicensed commercial use. One of the main challenges facing the use of this band is poor propagation characteristics including high path loss and strong attenuation due to oxygen absorption. Antenna arrays have been proposed as a means of combating these effects. In this paper we study the feasibility of outdoor communication in the 60 GHz band. Because arrays are required for antenna gain and adaptability, we explore the use of arrays as a form of equalization in the presence of channel-induced intersymbol interference. A site-specific study is conducted using ray tracing to model an outdoor environment on the Virginia Tech campus. The performance of outdoor links is evaluated through simulation of the bit error probability.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114758511","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}
Lun Li, Y. Ibdah, Yanwu Ding, Homa Eghbali, S. Muhaidat, Xiu-rong Ma
This paper studies a multi-wall path loss propagation model for an indoor environment at 1.93 GHz of transmission frequency. The effects of locations, materials, and thickness of the walls are considered in the model. The loss factors are optimized and verified by the measurements. To implement the proposed model, image processing techniques are applied to the architectural floor plan in order to obtain the locations and thickness of the walls. Compared with the actual measurements, the proposed model provides higher accuracy in prediction of the path loss than some of the existing well-known empirical indoor channel models. To test the robustness of proposed model to the noise in the images of floor plans, four types of noise are added to the images when obtaining the locations and thickness of walls. Simulation results indicate that the performance of proposed model, unlike that of an existing model, is not degraded by the noise added to the image of floor plan.
{"title":"Indoor Multi-wall Path Loss Model at 1.93 GHz","authors":"Lun Li, Y. Ibdah, Yanwu Ding, Homa Eghbali, S. Muhaidat, Xiu-rong Ma","doi":"10.1109/MILCOM.2013.211","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.211","url":null,"abstract":"This paper studies a multi-wall path loss propagation model for an indoor environment at 1.93 GHz of transmission frequency. The effects of locations, materials, and thickness of the walls are considered in the model. The loss factors are optimized and verified by the measurements. To implement the proposed model, image processing techniques are applied to the architectural floor plan in order to obtain the locations and thickness of the walls. Compared with the actual measurements, the proposed model provides higher accuracy in prediction of the path loss than some of the existing well-known empirical indoor channel models. To test the robustness of proposed model to the noise in the images of floor plans, four types of noise are added to the images when obtaining the locations and thickness of walls. Simulation results indicate that the performance of proposed model, unlike that of an existing model, is not degraded by the noise added to the image of floor plan.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127687372","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}
Modern covert channel communication is the art of hiding secret information in legitimate network traffic in a way that cannot normally be detected by anyone other than the intended receiver. It is growing in its presence and sophistication. This type of communication enables the distribution of malicious or sensitive information and poses a significant network security problem to individuals, organizations, and governments. One popular method of covert communication in RTP streams is the transmission of one or more packets after significantly delaying them. As a result, any normal receiver will discard them as arriving late, whereas covert receivers successfully receive them to extract their payload subverted by the covert transmitter. This provides a covert channel method with significant throughput potential and thus high risk. In this paper we propose a method that can restrict this type of covert communication and prevent the distribution of secret information. Our proposed method takes advantage of buffering the sequence number of the received packets and thus detecting late packets, allowing it to discard them instead of delivering them to the receiver. Therefore, the covert receiver will not be able to intercept and observe these intentionally delayed packets, nor extracting the covert message. The in-depth analysis and our simulation results demonstrate that the proposed method is effective and capable of preventing this type of covert communication.
{"title":"Disrupting and Preventing Late-Packet Covert Communication Using Sequence Number Tracking","authors":"F. Rezaei, M. Hempel, D. Peng, H. Sharif","doi":"10.1109/MILCOM.2013.108","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.108","url":null,"abstract":"Modern covert channel communication is the art of hiding secret information in legitimate network traffic in a way that cannot normally be detected by anyone other than the intended receiver. It is growing in its presence and sophistication. This type of communication enables the distribution of malicious or sensitive information and poses a significant network security problem to individuals, organizations, and governments. One popular method of covert communication in RTP streams is the transmission of one or more packets after significantly delaying them. As a result, any normal receiver will discard them as arriving late, whereas covert receivers successfully receive them to extract their payload subverted by the covert transmitter. This provides a covert channel method with significant throughput potential and thus high risk. In this paper we propose a method that can restrict this type of covert communication and prevent the distribution of secret information. Our proposed method takes advantage of buffering the sequence number of the received packets and thus detecting late packets, allowing it to discard them instead of delivering them to the receiver. Therefore, the covert receiver will not be able to intercept and observe these intentionally delayed packets, nor extracting the covert message. The in-depth analysis and our simulation results demonstrate that the proposed method is effective and capable of preventing this type of covert communication.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127966852","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}
A system's ability to retain its capability when impacted by one or more threats is often referred to as its resilience. There is a desire within the U.S. Department of Defense (DoD) to quantitatively calculate resilience to compare the values of space system architectures. This paper presents a method for calculating a resilience value that represents an expected value of the retained capability for a particular threat scenario. A method for calculating a system resilience value over a range of threats is also presented as a secondary calculation.
{"title":"A Method for Calculation of the Resilience of a Space System","authors":"R. Burch","doi":"10.1109/MILCOM.2013.174","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.174","url":null,"abstract":"A system's ability to retain its capability when impacted by one or more threats is often referred to as its resilience. There is a desire within the U.S. Department of Defense (DoD) to quantitatively calculate resilience to compare the values of space system architectures. This paper presents a method for calculating a resilience value that represents an expected value of the retained capability for a particular threat scenario. A method for calculating a system resilience value over a range of threats is also presented as a secondary calculation.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131989987","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}
Thuy D. Nguyen, Mark A. Gondree, Jean Khosalim, C. Irvine
The Apache Hadoop® framework provides parallel processing and distributed data storage capabilities that data analytics applications can utilize to process massive sets of raw data. These Big Data applications typically run as a set of MapReduce jobs to take advantage of Hadoop's ease of service deployment and large-scale parallelism. Yet, Hadoop has not been adapted for multilevel secure (MLS) environments where data of different security classifications co-exist. To solve this problem, we have used the Security Enhanced Linux (SELinux) Linux kernel extension in a prototype cross-domain Hadoop on which multiple instances of Hadoop applications run at different sensitivity levels. Their accesses to Hadoop resources are constrained by the underlying MLS policy enforcement mechanism. A benefit of our prototype is its extension of the Hadoop Distributed File System to provide a cross-domain read-down capability for Hadoop applications without requiring complex Hadoop server components to be trustworthy.
Apache Hadoop®框架提供并行处理和分布式数据存储功能，数据分析应用程序可以利用这些功能来处理大量原始数据集。这些大数据应用程序通常作为一组MapReduce作业运行，以利用Hadoop的服务部署便利性和大规模并行性。然而，Hadoop还没有适应多级安全(MLS)环境，在这种环境中，不同安全分类的数据共存。为了解决这个问题，我们在一个原型跨域Hadoop中使用了Security Enhanced Linux (SELinux) Linux内核扩展，在这个原型上，Hadoop应用程序的多个实例以不同的敏感级别运行。它们对Hadoop资源的访问受到底层MLS策略执行机制的约束。我们的原型的一个好处是它扩展了Hadoop分布式文件系统，为Hadoop应用程序提供了跨域读取能力，而不需要复杂的Hadoop服务器组件是值得信赖的。
{"title":"Towards a Cross-Domain MapReduce Framework","authors":"Thuy D. Nguyen, Mark A. Gondree, Jean Khosalim, C. Irvine","doi":"10.1109/MILCOM.2013.243","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.243","url":null,"abstract":"The Apache Hadoop® framework provides parallel processing and distributed data storage capabilities that data analytics applications can utilize to process massive sets of raw data. These Big Data applications typically run as a set of MapReduce jobs to take advantage of Hadoop's ease of service deployment and large-scale parallelism. Yet, Hadoop has not been adapted for multilevel secure (MLS) environments where data of different security classifications co-exist. To solve this problem, we have used the Security Enhanced Linux (SELinux) Linux kernel extension in a prototype cross-domain Hadoop on which multiple instances of Hadoop applications run at different sensitivity levels. Their accesses to Hadoop resources are constrained by the underlying MLS policy enforcement mechanism. A benefit of our prototype is its extension of the Hadoop Distributed File System to provide a cross-domain read-down capability for Hadoop applications without requiring complex Hadoop server components to be trustworthy.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133995855","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}
Batch-mode maximum likelihood (ML) received signal strength (RSS) emitter geolocation algorithms produce location estimates from a block of data collected over an observation period using either a single sensor or collected at one time instant by multiple spatially dispersed sensors. Due to practical constraints such as processor speed, memory for data storage, time for data transfer and communications bandwidth, batch-mode algorithms can only be implemented in real-time for small data sets. This paper presents an iterative formulation of the likelihood function for the ML RSS geolocation algorithm for real-time implementation with large data sets. Simulation and experimental results are included to validate the proposed formulation.
{"title":"Received Signal Strength-Based Emitter Geolocation Using an Iterative Maximum Likelihood Approach","authors":"Sichun Wang, B. Jackson, S. Rajan, F. Patenaude","doi":"10.1109/MILCOM.2013.21","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.21","url":null,"abstract":"Batch-mode maximum likelihood (ML) received signal strength (RSS) emitter geolocation algorithms produce location estimates from a block of data collected over an observation period using either a single sensor or collected at one time instant by multiple spatially dispersed sensors. Due to practical constraints such as processor speed, memory for data storage, time for data transfer and communications bandwidth, batch-mode algorithms can only be implemented in real-time for small data sets. This paper presents an iterative formulation of the likelihood function for the ML RSS geolocation algorithm for real-time implementation with large data sets. Simulation and experimental results are included to validate the proposed formulation.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131029218","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}
Commercial Solutions for Classified (CSfC) Mobility, as architected and described by the National Security Agency (NSA) in the Mobility Capability Package, provides military and other government agencies with new alternatives for implementing classified communications systems using modern commercial mobile devices and a layered security model to achieve end-to-end assurance of an uncompromised voice and/or data path. As circuit switched data support by mobile carriers wanes, new methods of providing assured communications paths are needed to replace the legacy devices currently in use. The Mobility Capability Package architecture based on CSfC principles provides warfighters and senior leaders with a secure communications architecture that can evolve as industry evolves, providing for the more rapid introduction and adoption of emerging technologies in support of critical missions.
{"title":"Sharktank: The SeCAN Lab \"Tip of the Spear\" for Commercial Solutions for Classified Mobility Systems","authors":"Bobby Murphy, A. Akinpelu, A. DeSimone, J. Forte","doi":"10.1109/MILCOM.2013.234","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.234","url":null,"abstract":"Commercial Solutions for Classified (CSfC) Mobility, as architected and described by the National Security Agency (NSA) in the Mobility Capability Package, provides military and other government agencies with new alternatives for implementing classified communications systems using modern commercial mobile devices and a layered security model to achieve end-to-end assurance of an uncompromised voice and/or data path. As circuit switched data support by mobile carriers wanes, new methods of providing assured communications paths are needed to replace the legacy devices currently in use. The Mobility Capability Package architecture based on CSfC principles provides warfighters and senior leaders with a secure communications architecture that can evolve as industry evolves, providing for the more rapid introduction and adoption of emerging technologies in support of critical missions.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132186114","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}
This paper proposes novel nonlinear mismatched filters for classes of aperiodic codes. They are constructed by combining one or more matched filter outputs additively and multiplicatively. The final output has just the mainlobe and zero sidelobes. The proposed mismatched filters do not widen the mainlobe and incur little additional delay. When combined with subchip encoding, which is proposed in this paper as an alternative to the regular sinusoidal chip, the mainlobe width is reduced. This improves range resolution in radar applications and timing and synchronization precision in communications applications.
{"title":"Zero Sidelobe Aperiodic Codes via Additive-Multiplicative Mismatched Filtering","authors":"A. Fam, F. Qazi, Ravi Kadlimatti","doi":"10.1109/MILCOM.2013.146","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.146","url":null,"abstract":"This paper proposes novel nonlinear mismatched filters for classes of aperiodic codes. They are constructed by combining one or more matched filter outputs additively and multiplicatively. The final output has just the mainlobe and zero sidelobes. The proposed mismatched filters do not widen the mainlobe and incur little additional delay. When combined with subchip encoding, which is proposed in this paper as an alternative to the regular sinusoidal chip, the mainlobe width is reduced. This improves range resolution in radar applications and timing and synchronization precision in communications applications.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132505040","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}
B. Holbert, S. Tati, S. Silvestri, T. L. Porta, A. Swami
Network components may experience faults for a variety of reasons, but it may not be immediately obvious which component failed. Fault diagnosis algorithms are required to localize failures and thereby enable the recovery process. Most current state of the art fault diagnosis algorithms assume full knowledge of the network topology, which may not be available in real scenarios. In this paper we examine the performance of one of these fault diagnosis algorithms, namely Max-Coverage (MC), when the topology is only partially known. We introduce a simple extension, called the Virtual Topology (VT), to correctly identify faults when a failure occurs in an unobserved component. We compare the performance of MC under partial topology knowledge with and without this extension to show that VT significantly improves correct diagnosis, but at the cost of a high number of false positives. Moreover, we demonstrate that correctly inferring areas of the unobserved network substantially mitigates the drawbacks associated with using VT.
{"title":"Effects of Partial Topology on Fault Diagnosis","authors":"B. Holbert, S. Tati, S. Silvestri, T. L. Porta, A. Swami","doi":"10.1109/MILCOM.2013.129","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.129","url":null,"abstract":"Network components may experience faults for a variety of reasons, but it may not be immediately obvious which component failed. Fault diagnosis algorithms are required to localize failures and thereby enable the recovery process. Most current state of the art fault diagnosis algorithms assume full knowledge of the network topology, which may not be available in real scenarios. In this paper we examine the performance of one of these fault diagnosis algorithms, namely Max-Coverage (MC), when the topology is only partially known. We introduce a simple extension, called the Virtual Topology (VT), to correctly identify faults when a failure occurs in an unobserved component. We compare the performance of MC under partial topology knowledge with and without this extension to show that VT significantly improves correct diagnosis, but at the cost of a high number of false positives. Moreover, we demonstrate that correctly inferring areas of the unobserved network substantially mitigates the drawbacks associated with using VT.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133823554","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}
Geographic addressing (GA) is a way of addressing messages in a network. In GA, the destination of a message is specified as a geographic region. The network delivers the message to all devices in that region. A representative application is to distribute Common Operating Picture updates to interested devices. This paper extends previous research on GA to handle challenging problems arising in real-world implementations: large scale, network heterogeneity and multiple security domains. After first laying out the problem and challenges, we describe SGAF, a scalable geographic addressing framework for building and combining scalable GA systems. We illustrate and evaluate SGAF using a case study of one implementation of the framework, the AT&T Labs Geocast System.
{"title":"Scaling Up a Geographic Addressing System","authors":"R. Hall, J. Auzins, J. Chapin, Barry Fell","doi":"10.1109/MILCOM.2013.34","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.34","url":null,"abstract":"Geographic addressing (GA) is a way of addressing messages in a network. In GA, the destination of a message is specified as a geographic region. The network delivers the message to all devices in that region. A representative application is to distribute Common Operating Picture updates to interested devices. This paper extends previous research on GA to handle challenging problems arising in real-world implementations: large scale, network heterogeneity and multiple security domains. After first laying out the problem and challenges, we describe SGAF, a scalable geographic addressing framework for building and combining scalable GA systems. We illustrate and evaluate SGAF using a case study of one implementation of the framework, the AT&T Labs Geocast System.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115355232","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
扫码关注我们
求助内容：
应助结果提醒方式：