2016 IEEE Global Communications Conference (GLOBECOM)最新文献

筛选
英文 中文
Using Credit/Debit Card Dynamic Soft Descriptor as Fraud Prevention System for Merchant 基于信用卡/借记卡动态软描述符的商家防欺诈系统
2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7842369
Roy Laurens, C. Zou
{"title":"Using Credit/Debit Card Dynamic Soft Descriptor as Fraud Prevention System for Merchant","authors":"Roy Laurens, C. Zou","doi":"10.1109/GLOCOM.2016.7842369","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7842369","url":null,"abstract":"This paper presents a novel method of using Dynamic Soft Descriptor as a fraud prevention method for Merchant (as opposed to card Issuer) in a credit/debit card transaction under Card Not Present (CNP) environment, such as online transactions. A unique identifier is embedded into the transaction descriptor, which will instantly appear in the cardholder's credit/debit card online statement. By checking his online statement, or calling his credit/debit card bank, a cardholder can obtain this identifier; and then provides the Merchant with this identifier as a proof of access to the statement. As the identifier is propagated using card association's back-end system and as only legitimate cardholder can access the card's statement, it is very unlikely that a fraudster can obtain this identifier information. Unlike other fraud prevention proposals, this proposed method is readily available and can be used right now by Merchant without the need for explicit support from card Issuer. Furthermore, it can be used starting with the very first transaction. So, it is more attractive than ordinary fraud detection method that requires significant amount of transactions. It can be readily deployed under the current card processing infrastructure, and we will show real life result at an e-commerce Merchant.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124923551","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
Capacity Analysis of Massive MIMO on High Altitude Platforms 高空平台大规模MIMO容量分析
2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7841647
Qi Xi, Chen He, Ling-ge Jiang, J. Tian, Yuxiang Shen
{"title":"Capacity Analysis of Massive MIMO on High Altitude Platforms","authors":"Qi Xi, Chen He, Ling-ge Jiang, J. Tian, Yuxiang Shen","doi":"10.1109/GLOCOM.2016.7841647","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841647","url":null,"abstract":"With Massive MIMO installed on High Altitude Platforms (HAPs), capacity analysis is conducted for both sparse users and hotspot users. Sparse users are assumed to follow the Poisson Point Process and their capacities are obtained via the random geometry theorem. For hotspot users, Massive MIMO combined with HAP-based communication is shown to be able to achieve the multiplexing gain thus increase the hotspot capacity. The channel correlation model of UPA under LOS propagations is obtained for users within the hotspot. An upper bound of the correlation function is further derived to show that the correlation between hotspot users can be sufficiently low, resulting in hotspot capacity improvement. The hotspot capacity is affected by location distributions of the scheduled users. Four user location distribution models are considered, which leads to the capacity upper bound, the practical schemes to implement and the capacity estimation method respectively.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"2005 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125835918","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
UPS: Combatting Urban Vehicle Localization with Cellular-Aware Trajectories UPS:用细胞感知轨迹对抗城市车辆定位
2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7842362
Hua Xue, Hongzi Zhu, Siyuan Cao, Shan Chang, Jian Cao
{"title":"UPS: Combatting Urban Vehicle Localization with Cellular-Aware Trajectories","authors":"Hua Xue, Hongzi Zhu, Siyuan Cao, Shan Chang, Jian Cao","doi":"10.1109/GLOCOM.2016.7842362","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7842362","url":null,"abstract":"Acquiring accurate location information of vehicles is of great importance. Global Positioning System (GPS) has been widely deployed and used to be the most convenient solution to outdoor localization. As more and more infrastructure such as elevated roads, tunnels and tall buildings is built, however, the ever-increasing complexity of urban environments makes vehicle localization especially in those urban canyons a new challenging problem. In this paper, we propose a novel scheme, called UPS, to tackle urban vehicle localization problem. Inspired by the observation from empirical study that the Received Signal Strength Indication (RSSI) values of cellular signals (e.g., GSM) perceived over a distance have ideal temporal-spatial characteristics for fingerprinting, UPS refines the location accuracy of a moving vehicle by matching its cellular-aware trajectory, which is an association between consecutive geographical positions and the corresponding wide-band GSM RSSI values, with a pre- constructed map. Moreover, UPS leverages large mobility of vehicles to construct large-scale maps. We implement a prototype system to validate the feasibility of the UPS design. We conduct extensive real-world experiments and results show that UPS can work stably in various urban settings and achieve an accuracy of 4.2 meters on average and 5.3 meters with a 90% precision.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125369041","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
A Reconfigurable High-Performance Optical Data Center Architecture 一种可重构高性能光数据中心体系结构
2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7841539
Chong Liu, Maotong Xu, S. Subramaniam
{"title":"A Reconfigurable High-Performance Optical Data Center Architecture","authors":"Chong Liu, Maotong Xu, S. Subramaniam","doi":"10.1109/GLOCOM.2016.7841539","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841539","url":null,"abstract":"Abstract-Optical data center network architectures are be- coming attractive because of their low energy consumption, large bandwidth, and low cabling complexity. In [1], an AWGR-based passive optical data center architecture (PODCA) is presented. Compared with other optical data center architectures, e.g., DOS [2], Proteus [3], and Petabit [4], PODCA can save up to 90% on power consumption and 88% in cost. Also, average latency can be low as 9 μs at close to 100% throughput. However, PODCA is not reconfigurable and cannot optimize the network topology to dynamic traffic. In this paper, we present a novel, scalable and flexible recon- figurable architecture called RODCA. RODCA is built on and augments PODCA with a flexible localized intra-cluster optical network. With the reconfigurable intra-cluster network, racks with mutually large traffic can be located within the same cluster, and share the large bandwidth of the intra-cluster network. We present an algorithm for DCN topology reconfiguration, and present simulation results to demonstrate the effectiveness of reconfiguration.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126618399","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
Interference Alleviation for Time-Reversal Cloud Radio Access Network 时间反转云无线接入网的干扰抑制
2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7841909
Hang Ma, Beibei Wang, Yan Chen, K. Liu
{"title":"Interference Alleviation for Time-Reversal Cloud Radio Access Network","authors":"Hang Ma, Beibei Wang, Yan Chen, K. Liu","doi":"10.1109/GLOCOM.2016.7841909","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841909","url":null,"abstract":"Due to the unique spatial and temporal focusing effects, time-reversal (TR) communication can be utilized in the cloud radio access network, where it creates a tunneling effect such that the traffic load in the front-haul links can be alleviated in both downlink and uplink. Although the basic TR waveforms are simple to use, they cannot provide the optimal performance in some cases. While the cloud radio access network (C- RAN) is usually expected to serve massive wireless devices, the severe inter-user interference (IUI) might limit the performance of the system. In this paper, we propose to optimize both downlink and uplink transmissions so as to alleviate the interference. In the downlink transmission, optimal content-aware waveform design is proposed so that the baseband units (BBUs) are able to combine both the channel information and the symbol information to suppress the interference. In the uplink transmission, an optimal receiver design algorithm is proposed such that the BBUs can detect the symbols transmitted by the terminal devices (TDs) more accurately by leveraging the channel information. We study the BER performance of the proposed algorithm based on extensive measurements of the wireless channel in a real- world environment. Numerical results demonstrate the significant performance improvement over basic TR transmission techniques.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126716249","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
Hybrid Memory Allocation for Content-Centric Networking 面向内容中心网络的混合内存分配
2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7841880
Teng Liu, A. Abouzeid
{"title":"Hybrid Memory Allocation for Content-Centric Networking","authors":"Teng Liu, A. Abouzeid","doi":"10.1109/GLOCOM.2016.7841880","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841880","url":null,"abstract":"In this work, we study the problem of allocating two types of memory, which have different access speeds, to a set of routers in a single content-centric network. Total network delay is adopted as the performance metric. We first formulate the allocation problem and show that it is NP-hard. Then we prove that this problem is monotone submodular with a matroid constraint. Hence, we are able to derive a guaranteed (1-1/e)- approximation solution when the network is originally stable. We consider tree-structured networks with variable hierarchies under the widely used En-route caching assumption. Simulation results show that the developed algorithm performs well compared to the optimal solution, and only a limited fraction of nodes becomes hybrid regardless of the network size. To the best of our knowledge, this is the first theoretical work on quantitative analysis and algorithm development for hybrid memory allocation for content- centric networking (CCN).","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126744979","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
Secure Full-Duplex Cognitive Relay Networks with Optimal Relay Selection Scheme 基于最优中继选择方案的安全全双工认知中继网络
2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7842251
Nam-Phong Nguyen, C. Kundu, Van-Dinh Nguyen, T. Duong, Lisheng Fan
{"title":"Secure Full-Duplex Cognitive Relay Networks with Optimal Relay Selection Scheme","authors":"Nam-Phong Nguyen, C. Kundu, Van-Dinh Nguyen, T. Duong, Lisheng Fan","doi":"10.1109/GLOCOM.2016.7842251","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7842251","url":null,"abstract":"In this paper, we investigate the secure communication of cognitive full-duplex relay networks in the presence of multiple eavesdroppers and multiple primary receivers. In the considered network, multiple full-duplex relays are deployed to transfer information in the secondary network, under the malicious attempts of non- colluding/colluding eavesdroppers. Meanwhile, the transmit powers of secondary transmitters are constrained by the quality-of-service of the primary network. The optimal relay selection scheme is proposed to enhance the secrecy performance of the considered system. We study the secrecy performance by providing the exact closed- form and asymptotic expressions of the proposed system secrecy outage probability. We have demonstrated that increasing the number of full- duplex relays can improve the security performance. At the illegitimate side, using colluding eavesdroppers and increasing the number of eavesdroppers put information confidentiality at a greater risk. Besides, the transmit power and the desired outage probability of the primary network have great influences on the secrecy outage probability of the secondary network.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126819130","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
Price-Based Resource Allocation in Spectrum-Sharing OFDMA Femtocell Networks 基于价格的频谱共享OFDMA Femtocell网络资源分配
2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7842166
A. Rahmati, V. Shah-Mansouri, D. Niyato
{"title":"Price-Based Resource Allocation in Spectrum-Sharing OFDMA Femtocell Networks","authors":"A. Rahmati, V. Shah-Mansouri, D. Niyato","doi":"10.1109/GLOCOM.2016.7842166","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7842166","url":null,"abstract":"Deployment of femtocells have emerged as a promising technique to address the need for the exponentially increasing mobile traffic demand. They can also improve the capacity and coverage for the indoor wireless users. However, the cross-tier interference in such heterogeneous networks between the femtocells and the macrocells is a design challenge which should be answered before such deployment. In this paper, a spectrum-sharing OFDMA femtocell network is considered in which the macrocell base station protects itself and its users by pricing the interference from femtocell access points. A price-based resource allocation is formulated as a Stackelberg game model to jointly maximize the revenue of the macrocell and the utility of the femtocell users (FUEs) while a predetermined tolerable cross-interference constraint at the macrocell is met. In the proposed model, the macrocell determines the subchannel assignment and the interference prices for the FUEs. Then, the FUEs choose their optimal downlink power. To find the Stackelberg equilibrium, the optimization problems of the leader and the followers are solved. For the followers' sub-game, a closed form expression is obtained. To find the leader's sub-game solution, the non-convex mixed integer nonlinear (MINLP) problem is first converted to an equivalent convex MINLP. Then, we employ the outer approximation (OA) to iteratively and efficiently solve the leader problem. The numerical results validate the convergence of the OA algorithm and the operation of our price-based scheme.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127023326","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
Rate-Achieving Policy in Finite-Horizon Throughput Region for Multi-User Interference Channels 多用户干扰信道有限视界吞吐量区域的速率实现策略
2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7842198
Yirui Cong, Xiangyun Zhou, R. Kennedy
{"title":"Rate-Achieving Policy in Finite-Horizon Throughput Region for Multi-User Interference Channels","authors":"Yirui Cong, Xiangyun Zhou, R. Kennedy","doi":"10.1109/GLOCOM.2016.7842198","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7842198","url":null,"abstract":"This paper studies a wireless network consisting of multiple transmitter-receiver pairs sharing the same spectrum where interference is regarded as noise. Previously, the throughput region of such a network was characterized for either one time slot or an infinite time horizon. This work aims to close the gap by investigating the throughput region for transmissions over a finite time horizon. We derive an efficient algorithm to examine the achievability of any given rate in the finite-horizon throughput region and provide the rate-achieving policy. The computational efficiency of our algorithm comes from the use of A* search with a carefully chosen heuristic function and a tree pruning strategy. We also show that the celebrated max-weight algorithm which finds all achievable rates in the infinite-horizon throughput region fails to work for the finite-horizon throughput region.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115077415","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
Backscatter Communications over Ambient OFDM Signals: Transceiver Design and Performance Analysis 基于环境OFDM信号的反向散射通信:收发器设计与性能分析
2016 IEEE Global Communications Conference (GLOBECOM) Pub Date : 2016-12-01 DOI: 10.1109/GLOCOM.2016.7841620
Gang Yang, Ying-Chang Liang
{"title":"Backscatter Communications over Ambient OFDM Signals: Transceiver Design and Performance Analysis","authors":"Gang Yang, Ying-Chang Liang","doi":"10.1109/GLOCOM.2016.7841620","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841620","url":null,"abstract":"Ambient backscatter communications (AmBC) enables radio-frequency (RF) powered devices (e.g., tags, sensors) to modulate their information bits over ambient RF carriers in an over-the-air manner. This system, called ``modulation in the air'', thus has emerged as a promising technology for green communications and future Internet-of-Things. This paper studies the AmBC system over ambient orthogonal frequency division multiplexing (OFDM) carriers in the air. We first establish the system model for such AmBC system from spread-spectrum perspective, from which a novel joint design for tag waveform and reader detector is proposed. We construct the test statistic that cancels out the direct-link interference by exploiting the repeating structure of the ambient OFDM signals due to the use of cyclic prefix. The maximum-likelihood detector is proposed to recover the tag bits, for which the optimal threshold is obtained with closed-form expression. Also, we analyze the effect of various system parameters on the transmission rate and detection performance. Finally, extensive numerical results show that the proposed transceiver design outperforms the conventional design.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116014762","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}
引用次数: 54
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学术官方微信