2012 IEEE International Conference on Communications (ICC)最新文献_第10页

Enhanced voice over LTE and its roaming aspects 增强LTE语音和漫游功能

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-06-10 DOI: 10.1109/ICC.2012.6364821

S. S. Husain, LaeYoung Kim, T. Koshimizu, A. Kunz

引用次数: 2

Tone reservation based peak power reduction in OFDMA uplink systems 基于音调保留的OFDMA上行系统峰值功率降低

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-06-10 DOI: 10.1109/ICC.2012.6364572

A. Ghassemi, L. Lampe, T. Gulliver

引用次数: 1

IEEE DySPAN-SC activities on standardization of white space radio systems IEEE DySPAN-SC关于白色空间无线电系统标准化的活动

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-06-10 DOI: 10.1109/ICC.2012.6364865

S. Filin, H. Harada

引用次数: 6

Outage performance analysis of two-way relay system with multi-antenna relay node 多天线中继节点双向中继系统的中断性能分析

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-06-10 DOI: 10.1109/ICC.2012.6363835

Rui Wang, M. Tao

引用次数: 16

Epidemic forwarding in mobile social networks 移动社交网络中的流行转发

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-06-10 DOI: 10.1109/ICC.2012.6364533

Hongxia Sun, Chuan Wu

{"title":"Epidemic forwarding in mobile social networks","authors":"Hongxia Sun, Chuan Wu","doi":"10.1109/ICC.2012.6364533","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364533","url":null,"abstract":"Recent years have witnessed the prosperity of mobile social networks, where various information is shared among mobile users through their opportunistic contacts. To investigate efficiency of information dissemination in wireless networks, epidemic models have been employed to study message forwarding delays, presuming message delivery whenever an opportunistic contact occurs. A practical concern is typically neglected, that one mobile user may only be willing to pass information onto others with social ties, rather than anyone upon contact. Under such a constraint, information dissemination may behave differently, according to the pattern of social ties that exist in the network. In this paper, we model social-aware epidemic forwarding in mobile social networks using mean-field equations, and carefully study the end-to-end unicast message propagation delays under different levels of social ties among users. Both cases of limited and unlimited message validity are considered in our models, i.e., whether relay nodes may delete a message after carrying it for some finite time T or never. Through careful theoretical analysis and empirical studies, we made a number of intriguing observations: First, the topology of social relation graphs significantly influences message forwarding delays, i.e., the more skewed the social relationship distribution is, the larger delay it results in. Second, the average delivery delay remains fairly stable with the growth of system scale, presenting a sharp contrast with the case without social awareness. Third, we observe that with a moderate choice of T, message delivery can achieve a successful ratio of almost 100% with an expected delay very close to the case of unlimited validity, signifying that a good tradeoff can be achieved between end-to-end message delivery efficiency and energy/storage overhead at the relay nodes in a network. All these provide useful guidance for efficient information dissemination protocol design in practical mobile social networks.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128293836","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}

引用次数: 21

Resilient network dimensioning for optical grid/clouds using relocation 使用重新定位的光网格/云的弹性网络尺寸

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-06-10 DOI: 10.1109/ICC.2012.6364981

Chris Develder, J. Buysse, M. D. Leenheer, B. Jaumard, B. Dhoedt

{"title":"Resilient network dimensioning for optical grid/clouds using relocation","authors":"Chris Develder, J. Buysse, M. D. Leenheer, B. Jaumard, B. Dhoedt","doi":"10.1109/ICC.2012.6364981","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364981","url":null,"abstract":"In this paper we address the problem of dimensioning infrastructure, comprising both network and server resources, for large-scale decentralized distributed systems such as grids or clouds. We will provide an overview of our work in this area, and in particular focus on how to design the resulting grid/cloud to be resilient against network link and/or server site failures. To this end, we will exploit relocation: under failure conditions, a request may be sent to an alternate destination than the one under failure-free conditions. We will provide a comprehensive overview of related work in this area, and focus in some detail on our own most recent work. The latter comprises a case study where traffic has a known origin, but we assume a degree of freedom as to where its end up being processed, which is typically the case for e.g., grid applications of the bag-of-tasks (BoT) type or for providing cloud services. In particular, we will provide in this paper a new integer linear programming (ILP) formulation to solve the resilient grid/cloud dimensioning problem using failure-dependent backup routes. Our algorithm will simultaneously decide on server and network capacity. We find that in the anycast routing problem we address, the benefit of using failure-dependent (FD) rerouting is limited compared to failure-independent (FID) backup routing. We confirm our earlier findings in terms of network capacity savings achieved by relocation compared to not exploiting relocation (order of 6-10% in the current case studies).","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128569349","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}

引用次数: 28

Iterative recovery algorithms for compressed sensing of wideband block sparse spectrums 宽带块稀疏频谱压缩感知的迭代恢复算法

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-06-10 DOI: 10.1109/ICC.2012.6364377

Z. Zeinalkhani, A. Banihashemi

{"title":"Iterative recovery algorithms for compressed sensing of wideband block sparse spectrums","authors":"Z. Zeinalkhani, A. Banihashemi","doi":"10.1109/ICC.2012.6364377","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364377","url":null,"abstract":"A major task in cognitive radios (CRs) is spectrum sensing. In a wide-band regime, this is a challenging task requiring very high-speed analog-to-digital converters (ADCs), operating at or above the Nyquist rate. Compressed sensing is recognized as an effective technique to significantly reduce the sampling rate in wideband spectrum sensing, taking advantage of the sparsity of the spectrum. The recovery of the spectrum from the samples at sub-Nyquist rates is usually achieved through the so-called ℓ1-norm minimization. A more effective recovery technique for block sparse signals, called ℓ2/ℓ1-norm minimization, can be used as a replacement for ℓ1-norm minimization to reduce the sampling rate and consequently simplify the implementation of ADCs even further. In this paper, we propose two iterative ℓ2/ ℓ1-norm minimization algorithms for the recovery of block sparse spectrums. Similar to the standard ℓ2/ℓ1-norm minimization, the proposed algorithms require the side information about the boundaries of the spectral blocks. We evaluate the performance of the proposed algorithms both in the absence and in the presence of noise, and demonstrate that for both cases, the proposed algorithms significantly outperform the existing ℓ1-minimization-based and standard ℓ2/ℓ1 minimization recovery algorithms. The improvement in performance comes at a small cost in complexity increase.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128739572","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}

引用次数: 20

Aggregation of variables in load models for interference-coupled cellular data networks 干扰耦合蜂窝数据网络负载模型中变量的聚合

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-06-10 DOI: 10.1109/ICC.2012.6363999

A. Fehske, G. Fettweis

{"title":"Aggregation of variables in load models for interference-coupled cellular data networks","authors":"A. Fehske, G. Fettweis","doi":"10.1109/ICC.2012.6363999","DOIUrl":"https://doi.org/10.1109/ICC.2012.6363999","url":null,"abstract":"In order to meet increasing traffic demands, future generations of cellular networks are characterized by decreasing cell sizes at full frequency reuse. Due to inevitable inter-cell interference, load conditions in neighboring cells can no longer be considered independent. Unfortunately, the adequate flow level model for such a setup is analytically intractable. Utilizing aggregation techniques, which were originally proposed to analyze large state models in economics, we propose a framework to compute the average base station loads based on an approximation of the joint stationary distribution of the number of active flows in all cells. The technique proposed requires solving a system of linear equations whose dimension increases exponentially with the number of cells. Since such a system is essentially intractable for large networks, we propose a fixed point algorithm to compute approximate base station loads based on the notion of average interference. Numerical results validate the accuracy of both modeling techniques. The modeling approach presented in this paper is essential for accurate characterization of cell throughput as well as base station energy consumption under varying load conditions.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129264419","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}

引用次数: 69

A self-powered wireless sensor for water/gas metering systems 用于水/气计量系统的自供电无线传感器

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-06-10 DOI: 10.1109/ICC.2012.6364711

D. D. Zenobio, K. Steenhaut, M. Celidonio, E. Sergio, Y. Verbelen

引用次数: 5

An MDP-based model for optimal relay selection in OFDMA cooperative networks 基于mdp的OFDMA合作网络中继优化选择模型

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-06-10 DOI: 10.1109/ICC.2012.6364264

N. Abuali, A. Taha

引用次数: 3