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

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

筛选
英文 中文
EM Algorithm for Non-Data-Aided SNR Estimation of Linearly-Modulated Signals over SIMO Channels SIMO信道上线性调制信号非数据辅助信噪比估计的EM算法
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425216
Mohamed Ali Boujelben, F. Bellili, S. Affes, A. Stephenne
{"title":"EM Algorithm for Non-Data-Aided SNR Estimation of Linearly-Modulated Signals over SIMO Channels","authors":"Mohamed Ali Boujelben, F. Bellili, S. Affes, A. Stephenne","doi":"10.1109/GLOCOM.2009.5425216","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425216","url":null,"abstract":"In this paper, we address the problem of non-data-aided SNR estimation in wireless SIMO channels. We derive the per-antenna ML SNR estimator using the expectation-maximization (EM) algorithm under constant channels and additive white Gaussian noise (AWGN). The new method is valid for any arbitrary constellation. It is NDA and, therefore, does not impinge on the hole throughput of the system. We obtain two non linear vector equations which are tackled by a less complex approach based on the EM algorithm. The noise components are assumed to be spatially uncorrelated over all the antenna elements and temporally white with equal power. Besides, in order to evaluate our EM-ML SNR estimator, we derive the Cramer-Rao lower bound (CRLB) in the DA case. Monte Carlo simulations show, that our new estimator offers, a substantial performance improvement over the SISO ML SNR estimator due to the optimal usage of the mutual information between the antenna branches, and that it reaches the derived DA CRLBs. To the best of our knowledge, we are the first to derive the ML per-antenna SNR estimators as well as the CRLBs in the NDA and the DA case, respectively, both over SIMO channels.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"32 1 Pt 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":"125707015","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}
引用次数: 19
A Simple Greedy Algorithm for Link Scheduling with the Physical Interference Model 带物理干扰模型的链路调度贪心算法
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425262
Dejun Yang, Xi Fang, Nan Li, G. Xue
{"title":"A Simple Greedy Algorithm for Link Scheduling with the Physical Interference Model","authors":"Dejun Yang, Xi Fang, Nan Li, G. Xue","doi":"10.1109/GLOCOM.2009.5425262","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425262","url":null,"abstract":"In wireless networks, mutual interference prevents wireless devices from correctly receiving packages from others and becomes one of the challenges in the design of protocols for wireless networks. Spatial-reuse Time Division Multiple Access (STDMA) has been used to cope with this problem. In this scheme, links are assigned to several time slots and in each slot all the links can transmit simultaneously. In this paper, we propose a greedy link scheduling algorithm to find a short schedule for a problem instance in the physical interference model. Our scheduling algorithm is inspired by the k-MAX-CUT algorithm in [13]. Experimental results show that our greedy algorithm can give a better schedule compared with the greedy algorithm in [3], with an improvement about 20%-30% when the density of links is high.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"27 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":"121923883","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}
引用次数: 15
Providing Quality of Service Guarantees in Multiclass IEEE 802.16e Sleep Mode 在Multiclass IEEE 802.16e睡眠模式下提供服务质量保证
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425453
G. Paschos, P. Mannersalo
{"title":"Providing Quality of Service Guarantees in Multiclass IEEE 802.16e Sleep Mode","authors":"G. Paschos, P. Mannersalo","doi":"10.1109/GLOCOM.2009.5425453","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425453","url":null,"abstract":"We consider the sleep mode algorithm of IEEE 802.16e mobile networks where a mobile station may switch off the transceiver and go into sleep mode in order to save power. Depending on the underlying application, different algorithms are defined in the standard. In practice, a hybrid combination of the sleep mode algorithms will be used in a mobile. In this paper, we build a novel performance model that captures the behavior of a single sleep mode algorithm. Moreover, we provide an accurate approximation for the hybrid case. Finally, the model is used to select the standard-compliant sleep window strategy which satisfies a given (approximative) delay constraint and minimizes the energy usage.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"4 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":"122223186","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
Incremental Routing and Scheduling in Wireless Grids 无线网格中的增量路由和调度
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425699
Abdullah-Al Mahmood, E. Elmallah
{"title":"Incremental Routing and Scheduling in Wireless Grids","authors":"Abdullah-Al Mahmood, E. Elmallah","doi":"10.1109/GLOCOM.2009.5425699","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425699","url":null,"abstract":"This paper deals with two fundamental joint routing and scheduling problems in multi-hop wireless mesh networks (WMNs) employing time division multiple access (TDMA). The problems pertain to incremental update of schedules as some of the existing flows terminate and new flow demands are received. In the first problem, referred to as single flow scheduling (SFS) problem, we are given a set of ongoing flows in a WMN, a new incoming flow demand, and a specific potential path for routing the demand. All flows contend for using one of the available wireless channels. We ask whether the new flow demand can be served without perturbing existing slot assignments in the schedule serving the current flows. In the second problem, referred to as single flow routing and scheduling (SFRS) problem, no specific route is given. We first prove that conflict graphs of trees composed of certain class of interference limited paths in wireless networks have bounded treewidth. This characterization yields efficient solution to the SFS problem, among a number of other resource allocation problems in wireless networking. Next we consider the SFRS problem in grid networks. For such networks, we present an efficient solution to a generalized version of the SFRS problem where each link is associated with a cost, and a minimum cost schedulable route is desired. Using both concrete examples and simulation, we show that the devised SFRS algorithm yields improved throughput results over a competing approach that uses tree based routing.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"2 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":"122241591","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 Game Theoretic Approach to Multi-User Spectrum Allocation 多用户频谱分配的博弈论方法
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425963
P. Wrycza, B. Shankar, M. Bengtsson, B. Ottersten
{"title":"A Game Theoretic Approach to Multi-User Spectrum Allocation","authors":"P. Wrycza, B. Shankar, M. Bengtsson, B. Ottersten","doi":"10.1109/GLOCOM.2009.5425963","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425963","url":null,"abstract":"We consider the interaction of several transmit-receive pairs coexisting in the same area and communicating using the same portion of the spectrum. Using a game theoretic framework, each pair is regarded as a player whose payoff function is the individual link rate and power is allocated using the iterative water-filling algorithm. We find properties of the resulting Nash equilibria and derive conditions for when various operating points are achievable. The analysis presented herein extends previous work by characterizing the set of stable solutions for a multi-user system. Also, we show how the game can be modified to obtain better operating points in terms of sum rate compared to the iterative water-filling algorithm. The increase in performance corresponding to one such modification is evaluated and compared to the iterative water-filling algorithm by numerical simulations.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"59 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":"122282341","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
LTE Access Network Planning and Optimization: A Service-Oriented and Technology-Specific Perspective LTE接入网规划与优化:面向服务和技术特定视角
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425478
F. Gordejuela-Sanchez, Jie Zhang
{"title":"LTE Access Network Planning and Optimization: A Service-Oriented and Technology-Specific Perspective","authors":"F. Gordejuela-Sanchez, Jie Zhang","doi":"10.1109/GLOCOM.2009.5425478","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425478","url":null,"abstract":"With the emergence of new technologies and services, it is very important to accurately identify the factors that affect the design of the wireless access network and define how to take them into account to achieve optimally performing and cost-efficient networks. Till now, most existing efforts have been focused the basic access capability. This article describes a way to deal with the trade-offs generated during the LTE Access network design, and presents a service-oriented optimization framework that offers a new perspective for this process with consideration of the technical and economic factors of this kind of networks. We propose a mixed integer programming model with the use of the method of the Pareto front and Multiobjective Tabu Search. An example of deployment is presented.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"17 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":"121733981","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}
引用次数: 45
Capacity Gains of Some Frequency Reuse Schemes in OFDMA Networks OFDMA网络中几种频率复用方案的容量增益
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425225
T. Bonald, N. Hegde
{"title":"Capacity Gains of Some Frequency Reuse Schemes in OFDMA Networks","authors":"T. Bonald, N. Hegde","doi":"10.1109/GLOCOM.2009.5425225","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425225","url":null,"abstract":"The downlink capacity of cellular networks is known to be strongly limited by inter-cell interference. In order to mitigate this interference, a number of frequency reuse schemes have recently been proposed. In this paper, we compare the potential capacity gains of these schemes accounting for the random nature of traffic.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"95 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":"131963326","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}
引用次数: 36
CoRe-MAC: A MAC-Protocol for Cooperative Relaying in Wireless Networks 核心mac:无线网络中协同中继的mac协议
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425425
Helmut Adam, W. Elmenreich, C. Bettstetter, S. Senouci
{"title":"CoRe-MAC: A MAC-Protocol for Cooperative Relaying in Wireless Networks","authors":"Helmut Adam, W. Elmenreich, C. Bettstetter, S. Senouci","doi":"10.1109/GLOCOM.2009.5425425","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425425","url":null,"abstract":"Cooperative relaying methods can improve wireless links, but introduce overhead due to relay selection and resource reservation compared to non-cooperative transmission. In order to be competitive, a cooperative relaying protocol must avoid or compensate for this overhead. \u0000 \u0000In this paper, we present a MAC protocol for relay selection and cooperative communication as an extension to CSMA/CA which addresses resource reservation, relay selection, and cooperative transmission while keeping the overhead in terms of time and energy low. We discuss the efficiency of this protocol for packet error rate, throughput, and message delay in a multi-hop network. Simulation results show that the protocol performs similar and without noticeable overhead compared to standard CSMA/CA for good SNR while it is able to significantly improve throughput and reliability at larger distances.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"63 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":"132316841","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}
引用次数: 49
Position Based Opportunistic Routing for Robust Data Delivery in MANETs 基于位置的机会路由在manet中稳健的数据传输
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425351
Shengbo Yang, Feng Zhong, C. Yeo, Bu-Sung Lee, Jeff Boleng
{"title":"Position Based Opportunistic Routing for Robust Data Delivery in MANETs","authors":"Shengbo Yang, Feng Zhong, C. Yeo, Bu-Sung Lee, Jeff Boleng","doi":"10.1109/GLOCOM.2009.5425351","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425351","url":null,"abstract":"Traditional MANET routing protocols are quite susceptible to link failure as well as vulnerable to malicious node attack. In this paper, we propose a novel protocol called Position based Opportunistic Routing (POR) which takes full advantage of the broadcast nature of wireless channel and opportunistic forwarding. The data packets are transmitted as a way of multicast (which is actually implemented by MAC interception) with multiple forwarders. A forwarder list determined by previous hop according to local position information is inserted into the IP header and the candidates take turn to forward the packet based on a predefined orders. This redundancy and randomness make it quite efficient and robust. In addition, inherited from position based routing, POR's control overhead is almost negligible which justifies its good scalability. Both theoretical analysis and simulation results show that POR not only achieves outstanding performances in normal situations but also yields excellent resilience in hostile environments.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"116 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":"132323711","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}
引用次数: 81
Efficient Soft-Output Demodulators for the Golden Code 黄金码的高效软输出解调器
GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference Pub Date : 2009-11-30 DOI: 10.1109/GLOCOM.2009.5425417
N. Prasad, M. Jiang, Xiaodong Wang
{"title":"Efficient Soft-Output Demodulators for the Golden Code","authors":"N. Prasad, M. Jiang, Xiaodong Wang","doi":"10.1109/GLOCOM.2009.5425417","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425417","url":null,"abstract":"In this work we design efficient soft output demodulators (also referred to as fast soft demodulators) for the 2×2 Golden code, which is a promising candidate space time block code in the evolving IEEE and 3GPP cellular standards. For this code, the naive approach for maximum likelihood (ML) hard decision as well as soft-output demodulation entails a complexity of O(M4), where M denotes the cardinality of the QAM constellation from which the underlying modulated symbols are drawn. In contrast, our efficient demodulator exploits the structure of the code and yields the ML decision and soft outputs in the form of exact max-log log-likelihood ratios (LLRs) with an O(M2.5) complexity. Moreover, we also design a sub-optimal soft output demodulator that has an O(M0.5) complexity comparable to that of the linear minimum mean square error (LMMSE) based demodulator but results in substantial performance gains.","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":"130266179","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}
引用次数: 5
首页 上一页 下一页 尾页
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学术官方微信