This paper provides an introduction to the NGMN (r)evolution from an operator perspective. The highly challenging performance targets that future mobile radio systems need to satisfy are introduced and explained. It is shown which means future technologies such as LTE-A provide and how these means are beneficial in achieving the overall target of persistent customer satisfaction. Exemplarily, coordinated multipoint operation (CoMP), relays and carrier aggregation are discussed showing their potential but also the complexity coming along with these features. Dealing with exponential traffic growth however, can only be overcome by a combination of new features for increased performance to be applied in combination with new deployment concepts.
{"title":"NGMN (r)evolution of mobile radio networks","authors":"M. Siebert, Zhongrong Liu","doi":"10.1109/EW.2010.5483514","DOIUrl":"https://doi.org/10.1109/EW.2010.5483514","url":null,"abstract":"This paper provides an introduction to the NGMN (r)evolution from an operator perspective. The highly challenging performance targets that future mobile radio systems need to satisfy are introduced and explained. It is shown which means future technologies such as LTE-A provide and how these means are beneficial in achieving the overall target of persistent customer satisfaction. Exemplarily, coordinated multipoint operation (CoMP), relays and carrier aggregation are discussed showing their potential but also the complexity coming along with these features. Dealing with exponential traffic growth however, can only be overcome by a combination of new features for increased performance to be applied in combination with new deployment concepts.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121947102","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}
R. Srinivasan, D. Blough, Luis Miguel Cortés-Peña, P. Santi
The problem that we consider is that of maximizing throughput in a MIMO network while accounting for variable rate streams on MIMO links. The stream rates on a link depend on the channel conditions of the link, and the manner in which the diversity-multiplexing tradeoff is handled. In this work, we use the dependence of stream rates on the channel to develop methods of link selection and stream allocation that approximately maximize the aggregate throughput. Maximizing throughput is closely tied to the problem of allocating streams based on the stream rates of the selected links. Doing this optimally is very complex even for networks with 10 or fewer links. We develop a stream allocation heuristic that approximately maximizes the throughput over a given set of links. Simulation results for single collision domain networks show that our stream allocation heuristic is within 7% of optimal in networks with up to 10 links (in a typical case where the maximum concurrency allowed is 15 links). The algorithm also cuts the difference between heuristic and optimal results in half, compared to a simple greedy algorithm. Our research has also identified the feasibility checking problem for general MIMO networks as being a computationally hard problem. However, we also identify several practical special cases, e.g. when interference suppression is done only at the receiver side, for which feasibility checking remains a polynomial-time operation.
{"title":"Maximizing throughput in MIMO networks with variable rate streams","authors":"R. Srinivasan, D. Blough, Luis Miguel Cortés-Peña, P. Santi","doi":"10.1109/EW.2010.5483484","DOIUrl":"https://doi.org/10.1109/EW.2010.5483484","url":null,"abstract":"The problem that we consider is that of maximizing throughput in a MIMO network while accounting for variable rate streams on MIMO links. The stream rates on a link depend on the channel conditions of the link, and the manner in which the diversity-multiplexing tradeoff is handled. In this work, we use the dependence of stream rates on the channel to develop methods of link selection and stream allocation that approximately maximize the aggregate throughput. Maximizing throughput is closely tied to the problem of allocating streams based on the stream rates of the selected links. Doing this optimally is very complex even for networks with 10 or fewer links. We develop a stream allocation heuristic that approximately maximizes the throughput over a given set of links. Simulation results for single collision domain networks show that our stream allocation heuristic is within 7% of optimal in networks with up to 10 links (in a typical case where the maximum concurrency allowed is 15 links). The algorithm also cuts the difference between heuristic and optimal results in half, compared to a simple greedy algorithm. Our research has also identified the feasibility checking problem for general MIMO networks as being a computationally hard problem. However, we also identify several practical special cases, e.g. when interference suppression is done only at the receiver side, for which feasibility checking remains a polynomial-time operation.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128363306","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}
We consider a wireless sensor network in which a routing tree has been established to transmit the information from a set of source nodes to a data sink. The existing algorithms to schedule the transmission slots in a way that allows the data to be compressed as it moves towards the data sink are centralized or rely on interference models that fail occasionally. We propose a distributed TDMA scheduling protocol specifically designed for data aggregation called RandSched. RandSched tests whether the transmissions of different sets of nodes succeed simultaneously and only assigns the same slot to them if they have been proved to tolerate each other's interference. By constructing and testing the schedule incrementally, RandSched is more likely to obtain a collision-free schedule than existing algorithms, which is particularly important in large networks. This is confirmed by our simulations, which also reveal a low scheduling overhead and a reduced transmission latency.
{"title":"Randomized scheduling algorithm for data aggregation in wireless sensor networks","authors":"Mario O. Diaz, K. Leung","doi":"10.1109/EW.2010.5483392","DOIUrl":"https://doi.org/10.1109/EW.2010.5483392","url":null,"abstract":"We consider a wireless sensor network in which a routing tree has been established to transmit the information from a set of source nodes to a data sink. The existing algorithms to schedule the transmission slots in a way that allows the data to be compressed as it moves towards the data sink are centralized or rely on interference models that fail occasionally. We propose a distributed TDMA scheduling protocol specifically designed for data aggregation called RandSched. RandSched tests whether the transmissions of different sets of nodes succeed simultaneously and only assigns the same slot to them if they have been proved to tolerate each other's interference. By constructing and testing the schedule incrementally, RandSched is more likely to obtain a collision-free schedule than existing algorithms, which is particularly important in large networks. This is confirmed by our simulations, which also reveal a low scheduling overhead and a reduced transmission latency.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127085677","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}
Radio resource allocation algorithm is proposed for multiuser MIMO-OFDM environment providing proportional fairness. Familiar MIMO radio channel model is extended for OFDMA transmission, exploiting multiuser diversity. Antenna selection is realized for maximizing overall data rate based on MIMO channel estimation. Adaptive M-QAM modulation is performed on selected antennas on each subcarrier, taking into account singular value decomposition based power gain values from the analytical calculation of MIMO channel capacity. Transmit power control is included over subcarriers and transmit antennas providing fairness among users.
{"title":"Radio resource management for MIMO-OFDMA access in Rayleigh fading channel","authors":"A. Mráz, Tamás Zámbó, S. Imre","doi":"10.1109/EW.2010.5483426","DOIUrl":"https://doi.org/10.1109/EW.2010.5483426","url":null,"abstract":"Radio resource allocation algorithm is proposed for multiuser MIMO-OFDM environment providing proportional fairness. Familiar MIMO radio channel model is extended for OFDMA transmission, exploiting multiuser diversity. Antenna selection is realized for maximizing overall data rate based on MIMO channel estimation. Adaptive M-QAM modulation is performed on selected antennas on each subcarrier, taking into account singular value decomposition based power gain values from the analytical calculation of MIMO channel capacity. Transmit power control is included over subcarriers and transmit antennas providing fairness among users.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127232448","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}
Long-Term Evolution (LTE) allows operators to use new and wider spectrum and complements 3G networks with higher data rates, lower latency and a flat IP-based architecture. To further improve broadband user experience in a ubiquitous and cost effective manner, 3GPP has been working on various aspects in the framework of LTE Advanced. Since radio link performance is approaching theoretical limits with 3G enhancements and LTE, the next performance leap in wireless networks will come from the network topology. LTE Advanced is about improving spectral efficiency per unit area. Using a mix of macro, pico, femto and relay base-stations, heterogeneous networks enable flexible and low-cost deployments and provide a uniform broadband experience to users anywhere in the network. This paper discusses the need for an alternative deployment model or topology using heterogeneous networks. To enhance the performance of these networks, advanced techniques are described which are needed to manage and control interference and deliver the full benefits of such networks. Range extension allows more user terminals to benefit directly from low-power base-stations such as picos, femtos, and relays. Adaptive inter-cell interference coordination provides smart resource allocation amongst interfering cells and improves inter-cell fairness in a heterogeneous network. In addition, the performance gains with heterogeneous networks using an example macro/pico network are shown.
{"title":"LTE-Advanced: Heterogeneous networks","authors":"A. Khandekar, N. Bhushan, T. Ji, V. Vanghi","doi":"10.1109/EW.2010.5483516","DOIUrl":"https://doi.org/10.1109/EW.2010.5483516","url":null,"abstract":"Long-Term Evolution (LTE) allows operators to use new and wider spectrum and complements 3G networks with higher data rates, lower latency and a flat IP-based architecture. To further improve broadband user experience in a ubiquitous and cost effective manner, 3GPP has been working on various aspects in the framework of LTE Advanced. Since radio link performance is approaching theoretical limits with 3G enhancements and LTE, the next performance leap in wireless networks will come from the network topology. LTE Advanced is about improving spectral efficiency per unit area. Using a mix of macro, pico, femto and relay base-stations, heterogeneous networks enable flexible and low-cost deployments and provide a uniform broadband experience to users anywhere in the network. This paper discusses the need for an alternative deployment model or topology using heterogeneous networks. To enhance the performance of these networks, advanced techniques are described which are needed to manage and control interference and deliver the full benefits of such networks. Range extension allows more user terminals to benefit directly from low-power base-stations such as picos, femtos, and relays. Adaptive inter-cell interference coordination provides smart resource allocation amongst interfering cells and improves inter-cell fairness in a heterogeneous network. In addition, the performance gains with heterogeneous networks using an example macro/pico network are shown.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"119 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130131865","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}
In LTE Uplink, the slow varying pathgain and shadowing are compensated by the standardized open loop power control (OLPC) which is based on a power density offset and a compensating factor for the pathloss experienced by the users. The optimization of those parameters reveals a dependency on the allocated bandwidth. A Load Adaptive Power Control (LAPC) algorithm is proposed to handle the bandwidth variations and ensure optimal system performance. In this contribution it is shown that using closed loop power control commands to adapt the transmission power density to the used bandwidth, it is possible to achieve coverage gains up to 60% while maintaining a cell throughput comparable to the reference case.
{"title":"Load adaptive power control in LTE Uplink","authors":"Malek Boussif, C. Rosa, J. Wigard, R. Müllner","doi":"10.1109/EW.2010.5483432","DOIUrl":"https://doi.org/10.1109/EW.2010.5483432","url":null,"abstract":"In LTE Uplink, the slow varying pathgain and shadowing are compensated by the standardized open loop power control (OLPC) which is based on a power density offset and a compensating factor for the pathloss experienced by the users. The optimization of those parameters reveals a dependency on the allocated bandwidth. A Load Adaptive Power Control (LAPC) algorithm is proposed to handle the bandwidth variations and ensure optimal system performance. In this contribution it is shown that using closed loop power control commands to adapt the transmission power density to the used bandwidth, it is possible to achieve coverage gains up to 60% while maintaining a cell throughput comparable to the reference case.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130587789","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}
This paper deals with the multi-hop localization problem in static Wireless Sensor Networks. The knowledge of geographical positions of nodes is useful in such networks, as it can be used in communication protocols or to provide geographical information of detected events. We present in this paper a new and original method to locate sensor nodes, named ADNL. In our method, each sensor knows anchor nodes positions in its k-hop neighborhood and also distance between neighbor nodes thanks to a technology like TDoA. Nodes with enough anchors in their neighborhood locally run a force-based algorithm so as to deduce their position, and then forward it so as to enable other nodes to locate themselves. We provide extensive simulations under various network topologies, densities, number of anchor nodes and distance estimation errors, so as to present results showing the accuracy of our localization algorithm. ADNL algorithm is shown to be particularly accurate and robust to both distance estimation errors and irregular topologies.
{"title":"ADNL: Accurate distributed node localization algorithm in Wireless Sensor Networks","authors":"Julien Champ, Vincent Boudet","doi":"10.1109/EW.2010.5483437","DOIUrl":"https://doi.org/10.1109/EW.2010.5483437","url":null,"abstract":"This paper deals with the multi-hop localization problem in static Wireless Sensor Networks. The knowledge of geographical positions of nodes is useful in such networks, as it can be used in communication protocols or to provide geographical information of detected events. We present in this paper a new and original method to locate sensor nodes, named ADNL. In our method, each sensor knows anchor nodes positions in its k-hop neighborhood and also distance between neighbor nodes thanks to a technology like TDoA. Nodes with enough anchors in their neighborhood locally run a force-based algorithm so as to deduce their position, and then forward it so as to enable other nodes to locate themselves. We provide extensive simulations under various network topologies, densities, number of anchor nodes and distance estimation errors, so as to present results showing the accuracy of our localization algorithm. ADNL algorithm is shown to be particularly accurate and robust to both distance estimation errors and irregular topologies.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126786049","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}
In this paper we extend the base station (BS) assignment problem to incorporate backhaul related constraints into the assignment decision. This is motivated by the fact that the deployment of more spectral efficient radio access technologies are currently imposing stringent bandwidth requirements at cell sites, and there is a growing concern that backhaul network can become a new network bottleneck in certain deployment scenarios. Unlike existing assignment approaches, we propose a BS assignment algorithm envisioned as a suitable technique capable to cope, at some extent, with possible backhaul congestion situations in OFDMA-based systems. Simulation results demonstrate that the proposed algorithm can provide the same system capacity with less backhaul resources so that, under backhaul bottleneck situations, a better overall network performance is effectively achieved.
{"title":"Enhanced base station assignment approach for coping with backhaul constraints in OFDMA-based cellular networks","authors":"Hiram Galeana, R. Ferrús","doi":"10.1109/EW.2010.5483425","DOIUrl":"https://doi.org/10.1109/EW.2010.5483425","url":null,"abstract":"In this paper we extend the base station (BS) assignment problem to incorporate backhaul related constraints into the assignment decision. This is motivated by the fact that the deployment of more spectral efficient radio access technologies are currently imposing stringent bandwidth requirements at cell sites, and there is a growing concern that backhaul network can become a new network bottleneck in certain deployment scenarios. Unlike existing assignment approaches, we propose a BS assignment algorithm envisioned as a suitable technique capable to cope, at some extent, with possible backhaul congestion situations in OFDMA-based systems. Simulation results demonstrate that the proposed algorithm can provide the same system capacity with less backhaul resources so that, under backhaul bottleneck situations, a better overall network performance is effectively achieved.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126603335","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}
Scheduling of real-time uplink flows in HSUPA is hampered by the fact that the NodeB does not know the size and dead-lines of the uplink packets, as the User Equipment (UE) only reports coarse-grained Scheduling Information (SI) advertising the overall backlog. In this paper, we describe how the NodeB can use the sequence of SI to reconstruct a UE queue, using affordable computations. This makes it possible to use scheduling algorithms employing packet sizes and deadlines in HSUPA, with obvious performance benefits. We present a general Virtual Queueing framework, that can be employed with any kind of traffic, and a specialized version of it for periodic (e.g., voice) traffic.
{"title":"Effective scheduling of real-time traffic in HSUPA","authors":"M. Andreozzi, G. Stea","doi":"10.1109/EW.2010.5483474","DOIUrl":"https://doi.org/10.1109/EW.2010.5483474","url":null,"abstract":"Scheduling of real-time uplink flows in HSUPA is hampered by the fact that the NodeB does not know the size and dead-lines of the uplink packets, as the User Equipment (UE) only reports coarse-grained Scheduling Information (SI) advertising the overall backlog. In this paper, we describe how the NodeB can use the sequence of SI to reconstruct a UE queue, using affordable computations. This makes it possible to use scheduling algorithms employing packet sizes and deadlines in HSUPA, with obvious performance benefits. We present a general Virtual Queueing framework, that can be employed with any kind of traffic, and a specialized version of it for periodic (e.g., voice) traffic.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114248817","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}
This paper investigates pricing mechanisms for utility maximization in interference coupled systems. An axiomatic framework of interference functions similar to the one proposed by Yates is utilized to capture interference coupling in wireless systems. Pricing mechanisms are used as a design tool to shift the solution outcome of a utility maximization problem to a desired point in the region. The paper explores the restrictions required on the class of utility functions and the restrictions on the class of interference functions such that a pricing mechanism can always guarantee the designer the ability of being able to shift the solution outcome to any desired point in the region, i.e. it is a universal pricing mechanism.
{"title":"Universal pricing mechanism for utility maximization for interference coupled systems","authors":"H. Boche, S. Naik, T. Alpcan","doi":"10.1109/EW.2010.5483456","DOIUrl":"https://doi.org/10.1109/EW.2010.5483456","url":null,"abstract":"This paper investigates pricing mechanisms for utility maximization in interference coupled systems. An axiomatic framework of interference functions similar to the one proposed by Yates is utilized to capture interference coupling in wireless systems. Pricing mechanisms are used as a design tool to shift the solution outcome of a utility maximization problem to a desired point in the region. The paper explores the restrictions required on the class of utility functions and the restrictions on the class of interference functions such that a pricing mechanism can always guarantee the designer the ability of being able to shift the solution outcome to any desired point in the region, i.e. it is a universal pricing mechanism.","PeriodicalId":232165,"journal":{"name":"2010 European Wireless Conference (EW)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131433779","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：