2014 IEEE Globecom Workshops (GC Wkshps)最新文献

筛选
英文 中文
MLFS: A multiple layers share file system for cloud computing MLFS:用于云计算的多层共享文件系统
2014 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2014-12-01 DOI: 10.1109/GLOCOMW.2014.7063413
Xiao Zhang, Wan Guo, Zhanhuai Li, Xiaonan Zhao, X. Qin
{"title":"MLFS: A multiple layers share file system for cloud computing","authors":"Xiao Zhang, Wan Guo, Zhanhuai Li, Xiaonan Zhao, X. Qin","doi":"10.1109/GLOCOMW.2014.7063413","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063413","url":null,"abstract":"Cloud computing systems offer computing and storage resources at a low price. The users only pay for it when the VM(short for Virtual Machine) is running. While after VMs shut down, the vendors also need disk space to store multi-gigabyte VM images. Past studies use deduplication to reduce the space requirements, but it needs to calculate hash values of each block and store them. It also causes performance overhead costs to find identical content. In this paper, We propose a multiple layers file sharing system(MLFS) designed for cloud computing. It stores OS data, Application data, and user data in different layers. Multiple users share OS data layers. Application data are constructed according to users' selection, and they are deleted after VM shut down. We compare our solution with ordinary storage systems, storage systems with deduplication, the results show that MLFS can save more space than others, while achieving reasonable performance in file system I/O operating.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122480598","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
A unified approach for representing wireless channels using EM-based finite mixture of gamma distributions 使用基于em的有限混合伽马分布表示无线信道的统一方法
2014 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2014-12-01 DOI: 10.1109/GLOCOMW.2014.7063565
Omar Alhussein, S. Muhaidat, Jie Liang, Paul Yoo
{"title":"A unified approach for representing wireless channels using EM-based finite mixture of gamma distributions","authors":"Omar Alhussein, S. Muhaidat, Jie Liang, Paul Yoo","doi":"10.1109/GLOCOMW.2014.7063565","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063565","url":null,"abstract":"We present a unified framework to evaluate the error rate performance of wireless networks over generalized fading channels. In particular, we propose a new approach to represent different fading distributions by mixture of Gamma distributions. The new approach relies on the expectation-maximization (EM) algorithm in conjunction with the so-called Newton-Raphson maximization algorithm. We show that our model provides similar performance to other existing state-of-art models in both accuracy and simplicity, where accuracy is analyzed by means of mean square error (MSE). In addition, we demonstrate that this algorithm may potentially approximate any fading channel, and thus we utilize it to model both composite and non-composite fading models. We derive novel closed form expression of the raw moments of a dual-hop fixed-gain cooperative network. We also study the effective capacity of the end-to-end SNR in such networks. Numerical simulation results are provided to corroborate the analytical findings.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122735542","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
Dynamic resource allocation for video transcoding with QoS guaranteeing in cloud-based DASH system 基于云的DASH系统中具有QoS保证的视频转码动态资源分配
2014 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2014-12-01 DOI: 10.1109/GLOCOMW.2014.7063421
Yongyi Ran, Youkang Shi, E. Yang, Shuangwu Chen, Jian Yang
{"title":"Dynamic resource allocation for video transcoding with QoS guaranteeing in cloud-based DASH system","authors":"Yongyi Ran, Youkang Shi, E. Yang, Shuangwu Chen, Jian Yang","doi":"10.1109/GLOCOMW.2014.7063421","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063421","url":null,"abstract":"Due to diverse network conditions and heterogeneous devices, there may be various video demands with different video qualities and formats from the client side. Compared to keeping all necessary copies for the same video, video transcoding in real-time should be an essential solution. The complex nature of video transcoding enables cloud computing to be uniquely suitable for dynamically providing transcoding resource. However, due to the fluctuation and uncertainty of the future transcoding demand, it is still a challenge to dynamically determine the optimal resource allocation to save cost while guaranteeing the Quality of Service (QoS). Overload may result in the transcoding jitter and increase the lateness which directly affects video freezes while over-provisioning naturally increases the cost. To address this problem, in this paper, by defining the transcoding jitter probability as a metric of QoS, we proposed a dynamic resource allocation algorithm based on the large deviation principle, which is capable of proactive calculating the optimal number of transcoding nodes for the upcoming transcoding demand subject to the transcoding jitter probability below a desired threshold. Finally, the experiments are performed on a cloud-based prototype system to show the attainable performance of the proposed resource allocation algorithm and verify that the proposed algorithm can make a good tradeoff between cost saving and QoS guaranteeing.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127798437","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
Physical-layer secret key generation with untrusted relays 使用不可信中继生成物理层密钥
2014 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2014-12-01 DOI: 10.1109/GLOCOMW.2014.7063627
C. Thai, Jemin Lee, Chi Cheng, Tony Q. S. Quek
{"title":"Physical-layer secret key generation with untrusted relays","authors":"C. Thai, Jemin Lee, Chi Cheng, Tony Q. S. Quek","doi":"10.1109/GLOCOMW.2014.7063627","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063627","url":null,"abstract":"In this paper, we propose a physical-layer secret key generation scheme for multi-antenna legitimate nodes with the help from multiple untrusted relays with single antenna. The relays' actions conform to the rules but they passively eavesdrop the information. Different from most previous key generation schemes, where a key is generated based on a channel coefficient, in the proposed scheme, we use the linear combination of channel coefficients to generate a key. Simulation results show that the rate leaked to the untrusted relays is low and the secret key rate is therefore high. We also point out that the relay communication can achieve higher secret key rate than the direct communication in several distance ranges.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133907385","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
Jammer placement to partition wireless network 干扰器放置分区无线网络
2014 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2014-12-01 DOI: 10.1109/GLOCOMW.2014.7063644
Jixin Feng, Xin Li, E. Pasiliao, J. Shea
{"title":"Jammer placement to partition wireless network","authors":"Jixin Feng, Xin Li, E. Pasiliao, J. Shea","doi":"10.1109/GLOCOMW.2014.7063644","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063644","url":null,"abstract":"Wireless communication systems are susceptible to jamming attacks, and the use of unmanned vehicles brings new opportunities for coordinated jamming attacks. At the same time, systems of autonomous vehicles that coordinate their movements over a wireless network may be particularly vulnerable to jamming attacks that disrupt the control information. Much research has been conducted on how to efficiently jam single communication links and how to protect such links from jamming. However, less research has focused on problems of jamming attacks on the overall network. In this paper, we consider the problem of determining how to efficiently position jammers so as to partition a wireless network. The communication network is represented as a graph with the vertices representing the radios, and the edges representing the communication links. Although there has been extensive research into the problem of efficiently partitioning a graph via edge separators, the action of a jammer in a wireless network is more closely analogous to blocking reception at one or more radios, which may be modeled as partitioning a graph via node separators. We formulate several optimization problems for jammer placement. Since the optimal solution to these problems are computationally complex, we develop suboptimal solutions using spectral partitioning followed by greedy jammer placement and also a harmony search. The results show that these algorithms offer a tradeoff between complexity and performance. In the scenarios where we were able to compare performance with the optimal solution, the harmony search algorithm offered performance close to that of the optimal solution while requiring a much lower complexity.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"227 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131787032","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}
引用次数: 17
Low-complexity multiuser detection in massive spatial modulation MIMO 大规模空间调制MIMO中的低复杂度多用户检测
2014 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2014-12-01 DOI: 10.1109/GLOCOMW.2014.7063528
Shengchu Wang, Yunzhou Li, Jing Wang, Ming Zhao
{"title":"Low-complexity multiuser detection in massive spatial modulation MIMO","authors":"Shengchu Wang, Yunzhou Li, Jing Wang, Ming Zhao","doi":"10.1109/GLOCOMW.2014.7063528","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063528","url":null,"abstract":"In this paper, we research the multiuser detection (MUD) in a new massive Spatial Modulation Multiple Input Multiple Output (SM-MIMO) system, where the Base Station (BS) is equipped with massive antennas, and every User Equipment (UE) has multiple Transmit Antennas (TAs) but only one Radio-Frequency (RF) chain. In the uplink, UEs transmit data to the BS over frequency selective channels by the Cyclic-Prefix Single-Carrier (CP-SC) SM. We construct a new Generalized Approximate Message Passing Detector (GAMPD), and analyzes its mean square error performance theoretically by the State Evolution (SE) tool. By exploiting both the prior probability distribution and sparsity of the transmitted signal, GAMPD shows superior detection performances and works well even when the number of TAs at the UEs is larger than the number of BS antennas. GAMPD calls for parallelized matrix-vector multiplication as the most complex operation, so it has low computational complexity and is suitable for hardware implementation. Simulation results show that GAMPD outperforms the linear detectors significantly, and is analyzed by SE successfully. In addition, compared to the classical massive MIMO, massive SM-MIMO shows better detection performance and higher spectral efficiency.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115033166","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
Wavelength dependence of a fiber-bundle based FSO link 基于光纤束的FSO链路的波长依赖性
2014 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2014-12-01 DOI: 10.1109/GLOCOMW.2014.7063480
P. Lopresti, N. Hutchins, Steven Kohrmann, M. F. Babelli, H. Refai
{"title":"Wavelength dependence of a fiber-bundle based FSO link","authors":"P. Lopresti, N. Hutchins, Steven Kohrmann, M. F. Babelli, H. Refai","doi":"10.1109/GLOCOMW.2014.7063480","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063480","url":null,"abstract":"A transmitter and receiver design based on the use of fiber optic bundles have been proposed and studied both experimentally in the laboratory and theoretically through simulation, and have shown promise for providing enhanced functionality in mitigating the effects of turbulence and weather on the pointing, acquisition and tracking problem. In this paper, the operation of an FSO link constructed from these designs is analyzed under similar environmental conditions but transmitting at two different wavelengths. A transmitter with a linear fiber array transmitted over a brick surface at either 1310 nm or 1550 nm wavelength to a receiver constructed using a hexagonal array of 19 fibers located 15 feet away. Data at 100 kb/s was transmitted across the link and the collected signal was recorded for off-line statistical analysis, including achieved bit-error rate. The investigation finds that, when eliminating effects due to artifacts in source operation, dependence of link operation on wavelength is minimal, even though the optical alignment was optimized for only 1550 nm.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117155348","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
Clean relaying in cognitive radio networks with variational distance secrecy constraint 变距离保密约束下认知无线网络中的干净中继
2014 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2014-12-01 DOI: 10.1109/GLOCOMW.2014.7063619
Pin-Hsun Lin, Frederic Gabry, R. Thobaben, Eduard Axel Jorswieck, M. Skoglund
{"title":"Clean relaying in cognitive radio networks with variational distance secrecy constraint","authors":"Pin-Hsun Lin, Frederic Gabry, R. Thobaben, Eduard Axel Jorswieck, M. Skoglund","doi":"10.1109/GLOCOMW.2014.7063619","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063619","url":null,"abstract":"In this paper we investigate the cooperative secure communication in a four-node cognitive channel where the secondary receiver is treated as a potential eavesdropper with respect to the primary transmission with variational distance constraint. And the primary user's secrecy rate is required to be unchanged. We propose the clean relaying with the cooperative jamming scheme to achieve this goal, where the secondary transmitter splits its transmitting phase into two non-overlapped intervals after successfully decoding the primary message. Due to the considered secrecy metric, we resort to the information spectrum method, to derive the achievable secrecy rates for the primary user. Then we formulate the secondary user's rate maximization problem over the power allocation and time splitting at the cognitive transmitter under the constraint that primary user's secrecy rate is unchanged. Numerical results show that the secondary transmitter can choose clean relaying or pure cooperative jamming according to the relative positions of the nodes to achieve better performance than the one without any clean phase.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123178515","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}
引用次数: 4
Boosting capacity through small cell data offloading: A comparative performance study of LTE femtocells and Wi-Fi 通过小蜂窝数据卸载提高容量:LTE飞蜂窝和Wi-Fi的性能比较研究
2014 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2014-12-01 DOI: 10.1109/GLOCOMW.2014.7063603
Andra M. Voicu, L. Simić, M. Petrova
{"title":"Boosting capacity through small cell data offloading: A comparative performance study of LTE femtocells and Wi-Fi","authors":"Andra M. Voicu, L. Simić, M. Petrova","doi":"10.1109/GLOCOMW.2014.7063603","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063603","url":null,"abstract":"Due to the significant increase in mobile data traffic volume during the last few years, offloading techniques have been considered for alleviating the traffic load from cellular networks. Two principal small cell offloading solutions are LTE femtocells and Wi-Fi. Femtocells are low power user-deployed LTE base stations that overlay the macro-cellular network and share its licensed spectrum, whereas Wi-Fi devices operate in unlicensed bands using the distributed CSMA/CA MAC protocol to coordinate neighbouring transmissions. Given the fundamentally different spectrum use regulations, MAC, and PHY layer capabilities of these two technologies, the resulting interference environments of the respective small cell networks are significantly different. It is thus not trivially obvious which offloading solution realistically provides a better and future-proof capacity extension for service providers. In this paper we present a thorough system-level comparative study of IEEE 802.1 In Wi-Fi against LTE femtocell performance for a range of representative network densities and deployment scenarios, considering realistic propagation effects, multiple interference sources, and several resource allocation schemes. Our results show that in low density suburban and rural scenarios the high spectral efficiency of LTE femtocells yields a higher throughput than Wi-Fi, but that the CSMA/CA MAC protocol enables Wi-Fi to outperform LTE femtocells in dense urban scenarios, where the need for extra capacity is most urgent. We show that future high density heterogeneous networks may be best served by a new hybrid small cell offloading solution, combining the superior PHY of LTE and the distributed co-tier interference coordination afforded by the MAC of Wi-Fi.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123690414","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
Enable concurrent transmissions with beamforming for broadband wireless access in CSMA/CA-based WLANs 在基于CSMA/ ca的wlan中,通过波束成形实现宽带无线接入的并发传输
2014 IEEE Globecom Workshops (GC Wkshps) Pub Date : 2014-12-01 DOI: 10.1109/GLOCOMW.2014.7063576
Zhaohan Jia, Xin He, F. Li
{"title":"Enable concurrent transmissions with beamforming for broadband wireless access in CSMA/CA-based WLANs","authors":"Zhaohan Jia, Xin He, F. Li","doi":"10.1109/GLOCOMW.2014.7063576","DOIUrl":"https://doi.org/10.1109/GLOCOMW.2014.7063576","url":null,"abstract":"In CSMA/CA based wireless local networks, two stations are not allowed to transmit at the same time due to interference generated to each other, resulting in degraded throughput. Concurrent transmission, which enables simultaneous transmission of two or more stations under certain conditions, is able to overcome this problem, leading to enhanced channel utilization efficiency. Different from earlier work on this topic which focuses on omni-direction concurrent transmission, we introduce in this paper beamforming into a co-channel concurrent transmission scheme and investigate the benefits of concurrency with beamforming. The circumstances for concurrent transmission and frame scheduling are investigated. Simulation results show that the throughput performance achieved by concurrency with beamforming outperforms the traditional transmission and the original omni-directional concurrent transmission.","PeriodicalId":354340,"journal":{"name":"2014 IEEE Globecom Workshops (GC Wkshps)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121071881","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
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学术官方微信