... IEEE Global Communications Conference. IEEE Global Communications Conference最新文献_第5页

Coalition Graph Game for joint relay selection and resource allocation in cooperative cognitive radio networks 协作认知无线网络中联合中继选择与资源分配的联盟图博弈

... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503379

Lanjie Zhai, Hong Ji, Xi Li, Yiwen Tang

{"title":"Coalition Graph Game for joint relay selection and resource allocation in cooperative cognitive radio networks","authors":"Lanjie Zhai, Hong Ji, Xi Li, Yiwen Tang","doi":"10.1109/GLOCOM.2012.6503379","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503379","url":null,"abstract":"Cooperative relaying technology among secondary users (SUs) in cognitive radio networks (CRN) is shown to yield a significant performance improvement, such as improving spectrum utilization as well as system fairness in CRN. This paper investigates the problem of the relay selection and resource allocation in a downlink OFDMA cognitive relay network. The objective of this optimization problem is to maximize both system throughput and system fairness, which is achieved through our proposed non-transferable utility coalition graph game algorithm (NTU-CGGA). In this algorithm, the SUs with more available channels can help SUs with less available channels to improve their utility in terms of the throughput and fairness by forming a directed tree graph. The coalition graph is formatted according to spectrum availability and traffic demands of SUs by using merge-split rule. So it can effectively exploit both space and frequency diversity of the system. Simulation results show that, NTU-CGGA significantly improves system throughput while not reducing the fairness level, which has a better performance comparing with other existing algorithms.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"14 1","pages":"1818-1823"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81211931","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}

引用次数: 15

Bargaining-based spectrum sharing for cognitive radio networks with incomplete information 基于讨价还价的不完全信息认知无线电网络频谱共享

... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503276

X. Tan, Liang Li, Wei Guo

{"title":"Bargaining-based spectrum sharing for cognitive radio networks with incomplete information","authors":"X. Tan, Liang Li, Wei Guo","doi":"10.1109/GLOCOM.2012.6503276","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503276","url":null,"abstract":"To improve the utilization of spectrum resource, a primary network can share its unused bandwidth with a closely located secondary network. As a compensation, the latter should pay a certain price for the obtained bandwidth. To determine this price under the constraint that the primary network only knows an incomplete information for the utility of the secondary network, the present paper consider the repeated offering of a price from the primary network to the secondary network, which then can accept or reject it, until they reach a price agreement. Since this bargaining process helps the primary network estimate the real utility of the secondary network as accurate as possible, the agreed price is mutually beneficial for both networks. Moreover, to increase the satisfaction of all secondary terminals in transmitting heterogeneous applications, i.e., voice, video, image, and data, we also propose a spectrum allocation solution within the secondary network based on Nash bargaining model. Numerical simulation shows that the benefits of the two networks from spectrum sharing varies with their maximal bargaining times and the proposed spectrum allocation scheme can improve the total satisfaction of all secondary terminals while maintain a reasonable fairness among them.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"33 1","pages":"1198-1204"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89315034","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}

引用次数: 6

Verifying cloud Service Level Agreement 验证云服务水平协议

... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503207

Lin Ye, Hongli Zhang, Jiantao Shi, Xiaojiang Du

{"title":"Verifying cloud Service Level Agreement","authors":"Lin Ye, Hongli Zhang, Jiantao Shi, Xiaojiang Du","doi":"10.1109/GLOCOM.2012.6503207","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503207","url":null,"abstract":"In this paper we study the important issue of verifying Service Level Agreement (SLA) in a semi-trusted (or untrusted) cloud. Cloud computing services promise elastic computing and storage resources in a pay-as-you-go way. A SLA between a cloud service provider (CSP) and a user is a contract which specifies the resources and performances that the cloud should offer. However, the CSP has the incentive to cheat on SLA, e.g., providing users with less CPU and memory resources than that specified in the SLA, which allows the CSP to support more users and make more profits. A malicious CSP can disrupt the existing SLA monitoring/verification techniques by interfering the monitoring/measurement process. Therefore, we present a SLA verification framework that leverages a third party auditor (TPA). Under the TPA framework, we propose an effective testing algorithm that can detect SLA violations of physical memory size in virtual machine (VM). Using real experiments, we show that the algorithm can detect cloud cheating on VM memory size (i.e., SLA violations). Furthermore, our algorithm can defend various attacks from a malicious CSP, which tries to hide a SLA violation.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"219 1","pages":"777-782"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73547873","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}

引用次数: 15

Segment training based individual channel estimation for one-way relay network 基于分段训练的单向中继网络独立信道估计

... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503680

Shun Zhang, F. Gao, Changxing Pei, Xiandeng He

引用次数: 0

Sum rate maximization antenna selection via discrete stochastic approximation in MIMO two-way AF relay with imperfect CSI 基于离散随机逼近的不完全CSI MIMO双向AF中继和速率最大化天线选择

... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503490

Gang Liu, Hong Ji, Yi Li, Xiaoliang Zhang

{"title":"Sum rate maximization antenna selection via discrete stochastic approximation in MIMO two-way AF relay with imperfect CSI","authors":"Gang Liu, Hong Ji, Yi Li, Xiaoliang Zhang","doi":"10.1109/GLOCOM.2012.6503490","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503490","url":null,"abstract":"Recently, the MIMO two-way AF relaying, a promising spectral efficient transmission technique, has attracted a great deal of attention. Meanwhile, it has been shown that it is possible to improve the performance of MEMO systems by employing antenna selection technology. Existing antenna selection algorithms in MEMO two-way AF relay assume perfect channel state information(CSI). However, as a matter of fact, it is difficult to obtain perfect CSI. In this paper, considering the antenna correlation and channel estimation error, we derive the lower bound on sum rate utilizing worst case uncorrelated additive noise theorem in MIMO two-way AF relaying system, and analyze the effect of antenna correlation and channel estimation error on the sum rate. Then, an optimal relay antenna selection algorithm based on discrete stochastic optimization is proposed to maximize the sum rate under the assumption of imperfect CSI. We also prove the convergence of the proposed algorithm through theoretical analysis. Through extensive numerical simulation, we observe that the proposed relay antenna selection algorithm converges to the best antenna set obtained by exhaustive search when only imperfect CSI is available.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"7 1","pages":"2487-2492"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85257925","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}

引用次数: 11

Performance of OSTBC transmission in dual-hop amplify-and-forward MIMO relaying systems over spatially correlated Nakagami-m fading channels 空间相关Nakagami-m衰落信道上双跳放大转发MIMO中继系统的OSTBC传输性能

... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503772

Kai Yang, Jie Yang, Liyu Cai

引用次数: 0

Joint channel-network coding with rateless code in two-way relay system 双向中继系统中无速率码联合信道网络编码

... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503819

Yu Zhang, Zhaoyang Zhang, Rui Yin, Guanding Yu, Wei Wang

{"title":"Joint channel-network coding with rateless code in two-way relay system","authors":"Yu Zhang, Zhaoyang Zhang, Rui Yin, Guanding Yu, Wei Wang","doi":"10.1109/GLOCOM.2012.6503819","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503819","url":null,"abstract":"In this paper, we design a joint channel-network coding scheme based on rateless code for the three-stage two-way relay system, where two terminals send messages to each other through a relay between them. Each terminal takes one of the first two stages to encode its message using a Raptor Code and then broadcasts the result into the air, respectively. In the third stage, upon successfully decoding the corresponding messages, the relay node re-encodes them with the new Raptor Codes, and then XORs the outputs and broadcasts the result to both terminals. Together with the packets received directly in previous stages, each terminal then retrieves the desired message using an iterative decoder. Here, the degree profiles of the Raptor Codes used at each node are jointly optimized through solving a set of linear programming problems. Simulations show that, the system throughput achieved by the optimized degree profiles always outperforms the one with conventional degree profile optimized for binary erasure channel (BEC) and the conventional network coding scheme with rateless coding.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"12 1","pages":"4453-4458"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75845206","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}

引用次数: 1

Not every bit counts: A resource allocation problem for data gathering in machine-to-machine communications 不是每个比特都重要:机器对机器通信中数据收集的资源分配问题

... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6504002

Chih-Hua Chang, Hung-Yun Hsieh

{"title":"Not every bit counts: A resource allocation problem for data gathering in machine-to-machine communications","authors":"Chih-Hua Chang, Hung-Yun Hsieh","doi":"10.1109/GLOCOM.2012.6504002","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6504002","url":null,"abstract":"Many applications involving machine-to-machine (M2M) communications are characterized by the large amount of data to transport. To address the “big data” problem introduced by these M2M applications, we argue in this paper that instead of focusing on serving individual machines with better quality, one should focus on solutions that can better serve the data itself. To substantiate this concept, we consider the scenario of data gathering in a wide area by machines that are connected to a central aggregator through direct wireless links. The aggregator has limited radio resources to allocate to machines for uplink transmission of collected data, and hence the problem arises as to how the resources can be effectively utilized for supporting such an M2M application. In contrast to conventional approaches on maximizing the number of machines that can access the radio resources, we investigate an approach that takes into consideration “useful” information content that individual machines can provide for prioritization of resource allocation. Numerical results based on the proposed algorithms show that although the number of machines that can be supported is not maximized, the data so collected at the aggregator does exhibit significant quality gain for the target M2M scenario, thus motivating further investigation along this direction.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"11 1","pages":"5537-5543"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81149113","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

Distributed optimal power control for multicarrier cognitive systems 多载波认知系统的分布式最优功率控制

... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503265

Guanying Ru, Hongxiang Li, Thuan T. Tran, Weiyao Lin, Lingjia Liu, Huasen Wu

引用次数: 3

Hash function mapping design utilizing probability distribution for pre-image resistance 利用概率分布对预像阻力进行哈希函数映射设计

... IEEE Global Communications Conference. IEEE Global Communications Conference Pub Date : 2012-12-01 DOI: 10.1109/GLOCOM.2012.6503221

Jianhua Mo, Xiawen Xiao, M. Tao, Nanrun Zhou

{"title":"Hash function mapping design utilizing probability distribution for pre-image resistance","authors":"Jianhua Mo, Xiawen Xiao, M. Tao, Nanrun Zhou","doi":"10.1109/GLOCOM.2012.6503221","DOIUrl":"https://doi.org/10.1109/GLOCOM.2012.6503221","url":null,"abstract":"Hash functions are often used to protect the integrity of information. In general, the design of hash functions should satisfy three standards: pre-image resistance, second pre-image resistance and collision resistance. The design of hash functions in the literature assumes that the messages to be transmitted are equally probable. In this paper, we focus on the pre-image resistance and investigate the problem of mapping design for hash function utilizing the unequal occurrence probabilities of the messages. We first present a necessary condition for the optimal mapping and then introduce a heuristic algorithm. Simulation experiments are carried out to evaluate the performance of the proposed new design. It is shown that the probability of successful attack can be significantly reduced compared with the conventional design. Our algorithm can be useful in scenarios where the attacker has limited ability or time to estimate the probability distribution of the messages. To our best knowledge, this work is the first attempt of making use of the message distribution in designing hash functions for information security.","PeriodicalId":72021,"journal":{"name":"... IEEE Global Communications Conference. IEEE Global Communications Conference","volume":"68 1","pages":"862-867"},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90294422","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