{"title":"Performance of generalized Rake receiver with imperfect channel and interference estimates","authors":"B. Lindoff","doi":"10.1109/EW.2009.5357755","DOIUrl":"https://doi.org/10.1109/EW.2009.5357755","url":null,"abstract":"The Rake and the generalized Rake (G-Rake) receivers are the most commonly used receiver structures in cellular DS-CDMA systems. In this paper we analyze how imperfect channel and noise correlation estimates affect the G-Rake and Rake receiver performances in terms of SIR degradation compared to SIR achieved assuming ideal channel and noise correlation information. The expressions derived in the paper gives a possibility to do model validation. For instance, for the G-Rake case, one can get an indication about the optimal number of probing fingers to be used to maximize the SIR into the detector as function of the number of symbols used for channel and noise covariance estimation. Some performace examples are given in the paper within the framework of WCDMA.","PeriodicalId":412079,"journal":{"name":"2009 European Wireless Conference","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126685906","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}
{"title":"Performance evaluation of TDMA versus CSMA-based protocols in SINR models","authors":"S. Banaouas, P. Muhlethaler","doi":"10.1109/EW.2009.5358007","DOIUrl":"https://doi.org/10.1109/EW.2009.5358007","url":null,"abstract":"In this paper, we compare time division and carrier sense multiple access schemes (TDMA and CSMA) in a signal to noise and interference ratio (SINR)-based model. We assume that the network nodes are distributed a Poisson process evenly distributed and have pending packets. First we study the distribution of the SINR in TDMA-based protocols where the same time-slot is reserved in given radius of n hops (n = 2 in most of these protocols). The same study is carried for CSMA-based access protocols where the reuse is controlled with the carrier-sense threshold. We then compare the total throughput of TDMA and CSMA based access protocols in an outage model. In this model a packet is considered as correctly received if its SINR is above a given threshold. Finally, we conduct the same comparison between TDMA and CSMA-based access protocols in a model of adaptive coding. In this model, the actual SINR rules the transmission coding. We idealize the performance of this technique using the Shannon's well know formula W = W0log(1 + SINR).","PeriodicalId":412079,"journal":{"name":"2009 European Wireless Conference","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123045987","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}
{"title":"Evolutionary theory for cluster head election in cooperative clusters implementing network coding","authors":"L. Militano, F. Fitzek, A. Iera, A. Molinaro","doi":"10.1109/EW.2009.5357993","DOIUrl":"https://doi.org/10.1109/EW.2009.5357993","url":null,"abstract":"In this paper a cluster head election problem is studied for a cooperative wireless network. The nodes in the cluster use random linear network coding to enhance the throughput performance in spreading the data for a file download service. Some of the nodes in the cluster will access through their cellular link parts of a file to be exchanged among all the cooperative nodes. In such a wireless environment, network coding enhances significantly the throughput performance. A good choice of the nodes acting as information sources for the cluster depends on their position and cellular link throughput and turns to be of utmost importance for the achievement of high performance levels. Therefore, a cluster head election algorithm is needed, which shall be fast in converging to either the optimal or, alternatively, a satisfactory sub-optimal solution. We propose to use the evolutionary theory. Results of our investigations are introduced with reference to a high performing implementation of a genetic algorithm under different network conditions both in static and in mobile environments.","PeriodicalId":412079,"journal":{"name":"2009 European Wireless Conference","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132066135","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}
{"title":"Conditions for the stability of wireless ARQ protocols and reliable communications","authors":"A. Giovanidis, S. Stańczak","doi":"10.1109/EW.2009.5357974","DOIUrl":"https://doi.org/10.1109/EW.2009.5357974","url":null,"abstract":"We consider ARQ protocols which vary the error probabilities per retransmission, having no channel state information at the transmitter. Such protocols can be described by irreducible and aperiodic discrete time Markov chains with countably infinite states of a specific form. Ergodicity of such chains guarantees finite expected delay until correct reception as well as positive throughput. Initiating from general stability criteria we formulate and prove necessary and sufficient conditions for recurrence, ergodicity and non-ergodicity for the chains of interest. The conditions are applied to the case of retransmissions via a Rayleigh fading channel to obtain recurrence and ergodicity conditions based on power allocation per retransmission.","PeriodicalId":412079,"journal":{"name":"2009 European Wireless Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130022159","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}
{"title":"Relaying in Long Term Evolution: Indoor full frequency reuse","authors":"V. Venkatkumar, T. Wirth, T. Haustein, E. Schulz","doi":"10.1109/EW.2009.5357758","DOIUrl":"https://doi.org/10.1109/EW.2009.5357758","url":null,"abstract":"Future cellular wireless networks could include multihop transmissions through relays. For LTE-Advanced networks multihop relaying is one of the candidate enabling techniques for coverage extension. In particular, relaying is envisioned for indoor coverage, such as in office and residential buildings. In this approach, a wireless relay is placed inside a building in order to reduce the building penetration path loss. A relay could perform analog signal amplification or decode and forward operation. Decode and forward operation is advantageous in the sense that a relay can employ full reuse of the bandwidth. The re-used bandwidth could also be used efficiently by independent link adaptation. This paper reports measurement results of state of art direct link and indoor decode and forward relaying in LTE downlink. Relaying has been implemented in a real-time test-bed with enabling transceiver techniques such as half-duplex interference suppression and IP packet forwarding. The relay test-bed reuses the full 20 MHz bandwidth with frequency dependent link adaptation. Field trial measurements are performed in a single cell single user indoor office scenario with one relay. Results show that indoor LTE relaying is capable of delivering high throughput above 60 Mbps, with a spectral efficiency of 3 bits/s/Hz. It also provides 16 Mbps to locations well inside the building which is seen to be more dramatic.","PeriodicalId":412079,"journal":{"name":"2009 European Wireless Conference","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133465734","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}
{"title":"Threshold list subset detector for turbo MIMO systems","authors":"Sairamesh Nammi","doi":"10.1109/EW.2009.5357985","DOIUrl":"https://doi.org/10.1109/EW.2009.5357985","url":null,"abstract":"A threshold based list detector is presented for multiple-input multiple-output (MIMO) system. The detector is based on subset-sum algorithm. The algorithm make use of a low complexity sub optimal minimum mean square error (MMSE) detector to find the bit reliabilities, and uses these reliabilities to generate list of possible candidate data vectors. It is shown through analysis that this detector can be designed to ensure a specific bit error performance with respect to the optimum maximum likelihood detector. The proposed threshold list subset sum detector (T-LSS) is extended for coded turbo MIMO transmission. Unlike other detectors proposed in the literature, the T-LSS detector generates list for each outer iteration.","PeriodicalId":412079,"journal":{"name":"2009 European Wireless Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114838896","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}
{"title":"Dimensioning of the downlink in OFDMA cellular networks via an Erlang's loss model","authors":"B. Błaszczyszyn, M. Karray","doi":"10.1109/EW.2009.5358006","DOIUrl":"https://doi.org/10.1109/EW.2009.5358006","url":null,"abstract":"In this paper we propose the following approach to the dimensioning of the radio part of the downlink in OFDMA networks. First, we use information theory to characterize the bit-rate in the channel from a base station to its mobile. It depends on the power and bandwidth allocated to this mobile. Then, we describe the resource (power and bandwidth) allocation problem and characterise feasible configurations of bit-rates of all users. As the key element, we propose some particular sufficient condition (in a multi-Erlang form) for a given configuration of bit-rates to be feasible. Finally, we consider an Erlang's loss model, in which streaming arrivals whose admission would lead to the violation of this sufficient condition are blocked and lost. In this model, the blocking probabilities can be calculated using Kaufman-Roberts algorithm. We propose it to evaluate the minimal density of base stations assuring acceptable blocking probabilities for a streaming traffic of a given load per surface unit. We validate this approach by comparison of the blocking probabilities to these simulated in the similar model in which the admission control is based on the original feasibility property (instead of its sufficient condition). Our sufficient bit-rate feasibility condition can also be used to dimension the network with respect to the elastic traffic.","PeriodicalId":412079,"journal":{"name":"2009 European Wireless Conference","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122833629","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}
{"title":"A robust cell search algorithm for 3GPP LTE","authors":"B. Lindoff, T. Rydén, D. Astely","doi":"10.1109/EW.2009.5357995","DOIUrl":"https://doi.org/10.1109/EW.2009.5357995","url":null,"abstract":"Mobility handling and performance is of major importance for the 3GPP long term evolution (LTE) system. Therefore it is important for mobile devices to use reliable and robust algorithms for the cell search procedure, i.e. the procedure to detect neighbouring cells that can be used as potential handover candidates. We present a novel, low complexity, robust cell search scheme for LTE. The scheme uses a non-coherent approach and is therefore robust against Doppler spread and phase shifts due to sampling time instant mismatch, which makes it suitable for use in synchronized LTE TDD systems, as well as in high speed scenarios like high speed trains. This paper describes the theory behind the algorithm, and simulation results for LTE TDD showing its superior performance over coherent cell search algorithms are also presented.","PeriodicalId":412079,"journal":{"name":"2009 European Wireless Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131258321","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}
{"title":"Performance analysis of Closed and Open loop MIMO in LTE","authors":"C. Ball, R. Mullner, J. Lienhart, H. Winkler","doi":"10.1109/EW.2009.5358012","DOIUrl":"https://doi.org/10.1109/EW.2009.5358012","url":null,"abstract":"This paper provides a detailed performance comparison between closed loop (CL) and open loop (OL) MIMO schemes for the upcoming OFDM based mobile broadband radio access technology 3GPP UTRA LTE. Based on system level simulation results, key performance indicators like cell throughput, user throughput and MIMO utilization have been evaluated for different system load conditions assuming 2×2 MIMO in a regular hexagonal cell deployment and in a real network scenario. A realistic dynamic MIMO switch between diversity and spatial multiplexing has been assumed, which is based on configurable CQI as well as rank filtering and decision thresholds. 3GPP compliant measurement granularity as well as appropriate measurement errors have been applied to both CQI and closed loop PMI reports. Besides dynamic MIMO switching, both MIMO 2×2 diversity and MIMO 2×2 spatial multiplexing scenarios have been investigated for the downlink direction highlighting the differences of the various MIMO transmission modes and their impacts on spectral efficiency and radio performance. It has been shown that ideal closed loop MIMO provides a 2 dB theoretical performance gain over open loop MIMO. Assuming practical limitations such as available granularity, delay and realistic PMI measurement errors, however, this gain significantly decreases below roughly 1 dB. Nevertheless MIMO proves to be an appropriate method to boost user throughput especially at low to medium system load up to a factor of 2. Moreover the dynamic MIMO switch proves to be very robust against variations of parameter settings.","PeriodicalId":412079,"journal":{"name":"2009 European Wireless Conference","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123672355","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}
{"title":"Increasing the VoIP capacity of WiMAX systems through persistent resource allocation","authors":"Klaus Sambale, K. Klagges","doi":"10.1109/EW.2009.5357982","DOIUrl":"https://doi.org/10.1109/EW.2009.5357982","url":null,"abstract":"It is expected that future IMT-Advanced systems will operate packet-switched due to the dominance of data services. However, it is inherent to packet-switched systems to not cope well with voice services. In this paper, we present a simple Persistent Resource Allocation (PRA) scheme that greatly increases the Voice-over-IP (VoIP) capacity of such type of systems by reducing the signaling overhead for resource allocations. PRAs are assigned per VoIP connection and are valid for a fix number of frames. Resource allocations for succeeding frames have to be signaled by new PRAs. This supersedes any procedures for revocation of PRAs and associated error handling. The technique is applicable to all packet-switched systems but within our work we focus on WiMAX systems. The analytical evaluation presented in this paper confirms the potential of this technique.","PeriodicalId":412079,"journal":{"name":"2009 European Wireless Conference","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128451681","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}