2013 IEEE Global Communications Conference (GLOBECOM)最新文献_第6页

Performance analysis of bit-cooperative coded modulation with turbo codes turbo码位协同编码调制的性能分析

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831671

Ji Zhao, Zhiyong Chen, Bin Xia, Manyuan Shen, Hui Liu

引用次数: 0

Distributed beamforming in multi-cell cooperative MIMO Cellular Networks with non-regenerative relays: An LTE-Advanced framework 具有非再生中继的多小区协同MIMO蜂窝网络中的分布式波束形成:一种LTE-Advanced框架

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831721

Godfrey O. Okeke, W. Krzymień, Y. Jing

{"title":"Distributed beamforming in multi-cell cooperative MIMO Cellular Networks with non-regenerative relays: An LTE-Advanced framework","authors":"Godfrey O. Okeke, W. Krzymień, Y. Jing","doi":"10.1109/GLOCOM.2013.6831721","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831721","url":null,"abstract":"In this paper we study a cellular network, in which multiple-antenna users communicate with multiple-antenna base stations (BSs) through fixed infrastructure-based multiple antenna relay stations (RSs). With cooperation among the BSs and linear processing at the RSs, we aim to find the optimal precoding matrices at the users and the beamforming matrices at the RSs that jointly maximize the system sum rate. Unlike for the conventional uplink (without relays), the sum-rate optimization is non-convex. More so, there is cross-coupling of the RSs' channels due to the forwarded interferences by the RSs. Firstly, we incorporate interference pre-cancelation into the RSs' beamforming designs. Secondly, we match each RS's beamforming matrix to the corresponding backward and forward channels such that the end-to-end channel is diagonalizable. Furthermore, we propose an iterative alternating minimization based algorithm to maximize the system sum rate. Finally, we consider two user-RS scheduling/mapping schemes namely the “random” and “channel-aware” schemes. Simulation results show that the channel-aware scheme outperform the random scheme with the performance gap unchanged with increasing number of antennas at the nodes.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124265725","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

NDNBench: A benchmark for Named Data Networking lookup NDNBench:命名数据网络查找的基准

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831393

Ting Zhang, Yi Wang, Tong Yang, Jianyuan Lu, B. Liu

{"title":"NDNBench: A benchmark for Named Data Networking lookup","authors":"Ting Zhang, Yi Wang, Tong Yang, Jianyuan Lu, B. Liu","doi":"10.1109/GLOCOM.2013.6831393","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831393","url":null,"abstract":"Content-centric Networking (CCN) and the later proposed Named Data Networking (NDN) have attracted wide attention in both academia and industry, as the clean slate future Internet architecture. Wire speed name lookup for packet forwarding is one of the most challenging tasks in CCN/NDN. As a promising technology, its feasibilities including reachable speed, scalability, and update performance are imperative to be deeply evaluated. However, CCN/NDN is currently on its initial stage and no actual network is deployed, which means no real name routing tables and NDN traffic are available. In order to fulfill performance comparisons among various innovative name lookup solutions and facilitate future name lookup researches, we present NDNBench, a publicly available platform for evaluation, comparison and experiments with different name lookup approaches. NDNBench can generate various Forwarding Information Bases (FIBs), traces with structure and size diversity to conduct the tests thoroughly by adjusting the parameters. NDNBench provides a simulation package tool with flexibility to evaluate various name lookup approaches. Furthermore, in order to verify the effectiveness of NDNBench, we benchmark some existing name lookup schemes and the results are very supportive. NDNBench has been applied to recent work and is publicly available at the following site: http://s-router.cs.tsinghua.edu.cn/~zhangting/.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124170529","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}

引用次数: 8

An adaptive routing protocol based on connectivity prediction for underwater disruption tolerant networks 基于连通性预测的水下容错网络自适应路由协议

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831049

Tiansi Hu, Yunsi Fei

{"title":"An adaptive routing protocol based on connectivity prediction for underwater disruption tolerant networks","authors":"Tiansi Hu, Yunsi Fei","doi":"10.1109/GLOCOM.2013.6831049","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831049","url":null,"abstract":"Underwater Sensor Networks (UWSNs) are a desirable networking technique to facilitate various aquatic applications. However, the adverse characteristics of underwater communications and high cost of underwater sensor nodes limit UWSNs to sparse deployment, resulting in intermittent connectivity and therefore calling for techniques for Delay/Disruption Tolerant Networks (DTNs). To cope with disruptions, extra efforts have to be made in the routing protocol to provide transparent and robust end-to-end connections to upper-layer applications. In this paper, we propose a novel adaptive and energy-efficient routing protocol for underwater DTNs. By exploiting underwater node mobility patterns with adaptive filters, sensor nodes are able to estimate future contact events with other nodes in addition to the average contact probabilities over a prediction window. The proposed protocol is based on a distributed machine learning technique, Q-learning, which aims to select the most promising forwarders so as to minimize the end-to-end delay. Extensive simulations of the proposed protocol are carried out, and the results have shown that our protocol yields significantly better network performances and energy efficiency compared to other existing DTN routing protocols.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127762378","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

Data scheduling algorithm for layered P2P VoD streaming networks 分层P2P点播流媒体网络的数据调度算法

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831323

Zheng Wen, K. Yeung, Zhibin Lei

引用次数: 1

Overlay cognitive radio systems with adaptive two-way relaying 用自适应双向中继叠加认知无线电系统

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831194

Amal Hyadi, Elmahdi Driouch, W. Ajib, Mohamed-Slim Alouini

引用次数: 27

Throughput optimal communication strategy for wireless random access channel 无线随机接入信道的吞吐量最优通信策略

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831373

Harpreet S. Dhillon, Howard C. Huang, H. Viswanathan, R. Valenzuela

{"title":"Throughput optimal communication strategy for wireless random access channel","authors":"Harpreet S. Dhillon, Howard C. Huang, H. Viswanathan, R. Valenzuela","doi":"10.1109/GLOCOM.2013.6831373","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831373","url":null,"abstract":"We consider a wireless time-slotted random access channel where user arrivals are characterized by a Poisson process. Each user comes with a fixed payload, which has to be transmitted in the slot in which it arrives. If the transmission is successful, the user leaves the system, else it is dropped. The receiver and users are assumed to have knowledge of the arrival rate λ, but they are not aware of the actual number of users simultaneously attempting to communicate during a given time slot. In contrast to a conventional slotted ALOHA-based strategy where the channel is partitioned into orthogonal subchannels and each user communicates on a randomly chosen subchannel, we propose a novel strategy whereby users transmit simultaneously over the entire channel resource and the receiver jointly decodes the transmissions. Under the proposed strategy, neither users nor the receiver have prior knowledge of the active user set. Our analysis concretely demonstrates that the proposed strategy is optimal in terms of maximizing the average throughput among all uncoordinated strategies. Numerical results show that the proposal provides an order of magnitude throughput improvement compared to slotted ALOHA in a single-cell environment under a 10% maximum outage constraint.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131964980","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

An efficient cross layer design for OFDMA-based wireless networks with channel reuse 基于ofdma的信道复用无线网络的高效跨层设计

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831630

R. Rashtchi, R. Gohary, H. Yanikomeroglu

{"title":"An efficient cross layer design for OFDMA-based wireless networks with channel reuse","authors":"R. Rashtchi, R. Gohary, H. Yanikomeroglu","doi":"10.1109/GLOCOM.2013.6831630","DOIUrl":"https://doi.org/10.1109/GLOCOM.2013.6831630","url":null,"abstract":"This paper considers a joint design that incorporates the physical, medium access and network layers of a generic OFDMA-based wireless network with an ad hoc topology. The network employs channel reuse, whereby a frequency subchannel might be used simultaneously by multiple nodes. In addition to being a source and/or a destination, each node can act as a half-duplex relay to assist other nodes. The design objective is to determine the jointly optimal data routes and subchannel power allocations that maximize a weighted sum of the rates that can be reliably communicated over the network. Assuming that the signals transmitted by the nodes are Gaussian, the joint cross layer design of routing and power allocation is cast as an optimization problem. Unfortunately, this problem is non-convex, and hence difficult to solve. To circumvent this difficulty, an efficient technique based on geometric programming is developed to obtain a local solution that satisfies the Karush-Kuhn-Tucker necessary optimality conditions. Numerical results show that, despite the potential suboptimality of the obtained solution, for some network scenarios, it offers significant gains over optimal scheduling-based schemes in which a frequency band is allowed to be used by one node only at any time instant.","PeriodicalId":233798,"journal":{"name":"2013 IEEE Global Communications Conference (GLOBECOM)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131990515","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

Cognitive MIMO relaying with multiple primary transceivers 具有多个主收发器的认知MIMO中继

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831361

Phee Lep Yeoh, M. Elkashlan, K. Kim, T. Duong, G. Karagiannidis

引用次数: 15

Towards efficient vacant taxis Cruising Guidance 实现高效空车巡航引导

2013 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2013-12-01 DOI: 10.1109/GLOCOM.2013.6831047

Yunfei Hou, Xu Li, Yunjie Zhao, Xiaowei Jia, A. Sadek, K. Hulme, C. Qiao

引用次数: 19