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

Rate regions for coordination of Decode-and-Forward relays and direct users 用于协调译码转发中继和直接用户的速率区域

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-11-29 DOI: 10.1109/ICC.2012.6364628

C. Thai, P. Popovski

引用次数: 3

Protocol design of a slot allocation scheme for persistence-reservation-based IEEE 802.16d mesh networks 基于持续保留的IEEE 802.16d网状网络槽位分配方案的协议设计

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-11-29 DOI: 10.1109/ICC.2012.6364276

C. Ang

{"title":"Protocol design of a slot allocation scheme for persistence-reservation-based IEEE 802.16d mesh networks","authors":"C. Ang","doi":"10.1109/ICC.2012.6364276","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364276","url":null,"abstract":"This paper proposes a MAC-layer timeslot allocation signaling protocol for IEEE 802.16d mesh networks. The proposed mechanism complements the three-way-handshake signaling described in the specification to achieve fair sharing of timeslots among nodes and flows. In this paper we study the case where timeslots are reserved until cancelled explicitly. This form of reservation is efficient for long sessions of data transmissions such as video streaming or interactive media applications. Since timeslots are exclusively reserved for individual flows, bandwidth starvation can occur if remaining timeslots in the wireless medium around a node are not enough to fulfill new bandwidth requests. It is thus important to design a set of mechanisms to enable sharing of network capacity across all flows fairly. A set of intra- and inter-flow fairness mechanisms is designed to work with an adaptive timeslot allocation scheme. The mechanisms and signaling are designed to efficiently integrate with the three-way-handshake signaling of the IEEE 802.16d mesh specification. Simulation results showed that the proposed schemes can prevent starvation of slot allocation and are able to maintain fairness across flows in the persistence-reservation-based IEEE 802.16d mesh network.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128638581","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

Toward neighborhood prediction using Physical-Layer Network Coding 基于物理层网络编码的邻域预测

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-11-29 DOI: 10.1109/ICC.2012.6364405

E. D. N. Ndih, S. Cherkaoui

引用次数: 5

A receiver architecture for pulse-based electromagnetic nanonetworks in the Terahertz Band 一种用于太赫兹波段脉冲电磁纳米网络的接收器架构

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-11-29 DOI: 10.1109/ICC.2012.6364476

R. G. Cid-Fuentes, J. Jornet, I. Akyildiz, E. Alarcón

{"title":"A receiver architecture for pulse-based electromagnetic nanonetworks in the Terahertz Band","authors":"R. G. Cid-Fuentes, J. Jornet, I. Akyildiz, E. Alarcón","doi":"10.1109/ICC.2012.6364476","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364476","url":null,"abstract":"Graphene-enabled wireless communications set the Terahertz Band as the frequency band of operation of future nanodevices (0.1-10 THz). Amongst others, femtosecond-long pulse-based modulation schemes have been recently proposed to enable the communication among nanodevices. Within this context, a receiver architecture suitable for nanodevices must be ultra compact, must have high sensitivity and must be ultra-low power. Unfortunately, common receiver architectures used in other communication schemes, such as IR-UWB, show a strong compromise between low complexity and performance. In this paper, a novel receiver architecture for pulse-based communication based on a Continuous-time Moving Average (CTMA) symbol detection scheme is presented. This scheme bases its symbol decision on the received signal power maximum peak after the CTMA, which is implemented with a single low-pass filter. Moreover, an analytical model for the symbol detection is provided and it is quantitatively shown that the proposed CTMA scheme outperforms previous symbol detection schemes for pulse-based modulations in terms of Symbol Error Rate (SER). The low complexity and relaxed synchronization needed for this symbol detector makes this structure specially suited for the development of future transceivers for nano-devices.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126179222","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}

引用次数: 39

An information theoretical analysis of broadcast networks and channel routing for FRET-based nanoscale communications 基于fret的纳米级通信中广播网络和信道路由的信息理论分析

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-11-29 DOI: 10.1109/ICC.2012.6364930

M. Kuscu, Derya Malak, Ö. Akan

引用次数: 11

Joint transceiver beamforming design and power allocation for multiuser MIMO systems 多用户MIMO系统的联合收发器波束形成设计与功率分配

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-11-29 DOI: 10.1109/ICC.2012.6364057

Li-Yu Daisy Liu, Chang Wen Chen

{"title":"Joint transceiver beamforming design and power allocation for multiuser MIMO systems","authors":"Li-Yu Daisy Liu, Chang Wen Chen","doi":"10.1109/ICC.2012.6364057","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364057","url":null,"abstract":"Multi-user multiple input multiple output (MU-MIMO) system is an excellent choice for the next generation broadband communications because of its great potential in enhancing MIMO system capacity. One major challenge of such system is the jointly optimal transceiver beamforming design that maximizes the sum capacity under a total power constraint. Existing approaches have provided convex optimization solution by exploiting the duality between transmitter and receiver. However, with high computation complexity, these approaches are ineligible of practical implementation. In this paper, we aim to provide complexity efficient transceiver beamformer and power allocation design in MU-MIMO downlink (broadcast) channels. We first develop an iterative sub-optimal algorithm based on cyclic self-SINR-maximization (CSSM) beamforming design and water-filling power allocation. Comparing to convex-optimization-based (COB) approaches, the proposed solution (i.e. CSSM-WF algorithm) have insignificant sum-rate degradation but very low computational complexity and extremely fast converging speed. Trying to improve the performance of CSSM-WF algorithm, we then introduce another algorithm denoted as efficient COB (ECOB) algorithm in which CSSM-WF algorithm is used to generate a good start point for optimal COB approaches. Simulation results prove the efficiency of both proposed algorithms.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128575413","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}

引用次数: 9

Global motion compensation and spectral entropy bit allocation for low complexity video coding 低复杂度视频编码的全局运动补偿和谱熵位分配

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-11-29 DOI: 10.1109/ICC.2012.6364046

Malavika Bhaskaranand, J. Gibson

{"title":"Global motion compensation and spectral entropy bit allocation for low complexity video coding","authors":"Malavika Bhaskaranand, J. Gibson","doi":"10.1109/ICC.2012.6364046","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364046","url":null,"abstract":"Most standard video compression schemes such as H.264/AVC involve a high complexity encoder with block motion estimation (ME) engine. However, applications such as video reconnaissance and surveillance using unmanned aerial vehicles (UAVs) require a low complexity video encoder. Additionally, in such applications, the motion in the video is primarily global and due to the known movement of the camera platform. Therefore in this work, we propose and investigate a low complexity encoder with global motion based frame prediction and no block ME. We show that for videos with mostly global motion, this encoder performs better than a baseline H.264 encoder with ME block size restricted to 8×8. Furthermore, the quality degradation of this encoder with decreasing bit rate is more gradual than that of the baseline H.264 encoder since it does not need to allocate bits across motion vectors (MVs) and residue data. We also incorporate a spectral entropy based coefficient selection and quantizer design scheme that entails latency and demonstrate that it helps achieve more consistent frame quality across the video sequence.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129262228","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

Using AHP/TOPSIS with cost and robustness criteria for virtual network node assignment 采用AHP/TOPSIS结合成本和鲁棒性准则进行虚拟网络节点分配

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-11-29 DOI: 10.1109/ICC.2012.6364792

R. Goyette, A. Karmouch

引用次数: 2

A decentralized lifetime maximization algorithm for distributed applications in Wireless Sensor Networks 无线传感器网络中分布式应用的分散寿命最大化算法

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-11-29 DOI: 10.1109/ICC.2012.6364620

Virginia Pilloni, M. Franceschelli, L. Atzori, A. Giua

{"title":"A decentralized lifetime maximization algorithm for distributed applications in Wireless Sensor Networks","authors":"Virginia Pilloni, M. Franceschelli, L. Atzori, A. Giua","doi":"10.1109/ICC.2012.6364620","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364620","url":null,"abstract":"We consider the scenario of a Wireless Sensor Networks (WSN) where the nodes are equipped with a programmable middleware that allows for quickly deploying different applications running on top of it so as to follow the changing ambient needs. We then address the problem of finding the optimal deployment of the target applications in terms of network lifetime. We approach the problem considering every possible decomposition of an application's sensing and computing operations into tasks to be assigned to each infrastructure component. The contribution of energy consumption due to the energy cost of each task is then considered into local cost functions in each node, allowing us to evaluate the viability of the deployment solution. The proposed algorithm is based on an iterative and asynchronous local optimization of the task allocations between neighboring nodes that increases the network lifetime. Simulation results show that our framework leads to considerable energy saving with respect to both sink-oriented and cluster-oriented deployment approaches, particularly for networks with high node densities and non-uniform energy consumption or initial battery charge.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129824847","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

Successive zero-forcing DPC with sum power constraint: Low-complexity optimal designs 具有和功率约束的连续零强迫DPC:低复杂度优化设计

2012 IEEE International Conference on Communications (ICC) Pub Date : 2012-11-29 DOI: 10.1109/ICC.2012.6364080

Le-Nam Tran, M. Juntti, M. Bengtsson, B. Ottersten

{"title":"Successive zero-forcing DPC with sum power constraint: Low-complexity optimal designs","authors":"Le-Nam Tran, M. Juntti, M. Bengtsson, B. Ottersten","doi":"10.1109/ICC.2012.6364080","DOIUrl":"https://doi.org/10.1109/ICC.2012.6364080","url":null,"abstract":"Successive zero-forcing dirty paper coding (SZF-DPC) is a simplified alternative to DPC for MIMO broadcast channels (MIMO BCs). In the SZF-DPC scheme, the noncausally-known interference is canceled by DPC, while the residual interference is suppressed by the ZF technique. Due to the ZF constraints, the precoders are constrained to lie in the null space of a matrix. For the sum rate maximization problem under a sum power constraint, the existing precoder designs naturally rely on the singular value decomposition (SVD). The SVD-based design is optimal but needs high computational complexity. Herein, we propose two low-complexity optimal precoder designs for SZF-DPC, all based on the QR decomposition (QRD), which requires lower complexity than SVD. The first design method is an iterative algorithm to find an orthonormal basis of the null space of a matrix that has a recursive structure. The second proposed method, which will be shown to require the lowest complexity, results from applying a single QRD to the matrix comprising all users' channel matrices. We analytically and numerically show that the two proposed precoder designs are optimal.","PeriodicalId":331080,"journal":{"name":"2012 IEEE International Conference on Communications (ICC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127538328","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