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

筛选
英文 中文
Clustering methods for distributed spectrum sensing in cognitive radio systems 认知无线电系统中分布式频谱感知的聚类方法
MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753432
A. Malady, C. da Silva
{"title":"Clustering methods for distributed spectrum sensing in cognitive radio systems","authors":"A. Malady, C. da Silva","doi":"10.1109/MILCOM.2008.4753432","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753432","url":null,"abstract":"It is known that the reliability of spectrum sensing in cognitive radio systems has the potential to improve when this critical process is performed distributively by multiple radios. In situations in which a large number of cognitive radios are present in a given geographical area, these radios will likely have to be divided into multiple sensing clusters in order to keep bandwidth and power requirements manageable. In this paper, we propose different clustering methods for distributed spectrum sensing and evaluate their performance in terms of sensing reliability and resultant spectrum efficiency. The use of position information by clustering methods is also considered.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128932456","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}
引用次数: 60
Packet acquisition for low-complexity frequency-hop receivers 低复杂度频率跳接收器的数据包采集
MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753238
F. J. Block, Hoang-Sy Nguyen
{"title":"Packet acquisition for low-complexity frequency-hop receivers","authors":"F. J. Block, Hoang-Sy Nguyen","doi":"10.1109/MILCOM.2008.4753238","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753238","url":null,"abstract":"The diversity provided by frequency-hop (FH) signaling can protect against jamming and multiple access interference (MAI). A FH transmission consists of two parts - an acquisition preamble and a data payload. The acquisition preamble allows the receiver to detect and synchronize with an incoming packet. Acquisition must be at least as robust as demodulation and decoding. If acquisition fails, the receiver is unable to process the payload. Once acquisition has occurred, a receiver can simply tune a narrowband demodulator to the current hopping channel. However, during the acquisition stage, the lack of timing information makes it impossible to know what the current channel is. Instead, the optimal receiver must make an acquisition decision by simultaneously processing all channels over which the preamble is spread. If the preamble uses M channels, the receiver must have resources to tune to all M. Thus, it is desirable that M be small to keep the receiverpsilas complexity low. However, if M is small, the preamble lacks frequency diversity and may be vulnerable to jamming and MAI. We consider FH acquisition for cases where the preamble has limited frequency diversity and explore the trade-offs that must be made for robust performance in the presence of interference.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129065703","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}
引用次数: 10
TSAT network architecture TSAT网络架构
MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753508
J. Pulliam, Y. Zambre, A. Karmarkar, V. Mehta, J. Touch, J. Haines, M. Everett
{"title":"TSAT network architecture","authors":"J. Pulliam, Y. Zambre, A. Karmarkar, V. Mehta, J. Touch, J. Haines, M. Everett","doi":"10.1109/MILCOM.2008.4753508","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753508","url":null,"abstract":"The Transformational Satellite Communications System (TSAT) is poised to become the DoD's next generation protected and processed satellite system. This paper describes the network architecture of the TSAT system. The presence of a high capacity IP router on the satellite pay- load is a key distinguishing feature of the TSAT system. The TSAT pay load also provides RF and optical circuit switching capabilities. We describe the physical elements which comprise the TSAT network, and their interconnecting TSAT mechanisms that support fixed and mobile terminals, and the approach TSAT uses to support time- varying link conditions. We discuss key network protocols, communications standards and technologies employed within the TSAT system, with particular focus on routing, quality of service, network services, and network security. This paper also presents the TSAT approach towards supporting circuit services, as well as providing security at physical and link layer.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131025434","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}
引用次数: 25
Cooperative communications for improved throughput, range and covertness 协作通信,提高吞吐量,范围和隐蔽性
MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753032
Yiftach Eisenberg, Cedric Logan Bae
{"title":"Cooperative communications for improved throughput, range and covertness","authors":"Yiftach Eisenberg, Cedric Logan Bae","doi":"10.1109/MILCOM.2008.4753032","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753032","url":null,"abstract":"Conventional wireless communication systems are designed based on point-to-point links whose performance is limited by the resources of a single transmitter, e.g., power and bandwidth. Cooperative communications on the other hand is an emerging and actively researched class of techniques that enables nodes to increase their performance by harnessing resources from other local neighboring nodes. This paper presents a cooperative communications approach called Extended Communications using Helper Organizations (ECHO) that can increase throughput, communication range, and covertness. One militarily significant benefit, first identified and analyzed in this paper, is that cooperative communications approaches are difficult to geo-locate. A cooperative communications link, such as ECHO, is hard to geo-locate because it appears to the adversary as multiple spatially distributed low power transmissions rather then a single high power source, as in conventional point-to-point communications. This paper introduces the general ECHO approach and presents a theoretical framework for quantifying itpsilas expected performance gains using information theory and estimation theory. ECHO can dramatically improve performance for a variety of military applications including sensor networks, MANETs, SATCOM, and ground based communications.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123731583","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
DVoIP: Dynamic Voice-over-IP transformations for quality of service in bandwidth constrained environments DVoIP:带宽受限环境中用于服务质量的动态ip语音转换
MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753351
M. Craven, T.N. Le, P. Lardieri
{"title":"DVoIP: Dynamic Voice-over-IP transformations for quality of service in bandwidth constrained environments","authors":"M. Craven, T.N. Le, P. Lardieri","doi":"10.1109/MILCOM.2008.4753351","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753351","url":null,"abstract":"Voice-over-IP (VoIP) call streams suffer from poor quality when the available bandwidth drops below the minimum requirements for the call. Dynamic VoIP (DVoIP) improves quality by performing on-the-fly transformations on VoIP streams to reduce the bandwidth requirements of the call. DVoIP reduces bandwidth requirements by transcoding high-bitrate codecs to low-bandwidth ones and by aggregating the contents of multiple VoIP packets into a single DVoIP packet. With little to no increase in latency or decrease in voice quality, DVoIP can ensure zero packet loss for active calls.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130538799","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}
引用次数: 6
A stochastic approximation approach for improving intrusion detection data fusion structures 一种改进入侵检测数据融合结构的随机逼近方法
MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753175
K. Manousakis, D. Sterne, N. Ivanic, G. Lawler, A. Mcauley
{"title":"A stochastic approximation approach for improving intrusion detection data fusion structures","authors":"K. Manousakis, D. Sterne, N. Ivanic, G. Lawler, A. Mcauley","doi":"10.1109/MILCOM.2008.4753175","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753175","url":null,"abstract":"A variety of attacks on MANET routing, forwarding, and infrastructure protocols can only be detected using distributed cooperative algorithms. One promising strategy is to organize cooperative intrusion detection activities as a multiple-level intrusion detection (ID) hierarchy in which each node reports intrusion detection observations to its parent. This enables detection decisions to be based on aggregated data that has been gathered and consolidated from neighborhoods and larger network regions efficiently. A key challenge is the selection and maintenance of a scalable and robust hierarchy that optimizes detection performance (e.g., low latency, continuous coverage) while incurring minimal cost (e.g., bandwidth consumption). Existing approaches to constructing hierarchies in MANETs based on simple heuristics lack flexibility and cannot simultaneously address diverse performance and cost requirements. Moreover, mobility can produce constant large scale changes in the hierarchy that can degrade performance and increase cost. The main contributions of this paper are to: (a) identify ID structure design requirements and formulate them as objective functions and constraints, (b) adapt a multi-objective optimization framework to the formation of ID structures and, (c) provide indicative results concerning the quality of these structures with respect to the ID design requirements.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130781286","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}
引用次数: 17
The performance of flexible LDPC codes on Gaussian channels with bursty erasures 具有突发擦除的高斯信道上柔性LDPC码的性能
MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753230
C. Kose, T. Halford
{"title":"The performance of flexible LDPC codes on Gaussian channels with bursty erasures","authors":"C. Kose, T. Halford","doi":"10.1109/MILCOM.2008.4753230","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753230","url":null,"abstract":"The burst-erasure channel with additive white Gaussian noise (AWGN), or BuEC-G, is useful both as an abstraction of a number of military communications channels, and as a surrogate for the design of codes on correlated Rayleigh fading channels. While codes for the BuEC-G have been presented in the literature, the focus has largely been on highly optimized inflexible point designs that are not amenable to low-complexity, high-throughput decoder implementation in hardware. In this paper, the performance of TrellisWare Technologies, Inc.psilas Flexible Low-Density Parity-Check (F-LDPC) code family on the BuEC-G is investigated. In order to the improve the burst-erasure correction capability of existing F-LDPC designs, without sacrificing flexibility, partial channel interleaving is employed. The performance of thus modified F-LDPC codes is shown to match that of a number of point designs reported in the literature.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130792815","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
Policy management in airborne tactical networks 空中战术网络中的策略管理
MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753463
G. Kuthethoor, P. Sesha, J. Strohm, P. O'Neal, G. Hadynski, D. Climek, J. Delmedico, D. Kiwior, D. Dunbrack, D. Parker
{"title":"Policy management in airborne tactical networks","authors":"G. Kuthethoor, P. Sesha, J. Strohm, P. O'Neal, G. Hadynski, D. Climek, J. Delmedico, D. Kiwior, D. Dunbrack, D. Parker","doi":"10.1109/MILCOM.2008.4753463","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753463","url":null,"abstract":"Policy management in a traditional IP network is accomplished by employing Policy Enforcement Points (PEP) and Policy Decision Points (PDP). Policy management has a configuration model and an outsourcing model. In a configuration model, a PDP will send new policies to a PEP to enforce. In an outsourcing model, a PEP will contact a PDP for a decision as to admit or deny traffic. In dynamic airborne tactical edge networks, fast-moving aircraft and terrain obscuration combine to create conditions where traditional policy management may be less effective to be deployed and fielded. In this paper, we study the efficacy of the configuration model in a dynamic Mobile Ad-hoc Network (MANET) by trying to answer the following questions: How quickly can we rectify a network problem by deploying new policies? Is it possible to deploy a new policy if the problem restricts communication between PDP and PEP? We will also study a case where a PEP will contact a PDP to decide on granting or denying a resource reservation request as applicable to the Resource Reservation Protocol (RSVP). This study will also consider the usage of advanced and aggregated RSVP (A-RSVP and AR-RSVP) protocols for making resource reservations. Modifications to the policy enforcement algorithms will be proposed to improve and meet end-to-end Service Level Agreements. The performance analysis in a simulation environment will be conducted for various tactical edge network scenarios.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131012626","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
Optimal weighted data gathering in multi-hop heterogeneous sensor networks 多跳异构传感器网络的最优加权数据采集
MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753346
Junlin Li, G. AlRegib
{"title":"Optimal weighted data gathering in multi-hop heterogeneous sensor networks","authors":"Junlin Li, G. AlRegib","doi":"10.1109/MILCOM.2008.4753346","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753346","url":null,"abstract":"We consider the problem of gathering data from an energy-limited wireless sensor network consisting of a set of sensor nodes and a sink node. Based on the heterogeneous nature of sensor networks, where data generated at different sensor nodes are of different fidelity and importance, we formulate the data gathering problem as maximizing the weighted sum of data generated at all sensors and turn it to a linear programming problem subject to the limited-energy constraints. Furthermore, we show that the optimal multi-hop routing for the weighted data gathering problem is character-based routing, where only ldquobadrdquo sensors relay data for ldquogoodrdquo sensors. An example application and simulation results are given to justify the proposed concept and algorithm.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130389770","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
Intrusion detection of in-band wormholes in MANETs using advanced statistical methods 基于先进统计方法的manet带内虫洞入侵检测
MILCOM 2008 - 2008 IEEE Military Communications Conference Pub Date : 2008-11-01 DOI: 10.1109/MILCOM.2008.4753177
Shanshan Zheng, T. Jiang, J. Baras, A. Sonalker, D. Sterne, R. Gopaul, R. Hardy
{"title":"Intrusion detection of in-band wormholes in MANETs using advanced statistical methods","authors":"Shanshan Zheng, T. Jiang, J. Baras, A. Sonalker, D. Sterne, R. Gopaul, R. Hardy","doi":"10.1109/MILCOM.2008.4753177","DOIUrl":"https://doi.org/10.1109/MILCOM.2008.4753177","url":null,"abstract":"Due to the dynamics and mobility of mobile ad hoc networks (MANETs), intrusion detection techniques in MANETs must be adaptive. In this work, we propose detection schemes that are suitable to detect in-band wormhole attacks. The first detection scheme uses the Sequential Probability Ratio Test (SPRT). The SPRT has been proven to be an optimal detection test when the probability distributions of both normal and abnormal behaviors are given. Furthermore, we introduce non-parametric methods, which require no training and are more adaptive to mobile scenarios. The proposed detection schemes are implemented and evaluated using a 48-node testbed and a mobile ad-hoc network emulator at the Army Research Lab. The performance and detection accuracy of various schemes are compared, especially in the presence of congestion. We provide tradeoffs analyses among detection latency and probabilities of false alarms and missed detection.","PeriodicalId":434891,"journal":{"name":"MILCOM 2008 - 2008 IEEE Military Communications Conference","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131625661","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}
引用次数: 16
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学术文献互助群
群 号:604180095
Book学术官方微信