2012 IEEE Wireless Communications and Networking Conference (WCNC)最新文献

筛选
英文 中文
Variational Bayesian framework for receiver design in the presence of phase noise in MIMO systems MIMO系统中存在相位噪声时接收机设计的变分贝叶斯框架
2012 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2012-04-01 DOI: 10.1109/WCNC.2012.6214388
R. Krishnan, M. Khanzadi, L. Svensson, T. Eriksson, T. Svensson
{"title":"Variational Bayesian framework for receiver design in the presence of phase noise in MIMO systems","authors":"R. Krishnan, M. Khanzadi, L. Svensson, T. Eriksson, T. Svensson","doi":"10.1109/WCNC.2012.6214388","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214388","url":null,"abstract":"In this work, the problem of receiver design for phase noise estimation and data detection in the presence of oscillator phase noise in a point-to-point multiple-input multiple-output (MIMO) system is addressed. First, we discuss some interesting and challenging aspects in receiver design for MIMO systems in the presence of Wiener phase noise. Then, using the variational Bayesian (VB) framework, a joint iterative phase noise estimator and symbol detector are developed based on inverse Gibbs or variational free energy maximization. Further, the symbol error probability (SEP) of the newly proposed iterative scheme is compared with the optimal maximum likelihood (ML) detector with perfect phase information for 16-phase shift keying (PSK) and 16-quadrature amplitude modulation (QAM) schemes.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126729346","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}
引用次数: 23
Relay selection for modulation-adaptive opportunistic DF relaying using mixed channel knowledge 利用混合信道知识调制自适应机会DF中继的中继选择
2012 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2012-04-01 DOI: 10.1109/WCNC.2012.6214204
Chuyi Qian, Y. Ma, R. Tafazolli
{"title":"Relay selection for modulation-adaptive opportunistic DF relaying using mixed channel knowledge","authors":"Chuyi Qian, Y. Ma, R. Tafazolli","doi":"10.1109/WCNC.2012.6214204","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214204","url":null,"abstract":"Recently developed adaptive modulation schemes for opportunistic decode-and-forward (DF) relaying require knowledge of instantaneous channel-state-information (CSI) of all links. This paper aims at reducing signalling overhead of modulation-adaptive opportunistic DF relaying through exploitation of mixed channel knowledge. A novel semi-deterministic approach is proposed for performing joint rate-adaptation and best-relay selection. The selection process employs two criteria using mixed channel knowledge. A new metric namely the probability of missing the best relay (PMBR) is introduced, as only when the best relay is selected, the full diversity order can be achieved. It is shown that the proposed approach can achieve a good trade-off between the spectral efficiency and signalling overhead.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126962797","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
An early termination-based improved algorithm for fixed-complexity sphere decoder 一种基于早期终止的固定复杂度球面解码器改进算法
2012 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2012-04-01 DOI: 10.1109/WCNC.2012.6214444
Guanghui Li, Xin Zhang, Sheng Lei, Cong Xiong, Dacheng Yang
{"title":"An early termination-based improved algorithm for fixed-complexity sphere decoder","authors":"Guanghui Li, Xin Zhang, Sheng Lei, Cong Xiong, Dacheng Yang","doi":"10.1109/WCNC.2012.6214444","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214444","url":null,"abstract":"The fixed-complexity sphere decoder (FSD) has been proposed to attain the near-optimal performance achieving the same diversity order as the maximum-likelihood decoder (MLD) recently. However, it suffers great redundant computations resulting in high power consumption. In this paper, we conduct an improved algorithm for the original FSD by using early termination (ET). This algorithm (abbreviated as ET-FSD) preserves the advantages of sphere decoder (SD) such as branch pruning and an adaptively updated pruning threshold. We compare the ET-FSD with the original FSD and a lately developed statistical threshold-based FSD (ST-FSD). Simulation results demonstrate that the ET-FSD attains the same performance with a much lower cost than the FSD, and is much more efficient than the ST-FSD in practice. In addition, the statistical threshold-based method can also be used for the ET-FSD (i.e., ST-ET-FSD) to further reduce the complexity.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"217 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116160570","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
Lightweight secure global time synchronization for Wireless Sensor Networks 无线传感器网络的轻型安全全球时间同步
2012 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2012-04-01 DOI: 10.1109/WCNC.2012.6214179
Yongsheng Liu, Jie Li, M. Guizani
{"title":"Lightweight secure global time synchronization for Wireless Sensor Networks","authors":"Yongsheng Liu, Jie Li, M. Guizani","doi":"10.1109/WCNC.2012.6214179","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214179","url":null,"abstract":"Time synchronization is crucial to Wireless Sensor Networks (WSNs) due to the requirement of coordination between sensor nodes. Existing secure time synchronization protocols of WSNs introduce high overhead when used for global time synchronization. In this paper, we propose a lightweight secure global time synchronization protocol for WSNs. In the proposed protocol, a broadcast synchronization packet makes all sensor nodes in the network synchronize with the trusted source. The synchronization packet is protected by a proposed broadcast authentication algorithm, which introduces asymmetry by transmitting hash values of secret keys in advance. It achieves immediate authentication and does not require the loose time synchronization. To defend the pulse-delay attacks, the arrival time of the synchronization packet is checked according to the estimated arrival time interval. The upper bound on the skew of the proposed protocol is proved. The message complexity in one period of the proposed protocol is O(n) where n represents the number of sensor nodes. The simulation results show that the maximum skew is within tens of milliseconds.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"80 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116527785","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
Throughput performance optimization in cognitive radio networks under Rayleigh fading 瑞利衰落下认知无线网络吞吐量性能优化
2012 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2012-04-01 DOI: 10.1109/WCNC.2012.6214001
Hyeonje Cho, G. Hwang
{"title":"Throughput performance optimization in cognitive radio networks under Rayleigh fading","authors":"Hyeonje Cho, G. Hwang","doi":"10.1109/WCNC.2012.6214001","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214001","url":null,"abstract":"We consider a time slotted cognitive radio (CR) network under Rayleigh fading where multiple secondary users (SUs) contend for spectrum usage over available primary users' channels. In the contention, all SUs use common access probabilities to decide whether they access one of available channels. We focus on the throughput performance of an arbitrary SU. To improve the throughput performance of SUs, it is desirable that the access probabilities are adapted to the information on channel status and fading condition. In the analysis, we derive the optimal access probabilities that maximize the throughput performance of an arbitrary SU. From our analysis, we provide an insight on how to obtain optimal access probabilities in the CR network. We also investigate the effect of the knowledge of channel status and fading condition on throughput performance. Numerical results are provided to investigate throughput performance behavior.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114298907","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
An improved method for estimating the frequency correlation function 一种估计频率相关函数的改进方法
2012 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2012-04-01 DOI: 10.1109/WCNC.2012.6213930
A. Chelli, M. Pätzold
{"title":"An improved method for estimating the frequency correlation function","authors":"A. Chelli, M. Pätzold","doi":"10.1109/WCNC.2012.6213930","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6213930","url":null,"abstract":"For time-invariant frequency-selective channels, the transfer function is a superposition of waves having different propagation delays and path gains. In order to estimate the frequency correlation function (FCF) of such channels, the frequency averaging technique can be utilized. The obtained FCF can be expressed as a sum of auto-terms (ATs) and cross-terms (CTs). The ATs are caused by the autocorrelation of individual path components. The CTs are due to the cross-correlation of different path components. These CTs have no physical meaning and leads to an estimation error. We propose a new estimation method aiming to improve the estimation accuracy of the FCF of a band-limited transfer function. The basic idea behind the proposed method is to introduce a kernel function aiming to reduce the CT effect, while preserving the ATs. In this way, we can improve the estimation of the FCF. The performance of the proposed method and the frequency averaging technique is analyzed using a synthetically generated transfer function. We show that the proposed method is more accurate than the frequency averaging technique. The accurate estimation of the FCF is crucial for the system design. In fact, we can determine the coherence bandwidth from the FCF. The exact knowledge of the coherence bandwidth is beneficial in both the design as well as optimization of frequency interleaving and pilot arrangement schemes.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114391317","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
Femtocell downlink power control based on Radio Environment Maps 基于无线电环境图的飞蜂窝下行功率控制
2012 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2012-04-01 DOI: 10.1109/WCNC.2012.6213964
A. Zalonis, N. Dimitriou, A. Polydoros, J. Nasreddine, P. Mähönen
{"title":"Femtocell downlink power control based on Radio Environment Maps","authors":"A. Zalonis, N. Dimitriou, A. Polydoros, J. Nasreddine, P. Mähönen","doi":"10.1109/WCNC.2012.6213964","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6213964","url":null,"abstract":"The paper investigates the use of Radio Environment Maps (REMs) as a tool for Interference Management (IM) in two-tier cellular networks comprising macro- and femto-cells. The REMs are databases that provide, through different instances distributed over network elements, a variety of network- and user-related context information for improving IM and Radio Resource Management (RRM) procedures. In this context, the focus in this paper is to present the benefit of using REM information on practical power control schemes for the Femtocell downlink transmission in co-channel two-tier deployment.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129820716","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}
引用次数: 27
Distributed resource optimization in multicell OFDMA networks 多小区OFDMA网络中的分布式资源优化
2012 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2012-04-01 DOI: 10.1109/WCNC.2012.6213982
Mohammad Fathi, E. Karipidis
{"title":"Distributed resource optimization in multicell OFDMA networks","authors":"Mohammad Fathi, E. Karipidis","doi":"10.1109/WCNC.2012.6213982","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6213982","url":null,"abstract":"We consider the joint allocation of receiver, bit, and power to subcarriers in the downlink of multicell orthogonal frequency-division multiple-access (OFDMA) networks. Assuming that the cells share the entire bandwidth and that the rates are discrete, we formulate the joint allocation problem as a nonlinear mixed integer program (MIP), which however has exponential worst-case complexity. We capitalize on the capability of the receivers to measure the interference-plus-noise on every subcarrier and decompose the joint problem into a set of smaller-scale linear MIPs solved by individual base stations. Accordingly, we propose a distributed algorithm with linear complexity, in which the base stations participate in the problem solution in a round-robin manner. Simulation results demonstrate the effectiveness of the proposed algorithm in comparison with the iterative waterfilling algorithm and the successive optimal solution, by means of standard branch-and-cut solvers, of the individual MIPs.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129958526","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
Multi-objective routing optimization using evolutionary algorithms 基于进化算法的多目标路由优化
2012 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2012-04-01 DOI: 10.1109/WCNC.2012.6214324
Halil Yetgin, Kent Tsz Kan Cheung, L. Hanzo
{"title":"Multi-objective routing optimization using evolutionary algorithms","authors":"Halil Yetgin, Kent Tsz Kan Cheung, L. Hanzo","doi":"10.1109/WCNC.2012.6214324","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214324","url":null,"abstract":"Wireless ad hoc networks suffer from several limitations, such as routing failures, potentially excessive bandwidth requirements, computational constraints and limited storage capability. Their routing strategy plays a significant role in determining the overall performance of the multi-hop network. However, in conventional network design only one of the desired routing-related objectives is optimized, while other objectives are typically assumed to be the constraints imposed on the problem. In this paper, we invoke the Non-dominated Sorting based Genetic Algorithm-II (NSGA-II) and the MultiObjective Differential Evolution (MODE) algorithm for finding optimal routes from a given source to a given destination in the face of conflicting design objectives, such as the dissipated energy and the end-to-end delay in a fully-connected arbitrary multi-hop network. Our simulation results show that both the NSGA-II and MODE algorithms are efficient in solving these routing problems and are capable of finding the Pareto-optimal solutions at lower complexity than the `brute-force' exhaustive search, when the number of nodes is higher than or equal to 10. Additionally, we demonstrate that at the same complexity, the MODE algorithm is capable of finding solutions closer to the Pareto front and typically, converges faster than the NSGA-II algorithm.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128347326","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}
引用次数: 53
Performance comparison of downlink user multiplexing schemes in IEEE 802.11ac: Multi-user MIMO vs. frame aggregation IEEE 802.11ac下行链路用户复用方案的性能比较:多用户MIMO与帧聚合
2012 IEEE Wireless Communications and Networking Conference (WCNC) Pub Date : 2012-04-01 DOI: 10.1109/WCNC.2012.6214021
Jiyoung Cha, Hu Jin, B. Jung, D. Sung
{"title":"Performance comparison of downlink user multiplexing schemes in IEEE 802.11ac: Multi-user MIMO vs. frame aggregation","authors":"Jiyoung Cha, Hu Jin, B. Jung, D. Sung","doi":"10.1109/WCNC.2012.6214021","DOIUrl":"https://doi.org/10.1109/WCNC.2012.6214021","url":null,"abstract":"IEEE 802.11ac standard has newly adopted a downlink multi-user multiple-input and multiple-output (DL-MU-MIMO) scheme. For user multiplexing in downlink WLAN, we can also use a frame aggregation scheme for multiplexing multiple users' data with space-time block coding (STBC) for achieving spatial diversity. We compare the performance of the two downlink user multiplexing schemes: multi-user MIMO and frame aggregation in IEEE 802.11ac. If each user's encoded data stream has a similar length, the multi-user MIMO scheme yields better average throughput than the frame aggregation scheme. On the other hand, if each user's encoded data stream has a different length, the frame aggregation scheme outperforms the multi-user MIMO scheme in terms of average throughput. In a fast-varying channel, the multi-user MIMO scheme yields worse throughput due to the channel feedback overhead, compared to that with the frame aggregation scheme. We also observe that the multi-user frame aggregation scheme with STBC always outperforms a single-user transmission scheme with STBC in terms of average throughput due to enhanced MAC layer efficiency through frame aggregation.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128369968","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}
引用次数: 38
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学术官方微信