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

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

筛选
英文 中文
Adaptive Multi-Tx Multi-Rx MIMO Transmission Scheme for LTE-Advanced Downlink LTE-Advanced下行链路自适应多tx多rx MIMO传输方案
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425859
Xiaolin Hou, Zhan Zhang, H. Kayama
{"title":"Adaptive Multi-Tx Multi-Rx MIMO Transmission Scheme for LTE-Advanced Downlink","authors":"Xiaolin Hou, Zhan Zhang, H. Kayama","doi":"10.1109/GLOCOM.2009.5425859","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425859","url":null,"abstract":"Multiple-input multiple output (MIMO) spatial multiplexing has been adopted by 3GPP long term evolution (LTE) to increase the peak spectrum efficiency. However, it will lose its effectiveness for cell edge users due to the inter-cell interference (ICI). Therefore, 3GPP LTE-Advanced (LTE-A) is considering to introduce some multi-cell cooperative transmission techniques to solve this problem. In this paper, we first propose the distributed multi-Tx multi-Rx (MTMR) MIMO spatial multiplexing for LTEA downlink, which only needs partial cooperation, so the heavy backhauling overhead and the high implementation complexity encountered in the traditional full cooperation scheme can be avoided. Meanwhile, because of the efficient utilization of multi-cell transmit power and spatial degree of freedom, a higher spectrum efficiency can be achieved by MTMR MIMO spatial multiplexing in good channel conditions compared with the other partial cooperation schemes. Then in order to ensure the highest possible cell edge spectrum efficiency to be achieved in different channel conditions, we further integrate multiple distributed cooperation modes into the same framework and introduce a mechanism of adaptive cooperation mode selection. Both qualitative analysis and quantitative simulations show the proposal's effectiveness and indicate it a promising candidate for the cooperative transmission in LTE-A downlink.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128969359","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
Multiple Radio Channel Assignement Utilizing Partially Overlapped Channels 利用部分重叠信道的多无线电信道分配
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425288
M. A. Hoque, X. Hong, F. Afroz
{"title":"Multiple Radio Channel Assignement Utilizing Partially Overlapped Channels","authors":"M. A. Hoque, X. Hong, F. Afroz","doi":"10.1109/GLOCOM.2009.5425288","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425288","url":null,"abstract":"Existing channel assignment algorithms designed for multi-radio multi-channel wireless mesh networks (MRMC-WMN) mainly deal with orthogonal or nonoverlapped channels. But in reality, the limited availability of orthogonal channel is a major issue where the network is very dense in terms of inter-nodal distances. On the other hand, partially overlapped channels (POC) are currently considered as a great potential for increasing the number of simultaneous transmissions and eventually upgrading the network capacity; especially in case of MRMC-WMN. In this paper, we address the limited orthogonal channel problem by exploring the usable POCs. The key technique lies in the fact that the interference between adjacent channels has to be considered intelligently in order to increase the overall capacity. Our contributions include a new interference model I-Matrix that helps selecting channels with less interference and a POC-based channel assignment algorithm. We evaluate the performance of our POC based algorithm in terms of capacity by comparing with the one using only orthogonal channels. Our results show capacity improvement as the increased link assignments at an average of more than 15 percent.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128990473","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}
引用次数: 56
Permutation Optimization in QRD Based Multi-Relay Systems 基于QRD的多中继系统的排列优化
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425971
H. Long, K. Zheng, Meiying Wei, Fangxiang Wang, Wenbo Wang
{"title":"Permutation Optimization in QRD Based Multi-Relay Systems","authors":"H. Long, K. Zheng, Meiying Wei, Fangxiang Wang, Wenbo Wang","doi":"10.1109/GLOCOM.2009.5425971","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425971","url":null,"abstract":"QR decomposition (QRD) based relay protocols can achieve both the distributed array gain and the intra-node array gain in multi-relay systems. Because the QRD is not unique if column permutation is utilized, the traditional QRD based relay protocol can be further improved. Row permutation of the forward channel and column permutation of the backward channel are proposed in this paper. Exhaustive and iterative search algorithms are presented to solve the permutation optimization problem. The iterative search algorithm with modified QRD is a good trade-off between capacity performance and complexity.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129022659","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
Hole Reshaping Routing in Large-Scale Mobile Ad-Hoc Networks 大规模移动Ad-Hoc网络中的孔重塑路由
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425842
Peiqian Li, Guojun Wang, Jie Wu, Hong-Chuan Yang
{"title":"Hole Reshaping Routing in Large-Scale Mobile Ad-Hoc Networks","authors":"Peiqian Li, Guojun Wang, Jie Wu, Hong-Chuan Yang","doi":"10.1109/GLOCOM.2009.5425842","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425842","url":null,"abstract":"Mobile ad-hoc networks (MANETs) usually contain sparse or even empty regions called holes. The local optimum problem will occur when routing packets meet holes in the network. In this paper, we propose a novel hole-reshaping routing protocol (HRR) in large-scale MANETs. It effectively solves the hole problem by regularizing a hole with an ellipse, and then locally broadcasting the hole information away from the hole. Simulation results show that the proposed protocol guarantees finding a short routing path with a small routing delay, which is a prerequisite to achieve scalability in large-scale networks.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129357871","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
MMSE Relaying and Power Allocation over Frequency-Selective Rayleigh Fading Channels 频率选择瑞利衰落信道上的MMSE中继和功率分配
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5426200
Tung T. Pham, Ha H. Nguyen, D. Nguyen, H. Tuan
{"title":"MMSE Relaying and Power Allocation over Frequency-Selective Rayleigh Fading Channels","authors":"Tung T. Pham, Ha H. Nguyen, D. Nguyen, H. Tuan","doi":"10.1109/GLOCOM.2009.5426200","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5426200","url":null,"abstract":"This paper develops an amplify-and-forward relaying technique for multiuser wireless cooperative networks under frequency-selective block-fading. Single-carrier frequency division multiple-access with frequency-domain equalization technique is employed at both the relay and destination to combat the inter-block and inter-symbol interference caused by multipath propagation. With the assumption that the full channel state information (CSI) is available at the destination, the relay only knows the uplink channels while no CSI is available at the sources, two power allocation schemes are obtained: (i) to minimize the total transmit power at the relay while maintaining the signal-to-interference-plus-noise ratio (SINR) for each user at the destination above a certain level, and (ii) to maximize the worst SINR among all the users subject to a constraint on total relay transmit power. Analysis and simulation results are provided to illustrate the effectiveness of the proposed schemes.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129490559","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 Motion Tendency-Based Adaptive Data Delivery Scheme for Delay Tolerant Mobile Sensor Networks 一种基于运动趋势的容延迟移动传感器网络自适应数据传输方案
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425709
Fulong Xu, Ming Liu, Jiannong Cao, Guihai Chen, Hai-gang Gong, Jinqi Zhu
{"title":"A Motion Tendency-Based Adaptive Data Delivery Scheme for Delay Tolerant Mobile Sensor Networks","authors":"Fulong Xu, Ming Liu, Jiannong Cao, Guihai Chen, Hai-gang Gong, Jinqi Zhu","doi":"10.1109/GLOCOM.2009.5425709","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425709","url":null,"abstract":"The Delay Tolerant Mobile Sensor Network (DTMSN) is a new type of sensor network for pervasive information gathering. Although similar to conventional sensor networks in hardware components, DTMSN owns some unique characteristics such as sensor mobility, intermittent connectivity, etc. Therefore, traditional data gathering methods can not be applied to DTMSN. In this paper, we propose an efficient Motion Tendency-based Data Delivery Scheme (MTAD) tailored for DTMSN. By using sink broadcast instead of GPS, MTAD obtains the information about the nodal motion tendency with small overhead. The information can then be used to evaluate the node's effective delivery ability and provide guidance for message transmission. MTAD also employs the message survival time to effectively manage message queues. Our simulation results show that, compared with other DTMSN data delivering approaches, MTAD achieves not only a relatively longer network lifetime but also a higher message delivery ratio with lower transmission overhead and data delivery delay.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129646920","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
Revenue Maximization for Communication Networks with Usage-Based Pricing 基于使用定价的通信网络收益最大化
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425338
Shuqin Li, Jianwei Huang, S. Li
{"title":"Revenue Maximization for Communication Networks with Usage-Based Pricing","authors":"Shuqin Li, Jianwei Huang, S. Li","doi":"10.1109/GLOCOM.2009.5425338","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425338","url":null,"abstract":"We study the optimal usage-based pricing problem in a resource-bounded network with one profit-maximizing service provider and multiple groups of surplus-maximizing users. We first analytically derive the optimal pricing mechanism that the service provider maximizes the service provider's revenue under complete network information. Then we consider the incomplete information case, and propose two incentive compatible pricing schemes that achieve different complexity and performance tradeoff. Finally, by properly combining the two pricing schemes, we can show that it is possible to maintain a very small revenue loss (e.g., 0.5% in a two-group case) without knowing detailed information of each user in the network.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129686276","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}
引用次数: 84
A Trellis-Coded Modulation Scheme with a Novel Expanded 16-Dimensional Constant Envelope Q2PSK Constellation 一种新型扩展16维恒包络Q2PSK星座的栅格编码调制方案
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425761
M. I. Quinteros, E. Kaminsky, K. Cartwright
{"title":"A Trellis-Coded Modulation Scheme with a Novel Expanded 16-Dimensional Constant Envelope Q2PSK Constellation","authors":"M. I. Quinteros, E. Kaminsky, K. Cartwright","doi":"10.1109/GLOCOM.2009.5425761","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425761","url":null,"abstract":"This paper presents a TCM scheme that uses a new expanded 16-Dimensional Constant Envelope Q2PSK constellation along with a simple convolutional encoder of rate 2/3. An effective gain of 2.67 dB over uncoded CEQ2PSK is achievable with low complexity, and without suffering from constellation expansion penalty. Larger coding gains are easily achieved with encoders of higher rates. In addition, an optimal hardware implementation of the required decoders is described.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"129 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129093627","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
Bias-Correction In Localization Algorithms 定位算法中的偏差校正
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425645
Yiming Ji, Changbin Yu, B. Anderson
{"title":"Bias-Correction In Localization Algorithms","authors":"Yiming Ji, Changbin Yu, B. Anderson","doi":"10.1109/GLOCOM.2009.5425645","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425645","url":null,"abstract":"In this paper we introduce a new approach to determine the bias in localization algorithms by mixing Taylor series and Jacobian matrices, which results in an easily calculated analytical expression for the bias. To illustrate this approach, we analyze the proposed method in two situations using localization algorithms based on distance measurements. Monte Carlo simulations verify that the proposed method is consistent with the performance of localization algorithms, which means the bias-correction method can correct the bias in most situations except when there is a collinearity problem. Although the method is analyzed in distance-based localization algorithms, it can be extended to other kinds of localization algorithms.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129174519","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
A Preventive Rerouting Scheme for Avoiding Voids in Wireless Sensor Networks 无线传感器网络中避免空洞的预防性重路由方案
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5426024
M. Aissani, A. Mellouk, N. Badache, Mohamed-Said Djebbar
{"title":"A Preventive Rerouting Scheme for Avoiding Voids in Wireless Sensor Networks","authors":"M. Aissani, A. Mellouk, N. Badache, Mohamed-Said Djebbar","doi":"10.1109/GLOCOM.2009.5426024","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5426024","url":null,"abstract":"We propose in this paper an efficient void-avoidance scheme based on a novel approach to prevent data packets from meeting boundaries of voids. In our approach, the choice of the forwarding region around a discovered void is based on the locations of the sender node, of the void center and of the destination node. The first stuck node which detects a void launches a void-discovery algorithm and communicates the void center to all nodes located n-hops away from the void boundary. These nodes will launch a preventive rerouting process, by selecting the appropriate forwarding region around the void, to forward each data packet before reaching the boundary nodes. Associated to the well-known real-time routing protocol SPEED, the proposed scheme provides good performance in terms of packet delivery ratio, end-to-end delay, communication energy consumption, and control overhead.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129235378","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学术官方微信