MILCOM 2013 - 2013 IEEE Military Communications Conference最新文献

筛选
英文 中文
Protecting QoS in the Ciphertext Domain 在密文域中保护QoS
MILCOM 2013 - 2013 IEEE Military Communications Conference Pub Date : 2013-11-01 DOI: 10.1109/MILCOM.2013.226
Joanna N. Ptasinski, David R. Wasserman, R. Casey
{"title":"Protecting QoS in the Ciphertext Domain","authors":"Joanna N. Ptasinski, David R. Wasserman, R. Casey","doi":"10.1109/MILCOM.2013.226","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.226","url":null,"abstract":"The Automated Digital Network System (ADNS) provides network services and entry into the Defense Information System Network (DISN) for U.S. Navy ships, submarines and shore facilities. ADNS is the Navy's primary tactical wide area network (WAN) and intends to provide optimal use of the bandwidth assigned by the system to Unclassified, Secret, Sensitive Compartmented Information (SCI), and Joint and Coalition networks. As the primary tactical network interface between ships and shore-based RNOSC and NCTS, ADNS INC III is employed to support Mission Critical Command and Control (C2) communications and as such, ADNS INC III must provide protection against adversarial flooding attacks aimed at consuming a significant portion of our bandwidth. We are the first to show that through statistical ciphertext (CT) flow analysis using Maximum Entropy Estimation it is possible to detect malicious flooding attacks and to further police the protected core traffic to preserve Quality of Service (QoS).","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"12 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":"114605664","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}
引用次数: 0
Using Site-Specific, Ray-Tracing Channel Models to Control Wireless Testbeds 使用特定地点的光线追踪通道模型来控制无线试验台
MILCOM 2013 - 2013 IEEE Military Communications Conference Pub Date : 2013-11-01 DOI: 10.1109/MILCOM.2013.62
Keith Taylor, B. Walker, Richard Graham, Jason Matusiak
{"title":"Using Site-Specific, Ray-Tracing Channel Models to Control Wireless Testbeds","authors":"Keith Taylor, B. Walker, Richard Graham, Jason Matusiak","doi":"10.1109/MILCOM.2013.62","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.62","url":null,"abstract":"Laboratory-based multi-node wireless testbeds are essential to building and experimenting with mobile wireless networks such as MANETs, DTNs, or custom radios and protocols. Several systems based on many-to-many channel emulators have been built, however these systems rely on either a simple deterministic channel model such as free-space path loss, or a general stochastic channel model, where the only input determining channel characteristics is node distance. In order to more thoroughly test radio and protocol performance in a wider variety of scenarios, it is necessary to incorporate site-specific channel characteristics. We have experimented with using RF ray-tracing software to model site-specific real-world environments at the University of Maryland (UMD) campus. We have used these channel model predictions to drive two different types of channel emulator-based wireless testbeds, and have compared results from those testbeds to field tests in the actual locations. Finally, we have experimented with various levels of detail in our environment models to evaluate the payoff, in terms of realism, for spending extra time and resources to build highly-detailed environmental models.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"4 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":"128798591","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
Introduction of Dynamic Spectrum Access Technology in NATO Europe Tactical Communications 北约欧洲战术通信中动态频谱接入技术的介绍
MILCOM 2013 - 2013 IEEE Military Communications Conference Pub Date : 2013-11-01 DOI: 10.1109/MILCOM.2013.131
B. Scheers
{"title":"Introduction of Dynamic Spectrum Access Technology in NATO Europe Tactical Communications","authors":"B. Scheers","doi":"10.1109/MILCOM.2013.131","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.131","url":null,"abstract":"To facilitate the introduction of Dynamic Spectrum Access (DSA) technology and associated dynamic spectrum management (DSM) procedures in military tactical radio communication, a roadmap was presented to NATO CaP3 military session in Oct 2012. The main objective of the roadmap was to create a dedicated band for cognitive radio, in the hope that this would take away uncertainties about spectrum regulations and be a sufficient incentive for military communication industry to start investing and developing products. This paper describes the proposed roadmap and formulates the critics of the NATO spectrum managers (CaP3) on this proposition. Taking into account the remarks of CaP3, a possible way ahead is described. The most promising idea is to create a Military dual-priority band that would take into account the existing saturation of the VHF/UHF band, and meanwhile create a clear spectrum access model for future DSA systems.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"26 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":"128378249","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}
引用次数: 8
CREATE-NEST: A Distributed Cognitive Radio Network Platform with Physical Channel Awareness 一个具有物理信道感知的分布式认知无线网络平台
MILCOM 2013 - 2013 IEEE Military Communications Conference Pub Date : 2013-11-01 DOI: 10.1109/MILCOM.2013.283
Lei Ding, Y. Sagduyu, T. Melodia, Jason H. Li, Jared Feldman, J. Matyjas
{"title":"CREATE-NEST: A Distributed Cognitive Radio Network Platform with Physical Channel Awareness","authors":"Lei Ding, Y. Sagduyu, T. Melodia, Jason H. Li, Jared Feldman, J. Matyjas","doi":"10.1109/MILCOM.2013.283","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.283","url":null,"abstract":"We propose a Cognitive Radio nEtworking ArchiTecture (CREATE) with joint cross-layer design of routing and dynamic spectrum allocation that balances the throughput-delay trade-offs under realistic physical channel effects. Dynamic routing is implemented by integrating a spectrum-aware backpressure-like algorithm with shortest-path routing to improve both the average delay and the achievable throughput under hard deadline constraints. CREATE supports spectrum adaptability by establishing asynchronous negotiation and coordination channels instead of a dedicated common control channel. For end-to-end experimental evaluation of CREATE, we propose NEST, a Network Emulator and Simulator Testbed, to deploy and experiment with cognitive radio (CR) networking protocols and applications on real programmable radios. NEST combines a low-cost and scalable simulation environment with realistic hardware performance to provide high fidelity and repeatable CR network experiments. Our experimental results characterize the effects of network topology and physical channel on the spectrum agility, situational awareness and resiliency across the protocol stack in multi-hop CR networks.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"1 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":"129911320","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}
引用次数: 8
Confidential Spatial Multiplexing in the Presence of Eavesdropper 窃听器存在下的保密空间复用
MILCOM 2013 - 2013 IEEE Military Communications Conference Pub Date : 2013-11-01 DOI: 10.1109/MILCOM.2013.167
T. Khalaf, S. Kim
{"title":"Confidential Spatial Multiplexing in the Presence of Eavesdropper","authors":"T. Khalaf, S. Kim","doi":"10.1109/MILCOM.2013.167","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.167","url":null,"abstract":"In this paper, we present a confidential spatial multiplexing scheme in the presence of an eavesdropper, when the number of antennas at the source is less than that at the intended destination. To degrade the eavesdropper's channel, a pre-coded interference is added to the message at the source. The interference power at the intended destination is minimized via least square solution while it cannot be removed at the eavesdropper, thereby disabling a reliable reception of data at the eavesdropper. Secrecy capacity and the symbol error rate at the intended destination and the eavesdropper are analyzed.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"9 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":"127039232","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}
引用次数: 0
Graph Matching-Based Topology Reconfiguration Algorithm for Systems of Networked Autonomous Vehicles 基于图匹配的网络自动驾驶汽车系统拓扑重构算法
MILCOM 2013 - 2013 IEEE Military Communications Conference Pub Date : 2013-11-01 DOI: 10.1109/MILCOM.2013.155
Leenhapat Navaravong, J. Shea, E. Pasiliao, W. Dixon
{"title":"Graph Matching-Based Topology Reconfiguration Algorithm for Systems of Networked Autonomous Vehicles","authors":"Leenhapat Navaravong, J. Shea, E. Pasiliao, W. Dixon","doi":"10.1109/MILCOM.2013.155","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.155","url":null,"abstract":"As missions change or evolve, the formation of a system of networked autonomous vehicles may need to be reconfigured. When the vehicles communicate over a wireless ad hoc network, network connectivity may need to be preserved during the reconfiguration process. In addition, achieving the network topology associated with the desired final physical formation can then enable the physical formation to be achieved through a variety of formation control algorithms. In this paper, we focus on the problem of anonymous reconfiguration in which any vehicle in the initial formation of the system can be assigned to any of the positions in the final formation. We consider a key unsolved subproblem, which is how the nodes in the initial formation should be mapped onto the nodes in the final formation before the formation is reconfigured, while taking into account the needs to preserve network connectivity. We develop algorithms to solve this problem based on optimal and suboptimal graph-matching algorithms. We then apply these techniques with previously developed techniques to plan node movement to reconfigure the network topology while preserving network connectivity at all times. The performance of these techniques is evaluated via simulation.","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":"129203024","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
Cognitive Jamming Game for Dynamically Countering Ad Hoc Cognitive Radio Networks 动态对抗Ad Hoc认知无线网络的认知干扰博弈
MILCOM 2013 - 2013 IEEE Military Communications Conference Pub Date : 2013-11-01 DOI: 10.1109/MILCOM.2013.201
William G. Conley, Adam J. Miller
{"title":"Cognitive Jamming Game for Dynamically Countering Ad Hoc Cognitive Radio Networks","authors":"William G. Conley, Adam J. Miller","doi":"10.1109/MILCOM.2013.201","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.201","url":null,"abstract":"This paper demonstrates that game theory policies can adapt in realtime to enable a cognitive radio network and a cognitive jammer to engage in a game for control of the spectrum. Learning occurs as optimized actions are selected and played out in a dynamic RF propagation environment. System specific resource parameters are optimized for both the cognitive radio network and cognitive jammer. The goals of the two systems are different, the CRN seeks to be spectrally efficient while the jammer seeks to minimize data throughput. It is quixotic to model this interaction as a zero sum game, therefore a non-zero sum game is played. Additional flexibility of the jammer is considered when compared with previous works. Estimated performance results are shown.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"36 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":"123819714","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}
引用次数: 13
How to Prove Yourself to Multiple Parties: Energy-Efficient Multi-group Authentication 如何向多方证明自己:节能多组认证
MILCOM 2013 - 2013 IEEE Military Communications Conference Pub Date : 2013-11-01 DOI: 10.1109/MILCOM.2013.49
T. Halford
{"title":"How to Prove Yourself to Multiple Parties: Energy-Efficient Multi-group Authentication","authors":"T. Halford","doi":"10.1109/MILCOM.2013.49","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.49","url":null,"abstract":"Zero-knowledge identification (ZKI) schemes have been studied extensively in the cryptology literature and are currently being used commercially for radio frequency identification (RFID) authentication. Much like the public key cryptosystems that may be used to ensure message confidentiality, ZKI schemes rely on the hardness of certain problems -- e.g., factoring the product of large primes -- to provide secure authentication. In this paper, we extend existing ZKI schemes based on error-correcting codes to support multi-group authentication. In particular, we propose two schemes that enable a prover to simultaneously authenticate its membership in M ≥ 1 groups. The proposed multi-group authentication protocols are of particular relevance to military ad hoc networks, where group communications is the norm and energy efficiency is a critical performance metric.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"13 4 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":"121334469","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
Software-Defined Radio Based Automatic Blind Hierarchical Modulation Detector via Second-Order Cyclostationary Analysis and Fourth-Order Cumulant 基于二阶循环平稳分析和四阶累积量的软件无线电自动盲分层调制检测器
MILCOM 2013 - 2013 IEEE Military Communications Conference Pub Date : 2013-11-01 DOI: 10.1109/MILCOM.2013.82
Yang Qu, Xue Li, Ruolin Zhou, V. Chakravarthy, Zhiqiang Wu
{"title":"Software-Defined Radio Based Automatic Blind Hierarchical Modulation Detector via Second-Order Cyclostationary Analysis and Fourth-Order Cumulant","authors":"Yang Qu, Xue Li, Ruolin Zhou, V. Chakravarthy, Zhiqiang Wu","doi":"10.1109/MILCOM.2013.82","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.82","url":null,"abstract":"Modulation detection is important to many communication and electronic warfare applications. Recent developments in cognitive radio (CR) and dynamic spectrum access (DSA) network have also brought much attention to modulation detection of unknown radio frequency (RF) signals. It is well known that using second-order cyclostationary features, BPSK modulation can be easily distinguished from higher order modulations such as QPSK and QAM. However, these higher order modulations exhibit similar second-order cyclostationary features, thus theses features cannot be employed to further distinguish higher order modulations. To accurately detect and classify higher order modulations, higher order features such as higher order cumulants are desired. In this paper, we build a automatic blind hierarchical modulation detector to successfully classify the modulations of RF signals. Moreover, we use software defined radio (SDR) to implement and demonstrate a practical blind hierarchical modulation detector which can accurately distinguish among three popular modulations, i.e., BPSK, QPSK and 16-QAM. Specifically, second-order cyclostationary features using detailed spectral coherent function (SOF) are applied first to distinguish between BPSK modulation and non-BPSK modulations (e.g., QPSK and 16-QAM modulations) at first level of the hierarchical modulation detector. Next, the fourth-order cumulant feature is employed to the non-BPSK RF signals to distinguish between QPSK and 16-QAM. The SDR based modulation detector does not require any priori information of the RF transmission, and executes accurate detection in real time. Demonstrations in AWGN channel and realistic multi-path fading channel confirm the effectiveness and efficiency of the proposed modulation detector.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"10 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":"114203342","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}
引用次数: 13
Context Aware Data Acquisition Framework for Dynamic Data Driven Applications Systems (DDDAS) 动态数据驱动应用系统(DDDAS)的上下文感知数据采集框架
MILCOM 2013 - 2013 IEEE Military Communications Conference Pub Date : 2013-11-01 DOI: 10.1109/MILCOM.2013.65
Nhan Nguyen, Mohammad Maifi Hasan Khan
{"title":"Context Aware Data Acquisition Framework for Dynamic Data Driven Applications Systems (DDDAS)","authors":"Nhan Nguyen, Mohammad Maifi Hasan Khan","doi":"10.1109/MILCOM.2013.65","DOIUrl":"https://doi.org/10.1109/MILCOM.2013.65","url":null,"abstract":"Various dynamic data driven applications systems (DDDAS) such as battlefield monitoring, and autonomic control and management of swarms of UAVs often leverage multiple heterogeneous sensors, where the importance of a subset of sensors may increase or decrease due to the change in the execution environment. This may require adaptation of the sampling rate of different sensors accordingly. However, current solutions for optimal rate allocation do not consider the importance (or criticality) metric of sensors, which can cause the algorithms to ignore critical nodes altogether. In this paper, we address this challenge by developing a centralized algorithm that attempts to maximize the overall quality of information for the whole network given the utility functions and the importance rankings of sensor nodes. We also present a threshold based heuristic that may help system administrators to tune the algorithm to prevent omission of highly important nodes at critical times. Extensive evaluation of our algorithm in simulation for various scenarios shows that it can quickly adapt the sampling rate in response to the changed importance of sensor nodes.","PeriodicalId":379382,"journal":{"name":"MILCOM 2013 - 2013 IEEE Military Communications Conference","volume":"20 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113991021","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}
引用次数: 14
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信