2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)最新文献_第9页

A simple method for the simulation of autocorrelated and arbitrarily distributed envelope fading processes 一种模拟自相关和任意分布包络衰落过程的简单方法

2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2010-06-20 DOI: 10.1109/SPAWC.2010.5671019

A. Petrolino, G. Tavares

引用次数: 1

Distributed optimization in heterogeneous networks with proportional fairness 基于比例公平的异构网络分布式优化

2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2010-06-20 DOI: 10.1109/SPAWC.2010.5670995

C. Gaie, M. Assaad, P. Duhamel

{"title":"Distributed optimization in heterogeneous networks with proportional fairness","authors":"C. Gaie, M. Assaad, P. Duhamel","doi":"10.1109/SPAWC.2010.5670995","DOIUrl":"https://doi.org/10.1109/SPAWC.2010.5670995","url":null,"abstract":"In this paper we develop a discrete and distributed optimization framework that maximizes the overall spectral efficiency of heterogeneous networks while ensuring a minimum fairness among users. We split the problem into two subproblems: the first one is handled by the users and consists in a transmission by each user of a minimum rate requirement to the base stations and the second is the resource allocation performed by the base stations with respect to the rate constraints generated by the users. The first subproblem is solved using a process where each user tries to adjust its rate requirements to the network capacity. This process is inspired from the TCP Vegas algorithm [1], where the network usage is improved by reducing congestion. Based on the users' rate requirements, the base stations perform a discrete resource optimization in order to allocate power and rate to each user. The rates are selected among a finite set of discrete rates since Adaptive Modulation and Coding (AMC) technique is assumed to be used in each network. The proposed algorithm is compared to an extension of the Proportional Fair algorithm, developed in this paper to allow joint rate and power allocation. Simulation results show that the proposed algorithm provides better performance than the simple PF while ensuring an acceptable fairness among the users.","PeriodicalId":436215,"journal":{"name":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131696203","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

Improving uplink LTE performance with modulation-aware iterative equalization 利用调制感知迭代均衡改进上行LTE性能

2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2010-06-20 DOI: 10.1109/SPAWC.2010.5671034

L. Krzymien, C. Schlegel, Shuai Zhang

引用次数: 1

Efficiency closed-form expressions for any IR-HARQ scheme at the IP level 在IP级别上任何IR-HARQ方案的效率封闭形式表达式

2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2010-06-20 DOI: 10.1109/SPAWC.2010.5671036

A. Le Duc, C. L. Le Martret, P. Ciblat

引用次数: 3

Reconstruction of time-varying fields in wireless sensor networks using shift-invariant spaces: Iterative algorithms and impact of sensor localization errors 利用移位不变空间重建无线传感器网络中的时变场:迭代算法和传感器定位误差的影响

2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2010-06-20 DOI: 10.1109/SPAWC.2010.5670993

Günter Reise, G. Matz

引用次数: 7

Closed-form bounds on the ergodic capacity and symbol error probability of the opportunistic incremental relaying protocol 机会式增量中继协议遍历容量和符号错误概率的封闭界

2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2010-06-20 DOI: 10.1109/SPAWC.2010.5671029

Omer Waqar, D. McLernon, M. Ghogho

{"title":"Closed-form bounds on the ergodic capacity and symbol error probability of the opportunistic incremental relaying protocol","authors":"Omer Waqar, D. McLernon, M. Ghogho","doi":"10.1109/SPAWC.2010.5671029","DOIUrl":"https://doi.org/10.1109/SPAWC.2010.5671029","url":null,"abstract":"In this paper, we analyze the ergodic capacity (per unit bandwidth) and Average symbol error probability (ASEP) of an incremental relaying protocol used in conjunction with opportunistic relaying and consider a non-regenerative wireless relay network with Rayleigh fading channels. We consider a selection combining technique at the destination in order to combine the two signals, one from the direct path and the other from the best relay path. For a tractable analysis we upper bound the end-to-end signal-to-noise ratio (SNR) and then derive a new closed-form expression of its probability density function (PDF). Utilizing this statistical result we then derive new closed-form lower bounds of ASEP and upper bounds of ergodic capacity over independent and non-identical Rayleigh fading channels. It is shown that the opportunistic incremental relaying (OIR) protocol can considerably improve the ASEP and at the same time (depending upon the channel conditions) also slightly increase (or decrease) the ergodic capacity of the network. The improvement in the performance metrics comes only at the expense of an increase in the network's complexity. Furthermore, it is shown that our derived closed-form bounds are tight in a sense that they match with the exact curves obtained through Monte Carlo simulations and numerical integration techniques.","PeriodicalId":436215,"journal":{"name":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114251937","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

Optimization techniques for two-way relaying based multiuser multiplexing 基于多用户复用的双向中继优化技术

2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2010-06-20 DOI: 10.1109/SPAWC.2010.5670887

J. Hu, Z. Xiong, Y. Rahulamathavan, K. Cumanan, S. Lambotharan

引用次数: 2

On the effect of FTDMA techniques on a distributed estimation in WSN 无线传感器网络中FTDMA技术对分布式估计的影响

2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2010-06-20 DOI: 10.1109/SPAWC.2010.5671012

S. Narieda

{"title":"On the effect of FTDMA techniques on a distributed estimation in WSN","authors":"S. Narieda","doi":"10.1109/SPAWC.2010.5671012","DOIUrl":"https://doi.org/10.1109/SPAWC.2010.5671012","url":null,"abstract":"This paper discusses an energy constrained distributed estimation in wireless sensor network (WSN) based on frequency and time division multiple access (FTDMA). In a measurement with WSN, sensors transmit observed quantized data to a fusion center (FC) via radio communication channels, to obtain a final estimate. Such systems require a multiple access technique such as time division multiple access, frequency division multiple access and FTDMA. In this paper, we focus on FTDMA as the multiple access technique, because of its high reliability and high spectral efficiency. We define an optimization problem to minimize a mean-squared error (MSE) while keeping a limited total power in FTDMA-based WSN, and derive the equations for bit allocation. Next, we investigate the effect of FTDMA-based measurement environment with WSN on the distributed estimation. Also, we show that a time slot and frequency band to be allocated to each sensor shall be optimized for the MSE minimization, because of the definition of the allocated power for sensors and the MSE. For this problem, we define a combination optimization to determine the time slot and frequency band. We develop the algorithm to determine the time slot, frequency band and allocated power to each sensor. In the algorithm, a genetic algorithm is employed to solve the combination optimization problem. Numerical examples are presented. Our developed algorithm outperforms conventional sensor selection with no optimization for the combination of sensors in terms of the MSE.","PeriodicalId":436215,"journal":{"name":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116027760","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

Distributed resource allocation in cognitive radio systems based on social foraging swarms 基于社会觅食群的认知无线电系统分布式资源分配

2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2010-06-20 DOI: 10.1109/SPAWC.2010.5670805

P. Di Lorenzo, S. Barbarossa

{"title":"Distributed resource allocation in cognitive radio systems based on social foraging swarms","authors":"P. Di Lorenzo, S. Barbarossa","doi":"10.1109/SPAWC.2010.5670805","DOIUrl":"https://doi.org/10.1109/SPAWC.2010.5670805","url":null,"abstract":"The goal of this paper is to propose a distributed resource allocation strategy for the access of opportunistic users in cognitive networks. The opportunistic, or secondary, users are modeled as a set of agents looking for the most appropriate slots to use, in the time-frequency domain, with the goal of avoiding conflicts among themselves and to yield possibly no interference to the primary users. The problem is how to coordinate the access from the secondary users in a totally decentralized fashion, requiring a minimal coordination among them. We propose a solution to this problem based on a social forage swarming model, where the search for the most appropriate slots is modeled as the motion of a swarm of agents in the resource domain (typically the time-frequency plane), looking for “forage”, representing a function inversely proportional to the interference level. The swarm tends to move in the time-frequency region where there is less interference, while satisfying one basic requirement: minimize the spread in the resource domain while avoiding collisions between the allocations of different users. These properties are enforced through the decentralized minimization of a potential function that incorporates a long-range attraction between the resources occupied by secondary users (to minimize spreading) and a short-range repulsion (to avoid conflicts)1.","PeriodicalId":436215,"journal":{"name":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123424693","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}

引用次数: 13

How can ignorant but patient cognitive terminals learn their strategy and utility? 无知但有耐心的认知终末期如何学习它们的策略和效用?

2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) Pub Date : 2010-06-20 DOI: 10.1109/SPAWC.2010.5670983

S. Perlaza, H. Tembine, S. Lasaulce

{"title":"How can ignorant but patient cognitive terminals learn their strategy and utility?","authors":"S. Perlaza, H. Tembine, S. Lasaulce","doi":"10.1109/SPAWC.2010.5670983","DOIUrl":"https://doi.org/10.1109/SPAWC.2010.5670983","url":null,"abstract":"This paper aims to contribute to bridge the gap between existing theoretical results in distributed radio resource allocation policies based on equilibria in games (assuming complete information and rational players) and practical design of signal processing algorithms for self-configuring wireless networks. For this purpose, the framework of learning theory in games is exploited. Here, a new learning algorithm based on mild information assumptions at the transmitters is presented. This algorithm possesses attractive convergence properties not available for standard reinforcement learning algorithms and in addition, it allows each transmitter to learn both its optimal strategy and the values of its expected utility for all its actions. A detailed convergence analysis is conducted. In particular, a framework for studying heterogeneous wireless networks where transmitters do not learn at the same rate is provided. The proposed algorithm, which can be applied to any wireless network verifying the information assumptions stated, is applied to the case of multiple access channels in order to provide some numerical results.","PeriodicalId":436215,"journal":{"name":"2010 IEEE 11th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121108241","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}

引用次数: 29