IEEE Military Communications Conference, 2003. MILCOM 2003.最新文献

筛选
英文 中文
Serial concatenated single differential space-time coding with soft decision feedback channel estimation 带有软判决反馈信道估计的串行级联单差分空时编码
IEEE Military Communications Conference, 2003. MILCOM 2003. Pub Date : 2003-10-13 DOI: 10.1109/MILCOM.2003.1290093
Yi Yao, M. Howlader
{"title":"Serial concatenated single differential space-time coding with soft decision feedback channel estimation","authors":"Yi Yao, M. Howlader","doi":"10.1109/MILCOM.2003.1290093","DOIUrl":"https://doi.org/10.1109/MILCOM.2003.1290093","url":null,"abstract":"In this article, we present serial concatenated single differential space-time block coding (SDST), with channel estimation based on soft decision feedback. Two schemes with soft decision feedback extracted from different positions of the serial structure, such as the output of inner decoder and outer decoder, are proposed and thoroughly studied. Improved system performance is demonstrated and compared via simulations. Our theoretical analysis and simulation results lead to the conclusion that different allocation of the same error correcting potential gives rise to different system performance and speed of convergence.","PeriodicalId":435910,"journal":{"name":"IEEE Military Communications Conference, 2003. MILCOM 2003.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116581332","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
Generation of attenuation time-series for EHF SATCOM simulation EHF卫星通信仿真中衰减时间序列的生成
IEEE Military Communications Conference, 2003. MILCOM 2003. Pub Date : 2003-10-13 DOI: 10.1109/MILCOM.2003.1290154
D. Hodges, R. Watson, A. Page, P. Watson
{"title":"Generation of attenuation time-series for EHF SATCOM simulation","authors":"D. Hodges, R. Watson, A. Page, P. Watson","doi":"10.1109/MILCOM.2003.1290154","DOIUrl":"https://doi.org/10.1109/MILCOM.2003.1290154","url":null,"abstract":"In this paper, a method for deriving time-series of attenuation on fixed satellite or terrestrial links is described. The method uses meteorological model forecast data and radar data and hence permits time coincident derivations for multiple sites that include the spatial correlation properties inherent in weather systems. The success of the technique depends upon insertion of the short interval temporal properties (varying typically over 1 second to 15 minutes) that are statistically independent between stations. The technique has immediate application to simulation of the performance of multi-media satellite to earth links and has longer-term significance in terms of operational real-time performance prediction.","PeriodicalId":435910,"journal":{"name":"IEEE Military Communications Conference, 2003. MILCOM 2003.","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116673352","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
Physics-based propagation models for channels involving mixed paths 涉及混合路径的信道的基于物理的传播模型
IEEE Military Communications Conference, 2003. MILCOM 2003. Pub Date : 2003-10-13 DOI: 10.1109/MILCOM.2003.1290432
R. Luebbers, J. Schuster, S. Fast
{"title":"Physics-based propagation models for channels involving mixed paths","authors":"R. Luebbers, J. Schuster, S. Fast","doi":"10.1109/MILCOM.2003.1290432","DOIUrl":"https://doi.org/10.1109/MILCOM.2003.1290432","url":null,"abstract":"Predicting the radio signal levels and coverage areas for information warfare system communication channels between base stations, vehicles and warfighters is a challenging problem. The channel may involve radio frequency interactions with hills, foliage, and buildings. The paths may involve long distances over hilly terrain or shorter distances involving interaction with urban building features. Many propagation paths may simultaneously involve hills, foliage, and urban areas. For example, a warfighter sheltered in a doorway in an urban area may need to communicate with a command station located in a rural forested area outside of the city. These mixed path links involving both urban (including indoor) features and rural (including foliage) terrain are beyond the capability of any existing physics-based propagation model. Currently available models are applicable to paths where both the transmitting and receiving antennas are located in an outdoor urban environment, or indoors, or in rural areas. Development of fast and reliable mixed-path models valid over a wide range of communication frequencies is important in order to provide channel characterizations for realistic situations. This development will by necessity bring together different types of models. Full wave models may be applied to predict the antenna pattern from an antenna on a vehicle or a warfighter crouched below a wall. Full wave models may also be used for propagation paths involving terrain or atmospheric effects. Parabolic equation models may also be applied for these situations. Ray-based models are needed for complex interactions with urban features and for indoor situations. All of these need to be combined in new ways in order to obtain accurate mixed-path radio propagation predictions.","PeriodicalId":435910,"journal":{"name":"IEEE Military Communications Conference, 2003. MILCOM 2003.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121665763","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
On supporting distributed collaboration in sensor networks 传感器网络中支持分布式协作的研究
IEEE Military Communications Conference, 2003. MILCOM 2003. Pub Date : 2003-10-13 DOI: 10.1109/MILCOM.2003.1290206
G. Wang, W. Zhang, G. Cao, T. L. La Porta
{"title":"On supporting distributed collaboration in sensor networks","authors":"G. Wang, W. Zhang, G. Cao, T. L. La Porta","doi":"10.1109/MILCOM.2003.1290206","DOIUrl":"https://doi.org/10.1109/MILCOM.2003.1290206","url":null,"abstract":"In sensor networks, nodes may malfunction due to the hostile environment. Therefore, dealing with node failure is a very important research issue. In this paper, we study distributed cooperative failure detection techniques. In the proposed techniques, the nodes around a suspected node collaborate with each other to reach an agreement on whether the suspect is faulty or malicious. We first formalize the problem as how to construct a dominating tree to cover all the neighbors of the suspect and give the lower bound of the message complexity. Two tree-based propagation collection protocols are proposed to construct dominating trees and collect information via the tree structure. Instead of using the traditional flooding technique, we propose a coverage-based heuristic to improve the system performance. Theoretical analysis and simulation results show that the heuristic can help achieve a higher tree coverage with lower message complexity, lower delay and lower energy consumption.","PeriodicalId":435910,"journal":{"name":"IEEE Military Communications Conference, 2003. MILCOM 2003.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124989902","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}
引用次数: 112
An enhanced one-bit identity authentication protocol for access control in IEEE 802.11 IEEE 802.11中用于访问控制的增强的一位身份认证协议
IEEE Military Communications Conference, 2003. MILCOM 2003. Pub Date : 2003-10-13 DOI: 10.1109/MILCOM.2003.1290221
H. Wang, Aravind Velayutham
{"title":"An enhanced one-bit identity authentication protocol for access control in IEEE 802.11","authors":"H. Wang, Aravind Velayutham","doi":"10.1109/MILCOM.2003.1290221","DOIUrl":"https://doi.org/10.1109/MILCOM.2003.1290221","url":null,"abstract":"With the explosive growth in the number of mobile device, new concerns are raised when it comes to wireless security. Many commercial products using virtual private network (VPN) to solve the security problems in wireless networks because the current security scheme in IEEE 802.11 namely wired equivalent privacy (WEP) is known to be quite insecure. However, using both WEP and VPN causes authentication redundancy at the mobile hosts. Thus, to reduce the redundancy, (H. Johnson, et al., 2002) proposed a one-bit identity authentication protocol for access control in IEEE 802.11. But a careful study of the paper revealed that the synchronization algorithm used in the work does not solve the purpose. This paper provides an enhanced one-bit identity authentication protocol and a synchronization scheme with complete analysis and implementation issue in IEEE 802.11.","PeriodicalId":435910,"journal":{"name":"IEEE Military Communications Conference, 2003. MILCOM 2003.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116781667","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Using neural network in distributed management to identify control and management plane poison messages 利用神经网络在分布式管理中识别控制平面和管理平面的有毒消息
IEEE Military Communications Conference, 2003. MILCOM 2003. Pub Date : 2003-10-13 DOI: 10.1109/MILCOM.2003.1290146
Xiaojiang Du, M. Shayman, R. Skoog
{"title":"Using neural network in distributed management to identify control and management plane poison messages","authors":"Xiaojiang Du, M. Shayman, R. Skoog","doi":"10.1109/MILCOM.2003.1290146","DOIUrl":"https://doi.org/10.1109/MILCOM.2003.1290146","url":null,"abstract":"Poison message failure propagation is a mechanism that has been responsible for large scale failures in both telecommunications and IP networks: Some or all of the network elements have a software or protocol 'bug' that is activated on receipt of a certain network control or management message (the poison message). This activated 'bug' would cause the node to fail with some probability. If the network control or management is such that this message is persistently passed among the network nodes, and if the node failure probability is sufficiently high, large-scale instability can result. Our previous research has been focused on centralized network management paradigm. In centralized management, one of the effective tools to deal with poison message failure is the neural network approach. However, a centralized scheme cannot be applied if the network is partitioned into several subnetworks by node failures. In this paper, we consider distributed management for the poison message problem. In particular, we use the neural network approach in a distributed way to identify the poison message.","PeriodicalId":435910,"journal":{"name":"IEEE Military Communications Conference, 2003. MILCOM 2003.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125068660","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
A fundamental cross-layer approach to uplink resource allocation 一种基本的跨层上行资源分配方法
IEEE Military Communications Conference, 2003. MILCOM 2003. Pub Date : 2003-10-13 DOI: 10.1109/MILCOM.2003.1290189
E. Yeh, A. Cohen
{"title":"A fundamental cross-layer approach to uplink resource allocation","authors":"E. Yeh, A. Cohen","doi":"10.1109/MILCOM.2003.1290189","DOIUrl":"https://doi.org/10.1109/MILCOM.2003.1290189","url":null,"abstract":"The literature on multiaccess (uplink) communications has traditionally treated \"network-layer\" issues such as source burstiness and network delay apart from \"physical-layer\" issues such as channel modelling, coding, and detection. We establish a unified cross-layer framework for optimal resource allocation over multiaccess fading channels where packets arrive randomly to transmitters. Using optimal coding assumptions, we first show that the region of all stable arrival rates is the same as the information-theoretic capacity region of [D. Tse and S. Hanly, 1998]. Next, we show that a longest-queue-highest-possible-rate (LQHPR) allocation strategy stabilizes the multiaccess queueing system whenever stability is possible. Finally, we show that under symmetric conditions, the LQHPR policy also minimizes the average packet delay. Such a policy can be interpreted in the coding context as adaptive successive decoding. Since optimal coding assumptions are used, the throughput (delay) performance of the LQHPR policy provides a fundamental upper (lower) bound to the performance of all reliable multiaccess coding schemes. especially when the measurement noise is low.","PeriodicalId":435910,"journal":{"name":"IEEE Military Communications Conference, 2003. MILCOM 2003.","volume":"220 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122459171","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
Construction of complex-valued simplex signature sets with constant chip magnitude 恒片幅复值单纯形签名集的构造
IEEE Military Communications Conference, 2003. MILCOM 2003. Pub Date : 2003-10-13 DOI: 10.1109/MILCOM.2003.1290369
P. Cotae
{"title":"Construction of complex-valued simplex signature sets with constant chip magnitude","authors":"P. Cotae","doi":"10.1109/MILCOM.2003.1290369","DOIUrl":"https://doi.org/10.1109/MILCOM.2003.1290369","url":null,"abstract":"A new algorithm for the design of overloaded real-valued signature sets with total-squared-correlation equal to Welch bound equality (WBE) set is presented. It is proved that if K=N+1 the normalized cross correlation between any pair of signatures in a set obtained by the proposed algorithm is either -1/(K-1) or +1/(K-1) and the entire cross correlation matrix G is obtained analytically. Using this algorithm we solved the open problem of existence of complex valued WBE sequence sets with constant chip magnitude in the simplex case. The results are derived in the context of synchronous code division multiple access (CDMA) channels and a numerical example for K=3 and N=2 is given.","PeriodicalId":435910,"journal":{"name":"IEEE Military Communications Conference, 2003. MILCOM 2003.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122501302","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
Sequential use of wireless sensors for target estimation and tracking 连续使用无线传感器进行目标估计和跟踪
IEEE Military Communications Conference, 2003. MILCOM 2003. Pub Date : 2003-10-13 DOI: 10.1109/MILCOM.2003.1290183
M. Liu
{"title":"Sequential use of wireless sensors for target estimation and tracking","authors":"M. Liu","doi":"10.1109/MILCOM.2003.1290183","DOIUrl":"https://doi.org/10.1109/MILCOM.2003.1290183","url":null,"abstract":"In this paper we discuss the use of sensors sequentially for the purpose of target estimation and tracking. Such problems are motivated by scenarios where many of the sensors are inactive under normal situations with only a few active sensors \"on guard\". Upon the detection of a stationary or moving object of interest by an active sensor, this sensor subsequently triggers/wakes up/activates the inactive/sleeping sensors sequentially to get more measurement readings of the object (e.g., location, speed, temperature). Each activation of a sensor and the sensing and communication that follow will incur a cost. This process terminates when the error of the estimate based on the sequence of observations is satisfactory (relative to its cost), or when the moving object is out of range, or when the time period of interest has elapsed, and so on. The questions we are interested in answering are when to stop, when to use a sensor and when not to, and what is the optimal sequence of sensors to use for a given objective function. In this paper we present a framework with which the above problems are formulated into optimal sequential decision problems with energy constraints. Optimal results can then be obtained either through numerical methods or analytical derivation. Our preliminary results show that at least for some instances of such a formulation we can obtain well structured solutions as well as properties of these solutions that describe the sequential selection of sensors.","PeriodicalId":435910,"journal":{"name":"IEEE Military Communications Conference, 2003. MILCOM 2003.","volume":"1174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131442805","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
A decentralized approach to secure management of nodes in distributed sensor networks 分布式传感器网络中节点安全管理的分散方法
IEEE Military Communications Conference, 2003. MILCOM 2003. Pub Date : 2003-10-13 DOI: 10.1109/MILCOM.2003.1290168
J. Zachary
{"title":"A decentralized approach to secure management of nodes in distributed sensor networks","authors":"J. Zachary","doi":"10.1109/MILCOM.2003.1290168","DOIUrl":"https://doi.org/10.1109/MILCOM.2003.1290168","url":null,"abstract":"Distributed sensor networks are a promising technology for surveillance and reconnaissance in many applications, such as next generation C4ISR and the digital battlefield. The dearth of effective security mechanisms are a main obstacle to the acceptance of distributed sensor networks. As research pushes sensor nodes to be smaller and ubiquitous, security issues become paramount. Security in sensor networks needs to be considered during the early phases of development. This paper describes a decentralized solution to the problem of securely checking node membership in ad hoc sensor networks. This method does not require each node to maintain a membership list, does not require communication between the base station and verifying node, and it efficiently handles dynamic membership events (node leaves and joins). It is based on the concept of quasi-commutative hash functions, also called one-way accumulators. The paper analyzes resource requirements and suggests new ways to optimize the use of one-way accumulators while maintaining security in sensor node applications.","PeriodicalId":435910,"journal":{"name":"IEEE Military Communications Conference, 2003. MILCOM 2003.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131603692","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}
引用次数: 11
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学术官方微信