J. Boksiner, Yuriy Posherstnik, H. McDonald, Konstantine Arkoudas, R. Chadha, C. Chiang, A. Mody, M. Sherman
{"title":"Policy-based spectrum management architecture","authors":"J. Boksiner, Yuriy Posherstnik, H. McDonald, Konstantine Arkoudas, R. Chadha, C. Chiang, A. Mody, M. Sherman","doi":"10.1109/MILCOM.2012.6415720","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415720","url":null,"abstract":"The Department of Defense (DoD) is developing policy-based spectrum management (PBSM) concepts, architectures, and capabilities to improve DoD's use of the electromagnetic spectrum, particularly in the area of edge networking. This use of PBSM is a paradigm shift in the way DoD will manage the use of the electromagnetic spectrum in support of Dynamic Spectrum Access (DSA) enabled Policy Based Radios (PBRs). The multifaceted implications of PBSM need to be understood so that required changes to spectrum-related business processes (and the data and automated capabilities used within these processes) can be identified and coordinated with stakeholders. A major element of PBSM is the generation, distribution, and consumption of Digital Spectrum Policy (DSP) by DSA-enabled PBRs. The US Army Communications Electronics Research Development Engineering Center (CERDEC) is developing a broad set of DSA/PBSM-related capabilities including tools to generate DSP. The Defense Information Systems Agency Defense Spectrum Organization (DSO) is developing enterprise solutions for DSA/PBSM. CERDEC and DSO collaborated with BAE Systems and Applied Communication Sciences on the development of an end-to-end PBSM architecture called DSA Policy Management Architecture (DPMA). This paper presents a summary of the architecture development.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"40 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79615284","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}
{"title":"Resource allocation for OFDM underwater acoustic cooperative transmission with limited feedback","authors":"Xiaopeng Huang, V. Lawrence","doi":"10.1109/MILCOM.2012.6415766","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415766","url":null,"abstract":"The underwater acoustic (UWA) communication has been regarded as one of the most challenging wireless communications due to the unique properties, such as limited bandwidth, extended multipath delay, medium inhomogeneities, rapid time-variation and large Doppler shifts. Cooperative relaying technique is a promising technique to provide high rate data transmission. However, literature on cooperative communications in UWA environments is very scarce. In this paper, we propose a novel UWA cooperative communication system, which involves the wave cooperative (WC) transmission protocol, Orthogonal Frequency Division Multiplexing (OFDM) and the Lloyd algorithm-based limited feedback procedure for the first time. We take capacity criterion-based power allocation strategy as an example to demonstrate the performance of our proposed system. Simulation results show the system capacity performance based on uniform allocation (non-feedback), several bits of feedback and perfect feedback. Furthermore, simulation results compare the performance between the WC transmission protocol and the traditional amplify-and-forward (AF) transmission protocol.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"258 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83502876","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}
Tuan Nguyen, S. Lam, Ceasar Castro, R. Ogden, C. Tran, A. Legaspi
{"title":"Naval Task Force interface for Coalition Networks for Secure Information Sharing (CoNSIS)","authors":"Tuan Nguyen, S. Lam, Ceasar Castro, R. Ogden, C. Tran, A. Legaspi","doi":"10.1109/MILCOM.2012.6415884","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415884","url":null,"abstract":"Merging IP routing and mobile communication poses many challenges especially for a dynamic, heterogeneous networking environment such as a Naval Task Force. In this paper, we present an effort to design, develop, test and demonstrate an interoperable coalition interface for a Naval Task Force for the four-nation Coalition Networks for Secure Information Sharing (CoNSIS) project. A field experimentation has been performed between the four CoNSIS nations with the separate national sites being connected via the Internet. The key architectural objective of the United States (US) is to support tactical coalition networks of the other nations. The routing architecture is based on Open Shortest Path First Version 3 (OSPFv3) in conjunction with two main features, namely (1) IPv6 address auto configuration enabled on mobile links to alleviate administrative burden, and (2) Address Family (AF) support to allow IPv4 traffic to be passed via IPv6 backbone. In addition, Point-to-Point Protocol over Ethernet (PPPoE) with Flow Credit and Link Metric extensions is used to provide mobile networks via point-to-multipoint links with support for Quality of Service (QoS). Furthermore, link encryptors secure the network, which make use of Dynamic Discovery mechanisms to determine remote routing endpoints.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"67 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86116193","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}
{"title":"Branch and Bound with M algorithm for near optimal MIMO detection with higher order QAM constellation","authors":"Ali A. Elghariani, M. Zoltowski","doi":"10.1109/MILCOM.2012.6415856","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415856","url":null,"abstract":"For multiple-input multiple-output (MIMO) systems, the optimum maximum likelihood (ML) detection requires tremendous complexity as the number of antennas or modulation level increases. This paper proposes a new algorithm which attains the ML performance with significantly reduced complexity. The proposed scheme is based on combining Branch and Bound algorithm (which solves an integer quadratic programming (IQP) problem in each node of the search tree) with M-Algorithm (which chooses M reliable candidates nodes out of the available nodes, in each stage of the search tree, and retain them) and hence we call it BB-M algorithm. The basic idea is analogues to the conventional QRD-M that presented in the literature, but the internal procedures of the algorithm is different, as the proposed algorithm uses the IQP based on BB algorithm. Not just that but also to reach maximum likelihood (ML) performance, the M value in BB-M is less than M in QRD-M. Simulation results show that the proposed detection scheme provides comparable performance to the ML at small M with fixed complexity regardless of the SNR and the constellation size. Hence, it is a promising scheme for optimal and near optimal performance of MIMO systems when adopting higher order QAM constellations.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"130 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73312103","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}
Jaime C. Acosta, Humberto Mendoza, Brenda G. Medina
{"title":"An efficient common substrings algorithm for on-the-fly behavior-based malware detection and analysis","authors":"Jaime C. Acosta, Humberto Mendoza, Brenda G. Medina","doi":"10.1109/MILCOM.2012.6415819","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415819","url":null,"abstract":"It is well known that malware (worms, botnets, etc...) thrive on communication systems. The process of detecting and analyzing malware is very latent and not well-suited for real-time application, which is critical especially for propagating malware. For this reason, recent methods identify similarities among malware dynamic trace logs to extract malicious behavior snippets. These snippets can then be tagged by a human analyst and be used to identify malware on-the-fly. A major problem with these methods is that they require extensive processing resources. This is especially due to the large amount of malware released each year (upwards of 17 million new instances in 2011). In this paper, we present an efficient algorithm for identifying common substrings in dynamic trace events of malware collections. The algorithm finds common substrings between malware pairs in theoretical linear time by using parallel processing. The algorithm is implemented in the CUDA and results show a performance increase of up to 8 times compared to previous implementations.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"37 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91552290","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}
{"title":"Some remarks on the Dirac delta function approximation for ASER analysis of digital modulations over fading channels","authors":"E. Adebola, O. Olabiyi, A. Annamalai","doi":"10.1109/MILCOM.2012.6415874","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415874","url":null,"abstract":"In this article, we apply two distinct methods to obtain simple closed-form approximations for the average symbol error rate (ASER) performance metric of a broad class of coherent digital modulations in a myriad of fading environments (with/without diversity), which are known to be analytically involved as they require evaluation of the expectation of the Gaussian Q-function and/or its integer powers. In the first approach, we exploit the shifting property of Dirac delta approximations of the Q-function to circumvent the need for integration. In the second approach, we introduce tight exponential-type approximations for the Q-function that directly lead to the development of closed-form expressions for the ASER in terms of only the moment generating function (MGF) of the received signal-to-noise ratio (SNR) random variable. Numerical results reveal that our proposed solutions based on the MGF method are much more versatile and can yield better accuracy compared to our approximations derived via the Dirac delta approximation technique.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"135 7 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88647509","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}
{"title":"Properization of second-order cyclostationary random processes and its application to signal presence detection","authors":"Jeong Ho Yeo, Joon Ho Cho","doi":"10.1109/MILCOM.2012.6415748","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415748","url":null,"abstract":"In this paper, we show that a second-order cyclo-stationary (SOCS) random process, whether it is proper or improper, can be always converted to an equivalent proper-complex SOCS random process with twice the cycle period. A simple linear-conjugate linear periodically time-varying operator called a FREquency SHift (FRESH) properizer is proposed to perform this conversion. As an application, we consider the presence detection of an improper-complex SOCS random process, which well models the complex envelopes of digitally modulated signals such as pulse amplitude modulation (PAM), staggered quaternary phase-shift keying (SQPSK), Gaussian minimum shift keying (GMSK), etc. In particular, the optimal presence detector that utilizes the FRESH properizer is derived for improper-complex SOCS Gaussian random processes, which provides the lower bound on the detection error probabilities. The derived optimal detector, which has the structural advantage in that it consists of a FRESH properizer followed by a single linear filter, achieves the same performance as the conventional detector that consists of parallel-connected linear and conjugate-linear filters. Numerical results are also provided.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"6 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90599647","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}
C. Danilov, T. Henderson, O. Brewer, J. H. Kim, J. Macker, B. Adamson
{"title":"Elastic multicast for tactical communications","authors":"C. Danilov, T. Henderson, O. Brewer, J. H. Kim, J. Macker, B. Adamson","doi":"10.1109/MILCOM.2012.6415824","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415824","url":null,"abstract":"This paper presents a multicast routing mechanism supporting the classical IP multicast service model that can dynamically use redundant forwarding in the parts of the network affected by a high rate of topology changes, while converging to regular multicast distribution trees where or when the network becomes relatively stable. The rationale is that intermittent connectivity directly affects the ability of routers to synchronize on their view of the network, thus making it difficult to converge on efficient distribution trees, while network wide broadcast may be prohibitively expensive for relatively sparse groups. We describe a hybrid approach, called Elastic Multicast, which dynamically expands to limited scope broadcast when needed, and converges single path forwarding if the network is stable, through independent routing decisions made at each node.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"12 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84090064","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}
{"title":"Novel Quadrifilar Helix Antenna combining GNSS, Iridium, and a UHF communications monopole","authors":"P. Elliot, E. Rosario, R. Davis","doi":"10.1109/MILCOM.2012.6415689","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415689","url":null,"abstract":"A multi-use antenna system for integrated communications and navigation capability was developed. A GPS/GNSS/Iridium antenna is co-located with a UHF communications monopole on a handset. The GPS/GNSS/Iridium antenna is a folded Quadrifilar Helix Antenna (QHA) with novel features to improve frequency coverage compared to existing QHA designs. This QHA antenna is co-located concentrically (co-axially) around the UHF monopole which increases the gain of the UHF monopole by several dB over most of the UHF 225-512 MHz band. Co-locating the QHA and monopole also reduces the area needed on the transceiver. The GNSS frequencies covered include modernized GPS (L1, L2, L5), GLONASS, Galileo, and Beidou (Compass), spanning from 1164 to 1300 MHz and 1559 to 1611 MHz. The Iridium communications transmit and receive band (1611-1626 MHz) is also covered, and UHF.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"4 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85356956","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}
{"title":"Channel characterization and throughput tradeoff for wireless sensor networks","authors":"Leonard E. Lightfoot, Ellen Laubie","doi":"10.1109/MILCOM.2012.6415681","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415681","url":null,"abstract":"With the growing number of wireless network standards operating in the unlicensed frequency band and the military moving toward commercial off the shelf technology, the next generation of wireless sensor networks must be robust against unintentional and hostile interference. One method that has gained interest to cope with the increased spectrum use and to combat the interference vulnerability in wireless sensor networks is frequency agile communication. These techniques typically entail spectrum sensing and dynamic frequency channel allocation. In this paper, the energy detection mechanism is used to investigate how the number of frequency channels characterized for spectrum sensing impacts the accuracy of frequency channel selection and how the number of channels characterized affects the achievable throughput. From the investigation, we observed a tradeoff between the number of channels characterized, the number of energy samples used in energy detection, and the achievable throughput.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"11 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86293507","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}