发布求助
文献互助 智能选刊 最新文献

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference最新文献

筛选
英文 中文
Superimposed Training Designs for Spatially Correlated MIMO-OFDM Systems 空间相关MIMO-OFDM系统的叠加训练设计
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2010-03-01 DOI: 10.1109/TWC.2010.03.080661
N. Nguyen, H. Tuan, Ha H. Nguyen
{"title":"Superimposed Training Designs for Spatially Correlated MIMO-OFDM Systems","authors":"N. Nguyen, H. Tuan, Ha H. Nguyen","doi":"10.1109/TWC.2010.03.080661","DOIUrl":"https://doi.org/10.1109/TWC.2010.03.080661","url":null,"abstract":"Optimal training design and channel estimation for spatially correlated multiple-input multiple-output systems with orthogonal frequency-division multiplexing (MIMO-OFDM) is still an open research topic of great interest. Only one asymptotic design for a special case of channel correlations was proposed in the literature. To fill this gap, this paper applies tractable semi- definite programming (SDP) to obtain the optimal superimposed training signals for the general case of channel correlations. To improve computational efficiency, an approximate design in closed-form is also proposed. This approximate design is formed by minimizing an upper bound of the channel estimation mean-square error. Since the superimposed training approach is taken, the derivation of an optimal non-redundancy precoder for data detection enhancement is also given. Analytical and simulation results demonstrate the excellent performance of the proposed designs and their superior performance compared to the previously proposed design.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132806482","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
Robust Distributed Sensor Network Localization Based on Analysis of Flip Ambiguities 基于翻转模糊分析的鲁棒分布式传感器网络定位
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.10
A. Kannan, B. Fidan, Guoqiang Mao
{"title":"Robust Distributed Sensor Network Localization Based on Analysis of Flip Ambiguities","authors":"A. Kannan, B. Fidan, Guoqiang Mao","doi":"10.1109/GLOCOM.2008.ECP.10","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.10","url":null,"abstract":"A major problem in wireless sensor network localization is erroneous local geometric realizations in some parts of the network due to the sensitivity to certain distance measurement errors, which may in turn affect the reliability of the localization of the whole or a major portion of the sensor network. This phenomenon is well-described using the notion of \"flip ambiguity\" in rigid graph theory. In a recent study by the coauthors, an initial formal geometric analysis of flip ambiguity problems has been provided. The ultimate aim of that study was to quantify the likelihood of flip ambiguities in arbitrary sensor neighborhood geometries. In this paper we propose a more general robustness criterion to detect flip ambiguities in arbitrary sensor neighborhood geometries in planar sensor networks. This criterion enhances the recent study by the coauthors by removing the assumptions of accurately knowing some inter- sensor distances. The established robustness criterion is found to be useful in two aspects: (a) Analyzing the effects of flip ambiguity and (b) Enhancing the reliability of the location estimates of the prevailing localization algorithms by incorporating this robustness criterion to eliminate neighborhoods with flip ambiguity from being included in the localization process.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114979939","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}
引用次数: 42
On-Demand Provisioning of Data-Aggregation Requests over WDM Mesh Networks WDM网状网络上数据聚合请求的按需供应
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.509
Dragos Andrei, M. Tornatore, D. Ghosal, C. Martel, B. Mukherjee
{"title":"On-Demand Provisioning of Data-Aggregation Requests over WDM Mesh Networks","authors":"Dragos Andrei, M. Tornatore, D. Ghosal, C. Martel, B. Mukherjee","doi":"10.1109/GLOCOM.2008.ECP.509","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.509","url":null,"abstract":"Many large-scale scientific applications need to aggregate large amounts of data from multiple distributed sites to a centralized facility. We call such a request as a data-aggregation request (DAR). In this study, we investigate the novel problem of on-demand DAR provisioning over a wavelength-division multiplexing (WDM) backbone network. We provide a mathematical formulation for our problem as a mixed integer linear program (MILP). To solve large versions of our problem, we propose a DAR provisioning heuristic (called DARP). We use the MILP with various objectives as a benchmark for studying the performance of DARP.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115159300","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}
引用次数: 9
Quickest Detection in Cognitive Radio: A Sequential Change Detection Framework 认知无线电中的快速检测:一个顺序变化检测框架
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.567
L. Lai, Yijia Fan, H. V. Poor
{"title":"Quickest Detection in Cognitive Radio: A Sequential Change Detection Framework","authors":"L. Lai, Yijia Fan, H. V. Poor","doi":"10.1109/GLOCOM.2008.ECP.567","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.567","url":null,"abstract":"In this work, the agility of detection algorithms in cognitive radio is studied. A sequential change detection framework is developed to investigate the delay of detection algorithms. Three scenarios with different information about primary users' parameters available at cognitive users are considered. Optimal detection schemes that minimize the detection delay under certain false alarm constraints are developed. Minimal detection delay is characterized as a function of the false alarm probability and the Kullback-Leibler distance between signal plus noise and noise only models.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"88 1-2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123144840","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}
引用次数: 202
Novel Rateless Coded Selection Cooperation in Dual-Hop Relaying Systems 双跳中继系统中一种新的无速率编码选择合作
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.886
R. Nikjah, N. Beaulieu
{"title":"Novel Rateless Coded Selection Cooperation in Dual-Hop Relaying Systems","authors":"R. Nikjah, N. Beaulieu","doi":"10.1109/GLOCOM.2008.ECP.886","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.886","url":null,"abstract":"Selection cooperation is proposed for rateless coded relaying by developing a novel low-complexity protocol that exploits all source-destination, source-relay, and relay-destination link qualities for relay selection. The source or any decoding relay having a link to the destination with a gain greater than a preset threshold is a candidate for collaboration. When the number of candidates reaches a preset value, the best of them is selected for passing the source data to the destination. The source and relays are informed of the selected node by a broadcast feedback from the destination. Limited feedback is required only between the destination and the other nodes and merely for declaring success in decoding or selecting the next transmitting node. The system power and complexity are independent of the system parameters. Also, the system dispenses with internode synchronization at carrier or symbol levels, multireception combining, multiaccess interference, and multiuser detection. Assuming independent fading on different links, a general performance analysis of the new system is presented valid for any individual link fading model. It is shown through numerical results that the novel scheme is considerably more energy efficient, for diverse input conditions, than a more complex commensurate scheme previously proposed. Also, the energy efficiency is enhanced as the number of relays increases, such that despite an increase in the capacity, the energy expenditure diminishes.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124420534","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}
引用次数: 12
A Novel QoS-Based Co-Allocation Model in Computational Grid 计算网格中一种基于qos的协同分配模型
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.304
Peng Xiao, Zhi-gang Hu
{"title":"A Novel QoS-Based Co-Allocation Model in Computational Grid","authors":"Peng Xiao, Zhi-gang Hu","doi":"10.1109/GLOCOM.2008.ECP.304","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.304","url":null,"abstract":"In grid systems, co-allocation is a key infrastructure to schedule heterogeneous and distributed resources for high-level applications. Although it has been widely studied, QoS-based resource co-allocation still remains an unsolved issue. In this paper, we propose a novel QoS-based co-allocation model for the grid applications with constraints to budget and deadline. A new concept, called virtual resource agent, is introduced into the co- allocation policy. Theoretical analysis indicates that virtual resource agent can provide quantitative QoS guarantee for applications in terms of budget and deadline. Experimental results show that the proposed model can significantly reduce deadline violation rate and increase the benefits of resource providers compared with other three co-allocation policies.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116962843","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}
引用次数: 12
Compressed Wideband Sensing in Cooperative Cognitive Radio Networks 协同认知无线电网络中的压缩宽带感知
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.721
Z. Tian
{"title":"Compressed Wideband Sensing in Cooperative Cognitive Radio Networks","authors":"Z. Tian","doi":"10.1109/GLOCOM.2008.ECP.721","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.721","url":null,"abstract":"In emerging cognitive radio (CR) networks with spectrum sharing, the first cognitive task preceding any dynamic spectrum access is the sensing and identification of spectral holes in wireless environments. This paper develops a distributed compressed spectrum sensing approach for (ultra-)wideband CR networks. Compressed sensing is performed at local CRs to scan the very wide spectrum at practical signal-acquisition complexity. Meanwhile, spectral estimates from multiple local CR detectors are fused to collect spatial diversity gain, which improves the sensing quality especially under fading channels. New distributed consensus algorithms are developed for collaborative sensing and fusion. Using only one-hop local communications, these distributed algorithms converge fast to the globally optimal solutions even for multi-hop CR networks, at low communication and computation load scalable to the network size.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117195228","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}
引用次数: 201
NetPolis: Modeling of Inter-Domain Routing Policies NetPolis:域间路由策略建模
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.330
Kyriaki Levanti, Hyong S. Kim, Tina Wong
{"title":"NetPolis: Modeling of Inter-Domain Routing Policies","authors":"Kyriaki Levanti, Hyong S. Kim, Tina Wong","doi":"10.1109/GLOCOM.2008.ECP.330","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.330","url":null,"abstract":"Router configuration is a difficult and complex task. At the same time, it is a crucial task as it accounts for a network's profit, performance, and security. Routing policies are configured in low-level languages and the high- level intent is hard to decipher. In this paper, we propose a system, called NetPolis, which abstracts the high-level intents from low-level configuration of routing policies. The goal of NetPolis is to automatically generate the inter- domain routing policy configuration of a network. NetPolis takes the network's router configuration files and compares the import and export policies from various perspectives and granularities. The output is a multi-level model to represent neighbor networks with similar routing policy enforcements. We validate our approach by applying NetPolis to the router configuration files from a production network of a major ISP. The network operator confirms that NetPolis provides a compact summary of the network's routing policies and this summary helps to verify high-level intents, to identify misconfigurations, and to aid in policy modifications.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121052662","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
On the Ergodic Capacity of Frequency Selective MIMO Systems Equipped with MMSE Receivers: An Asymptotic Approach 基于MMSE接收机的频率选择MIMO系统遍历容量的渐近方法
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.716
Cédric Artigue, P. Loubaton, B. Mouhouche
{"title":"On the Ergodic Capacity of Frequency Selective MIMO Systems Equipped with MMSE Receivers: An Asymptotic Approach","authors":"Cédric Artigue, P. Loubaton, B. Mouhouche","doi":"10.1109/GLOCOM.2008.ECP.716","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.716","url":null,"abstract":"This paper is devoted to the study of the ergodic capacity of frequency selective MIMO systems equipped with a MMSE receiver when the channel state information is available at the receiver side and when the second order statistics of the channel taps are known at the transmitter side. As the expression of this capacity is rather complicated and difficult to analyse, it is studied in the case where the number of transmit and receive antennas converge to +oo at the same rate. In this asymptotic regime, the main results of the paper are related to the design of an optimal precoder in the case where the transmit antennas are correlated. It is shown that the left singular eigenvectors of the optimum precoder coincide with the eigenvectors of the mean of the channel taps transmit covariance matrices, and its singular values are solution of a certain maximization problem.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121132851","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
The Golden Code is Fast Decodable 黄金密码可快速解码
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference Pub Date : 2008-12-08 DOI: 10.1109/GLOCOM.2008.ECP.700
Mohanned O. Sinnokrot, J. Barry
{"title":"The Golden Code is Fast Decodable","authors":"Mohanned O. Sinnokrot, J. Barry","doi":"10.1109/GLOCOM.2008.ECP.700","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.700","url":null,"abstract":"The golden code is a full-rate full-diversity space-time code for two transmit antennas that has a maximal coding gain. Because each codeword conveys four information symbols from an M-ary QAM alphabet, a maximum-likelihood decoder based on a conventional sphere detector has a worst-case complexity of M4. In this paper we present a new algorithm for maximum-likelihood decoding of the golden code that has a worst-case complexity of only 2M3. We thus prove that the golden code is fast decodable, a fact that has evidently been overlooked in prior work. Furthermore, in contrast to the overlaid Alamouti codes, which are fast decodable on quasistatic channels but not on time-varying channels, the golden code is fast decodable on both quasistatic and rapid time-varying channels.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121351972","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
下一页 尾页
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学术官方微信