... IEEE Global Communications Conference. IEEE Global Communications Conference最新文献

筛选
英文 中文
Resource allocation for OFDM multiple-access relay channels with network coding 带网络编码的OFDM多址中继信道资源分配
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503861
B. Han, Zhongyuan Zhao, M. Peng, Yong Li, Wenbo Wang
{"title":"Resource allocation for OFDM multiple-access relay channels with network coding","authors":"B. Han, Zhongyuan Zhao, M. Peng, Yong Li, Wenbo Wang","doi":"10.1109/GLOCOM.2012.6503861","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503861","url":null,"abstract":"Joint scheduling and resource allocation in uplink orthogonal frequency division multiplexing (OFDM) systems is complicated, and even gets intractable with large subcarrier and user number. This paper investigates the resource allocation for OFDM-based multi-user multiple-access relay channels (MARC) with network coding. We formulate a joint optimization problem considering source pairing, subcarrier assignment, subcarrier pairing and power allocation to maximize the sum-rate under per-user power constraint. The problem is addressed in polynomial time by optimizing three separate subproblems, and afterwards three low-complexity suboptimal algorithms are further proposed. The simulation results demonstrate performance gain of the proposed algorithms versus per-node transmit power and source nodes number, respectively.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"40 1","pages":"4701-4706"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79732231","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
Adaptive joint nonlinear transmit-receive processing for multi-cell MIMO networks 多小区MIMO网络的自适应联合非线性收发处理
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503703
Liang Sun, M. Lei
{"title":"Adaptive joint nonlinear transmit-receive processing for multi-cell MIMO networks","authors":"Liang Sun, M. Lei","doi":"10.1109/GLOCOM.2012.6503703","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503703","url":null,"abstract":"This paper considers signal processing algorithms for the downlink coordinated multi-point multiple-input multiple-output (MIMO) systems with multiple-antenna users. A novel adaptive joint nonlinear transmit-receive processing algorithm is proposed based on zero-forcing (ZF) criterion. In this algorithm, a block successive ZF precoding is first applied at the multiple base stations to pre-cancel partial multiuser interference. Then nonlinear Tomlinson-Harashima precoding is applied to further reduce interference between the data streams of other users and the other data streams of the same user, whereas linear equalization and modulo operation are applied at each user. We first show that the proposed joint nonlinear transmit-receive processing algorithm effectively decomposes the multiuser MIMO channel into parallel independent single-user MIMO channels. Different from the method in [1], our proposed algorithm allows the number of sub-channels of each user to be arbitrary number no more than the rank of that user's equivalent channel, and then for the given set of the numbers of sub-channels and the given power allocation of all users, closed-form expressions of the transmit and receive processing matrices are derived to optimize the output signal to interference plus noise ratio of each user. Subsequently, an adaptive method is proposed to adapt the number of sub-channels according to the fading of the users' channel matrices (termed as adaptive algorithm). Simulation results show that the proposed algorithm achieves much better throughput performance than the processing methods in the literature, such as the non-adaptive nonlinear preprocessing algorithm in [1] and the known block diagonalization techniques.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"38 1","pages":"3766-3771"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88308892","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}
引用次数: 7
Improving content availability by request-adaptive incentive in private peer-to-peer communities 在私有点对点社区中通过请求自适应激励提高内容可用性
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503526
Honglei Jiang, Song Guo, Deze Zeng, Hai Jin
{"title":"Improving content availability by request-adaptive incentive in private peer-to-peer communities","authors":"Honglei Jiang, Song Guo, Deze Zeng, Hai Jin","doi":"10.1109/GLOCOM.2012.6503526","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503526","url":null,"abstract":"Recently, BitTorrent (BT) communities are rapidly evolving towards Private Torrent (PT) sites. The efficiency of such content sharing system depends on how well it can satisfy the requirements of users. The traditional way to improve usability is to make users extend their seeding duration by incentives like Share Ratio Enforcement (SRE). However, our measurement-based studies show its inefficiency in meeting various download requests from users. For example, some available contents have not been requested for long and some requests are not available, recognized as the “available but no request” and “request but not available” problems respectively. To make the content availability match users' download demands, we propose new incentive polices that only reward the seeding behaviors for needed torrents. This is achieved by providing users the rewarding information of seeding various contents that vary based on their interests and timeliness to the community. Our trace-driven simulation result shows the proposed “Max Cost Interval” and “Max Time Interval” policies can significantly improve the content over existing policies in a more cost-efficient way.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"17 1","pages":"2708-2713"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78600448","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
Threat mitigation in tactical-level disruption tolerant networks 战术级容错网络中的威胁缓解
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503243
Weihan Goh, C. Yeo
{"title":"Threat mitigation in tactical-level disruption tolerant networks","authors":"Weihan Goh, C. Yeo","doi":"10.1109/GLOCOM.2012.6503243","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503243","url":null,"abstract":"In disruption tolerant networks (DTNs), nodes exchange beacon messages to set up links via a process known as neighbor discovery. However as it is, beacon messages are susceptible to forgery and tampering that could be exploited to attack and participate in the network. This paper outlines a protocol to 1) protect beacon messages in tactical-level DTNs from forgery and tampering utilizing an identity-based signature scheme (IBS), and 2) provide capabilities for nodes that are compromised or captured to signal its state discreetly to other DTN nodes. The protocol maintains the same amount of message overhead as without it.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"1 1","pages":"997-1003"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77530342","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
Clique partition based relay placement in WiMAX mesh networks WiMAX网状网络中基于团分区的中继放置
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503503
Zhuofan Liao, Jianxin Wang, Shigeng Zhang, Jiannong Cao
{"title":"Clique partition based relay placement in WiMAX mesh networks","authors":"Zhuofan Liao, Jianxin Wang, Shigeng Zhang, Jiannong Cao","doi":"10.1109/GLOCOM.2012.6503503","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503503","url":null,"abstract":"In WiMAX mesh networks based on IEEE 802.16j, when transmission power of the base station (BS) and the number of radios and channels are settled, data rate at the subscriber (SS) is decided by the distance between the SS and its uplink relay station (RS). In this paper, we study the problem of deploying a minimum number of RSs to satisfy all SSs' distance requirements. Firstly, we translate it into a minimum clique partition problem, which is NP-complete. Based on SSs' neighbor information and location information, we then propose two heuristic algorithms based on clique partition, named as MAXDCP and GEOCP, respectively. Simulation results show that, compared with the state-of-the-art MIS and HS algorithms, MAXDCP uses 23.8% fewer relays than MIS with the same time complexity, and GEOCP uses 35% fewer relays than MIS in the same time and 18.5% fewer relays than HS in much less time.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"107 1","pages":"2566-2571"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77631371","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
A two-layer intra-domain routing scheme for named data networking 面向命名数据网络的两层域内路由方案
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503543
Huichen Dai, Jianyuan Lu, Yi Wang, B. Liu
{"title":"A two-layer intra-domain routing scheme for named data networking","authors":"Huichen Dai, Jianyuan Lu, Yi Wang, B. Liu","doi":"10.1109/GLOCOM.2012.6503543","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503543","url":null,"abstract":"Routing is undoubtedly the foundation of NDN's data transmission service. We propose a two-layer routing protocol for NDN [1], [2], which is composed of a Topology Maintaining (TM) layer and a Prefix Announcing (PA) layer. The underlying layer (TM) maintains the full topology of an NDN network domain and calculates the shortest-path trees. The upper layer (PA) provides content in two ways: active publishing and passive serving. However, solely adopting either of them will lead to the problem of scalability. We compare the efficiency and cost of the two methods, and evaluation results show that active publishing is much more efficient than the passive serving method in terms of triggered traffic, but actively publishing all the content will lead to Forwarding Information Base (FIB) explosion. Therefore, we further propose a popularity-based active publishing policy and arrive at a compromise between the active and passive methods. Moreover, we put forward several methods to aggregate FIB entries, and the FIB size shrinks effectively after aggregation. This routing protocol is compliant with the NDN characteristics and supports NDN multipath routing.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"138 6 1","pages":"2815-2820"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83934171","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}
引用次数: 23
Linear programming based joint detection of LDPC coded MIMO systems 基于线性规划的LDPC编码MIMO系统联合检测
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503749
Yong Li, L. Wang, Z. Ding
{"title":"Linear programming based joint detection of LDPC coded MIMO systems","authors":"Yong Li, L. Wang, Z. Ding","doi":"10.1109/GLOCOM.2012.6503749","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503749","url":null,"abstract":"In this work1, we present a new multiple-input-multiple-output (MIMO) receiver that integrates the MIMO signal detection and the decoding of low density parity check coded data. This joint MIMO detector and decoder utilizes linear programming and achieves about 9.0 dB gain over existing works in terms of bit error rate (BER) of 4 × 10−5 with comparable computational complexity. The proposed detector also outperforms the classic turbo equalizer by achieving up to 4.0 dB improvement over turbo equalizer at frame error rate (FER) of 1 × 104. In fact, we can achieve further gain by improving the proposed joint detector through the use of redundant parity checks.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"17 1","pages":"4043-4048"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75857553","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
AMVSC: A framework of adaptive mobile video streaming in the cloud AMVSC:云中的自适应移动视频流框架
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503416
Min Chen
{"title":"AMVSC: A framework of adaptive mobile video streaming in the cloud","authors":"Min Chen","doi":"10.1109/GLOCOM.2012.6503416","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503416","url":null,"abstract":"While demands on video traffic over mobile networks have been souring, the wireless link capacity cannot keep up with the traffic demand. The gap between the traffic demand and the link capacity, along with time-varying link conditions, results in poor service quality of video streaming over mobile networks such as long buffering time and intermittent disruptions. Leveraging the cloud computing technology, we propose a new mobile video streaming framework, dubbed AMVSC, which constructs a private agent at the cloud to provide video streaming services efficiently for each mobile user. For a given user, AMVSC lets her private agent adaptively adjust her streaming flow with a scalable video coding technique based on the feedback of link quality. We implement a prototype of the AMVSC framework to demonstrate its performance. It is shown that the private agents in the clouds can effectively provide the adaptive streaming.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"102 1","pages":"2042-2047"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74430370","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}
引用次数: 41
Multidimensional resource allocation strategy for high-speed railway MIMO-OFDM system 高速铁路MIMO-OFDM系统的多维资源分配策略
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503351
Yisheng Zhao, Xi Li, Xiaoliang Zhang, Yi Li, Hong Ji
{"title":"Multidimensional resource allocation strategy for high-speed railway MIMO-OFDM system","authors":"Yisheng Zhao, Xi Li, Xiaoliang Zhang, Yi Li, Hong Ji","doi":"10.1109/GLOCOM.2012.6503351","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503351","url":null,"abstract":"With the wide deployment of high-speed railway at more than 300 kilometers per hour, providing various services effectively for users in the train becomes both practical demand and interesting challenge for wireless communication. Resource allocation problem in high-speed railway communication system is one of the key issues to improve the efficiency of resource utilization. In this paper, we propose a multidimensional resource allocation strategy for high-speed railway downlink orthogonal frequency-division multiplexing (OFDM) system with multiple-input multiple-output (MIMO) antennas. Sub-carrier, antenna, time slot, and power are considered jointly, which is modeled as a nonlinear integer programming problem. The effect of the moving speed on inter-carrier interference is analyzed to calculate the transmitted power. The objective is to minimize the total transmitted power while satisfying quality of service requirement of each user. Moreover, optimal and approximate solutions are obtained by linearization and quadratic fitting, respectively. Simulation results have proved that approximate solution has lower total transmitted power than optimal solution while the computation complexity is higher.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"67 ","pages":"1653-1657"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/GLOCOM.2012.6503351","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72426025","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}
引用次数: 18
Two-dimensional cyclic codes correcting known error patterns 校正已知错误模式的二维循环码
... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503612
Sung Whan Yoon, J. Moon
{"title":"Two-dimensional cyclic codes correcting known error patterns","authors":"Sung Whan Yoon, J. Moon","doi":"10.1109/GLOCOM.2012.6503612","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503612","url":null,"abstract":"This paper considers error-correcting codes designed to correct a finite set of known two-dimensional (2D) error patterns that can occur in a 2D array of bits. Obvious applications for this type of codes include storage and display devices. The specific codes designed in this paper are cyclic codes that can correct any single occurrences of dominant known error patterns that can occur anywhere in the 2D array. As example codes, rate-0.994 codes are constructed which target eight known 2D error patterns in a 63 × 63 bit array.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"34 1","pages":"3231-3236"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81309816","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书