{"title":"Towards a Range-Enhanced and Spectrum-Friendly G.fast","authors":"D. Henao, J. Louveaux, G. Maierbacher","doi":"10.1109/GLOCOM.2016.7842337","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7842337","url":null,"abstract":"The first standardized version of G.fast has been conceived to provide gigabit internet access from the distribution point (DP). Low transmit levels along its operational frequency range and low maximum aggregate transmit power (MAXATP) have been specified to restrict its electromagnetic emissions and enable the use of power available at customer premises to feed its access systems. Power constraints and a maximum bit-constellation size(Bmax=12 bits) limit its coverage and data rates, which could discourage service providers to deploy G.fast. This work analyzes different strategies that could be potentially pursued to enhance its coverage and improve its spectral compatibility with VDSL2 systems. We carry out an extensive simulation study to evaluate a) capacity boundaries of current G.fast systems; b benefits of increasing MAXATP, Bmax and power spectrum density (PSD) mask levels; and c) spectral shaping as means to improve G.fast compatibility. Our simulation results show that increasing MAXATP and Bmax boosts data rates and coverage in short loop scenarios, whereas improvements in long loops performance are only determined by MAXATP. Since such modifications generally increase the interference on legacy systems, we propose to perform power back-off (PBO) in order to improve G.fast spectrum-compatibility. As a proof of concept we adopt the PBO from VDSL2 with a fixed parameter set. Although clearly not optimized for the combination of TDD G.fast and FDD legacy systems and despite the simplicity of the adopted approach, our results indicate that spectral shaping can be an effective means to turn G.fast into a more spectrum-friendly system.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"26 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":"122373959","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}
S. Errapotu, Jingyi Wang, Zaixin Lu, Wei Li, M. Pan, Zhu Han
{"title":"Bidding Privacy Preservation for Dynamic Matching Based Spectrum Trading","authors":"S. Errapotu, Jingyi Wang, Zaixin Lu, Wei Li, M. Pan, Zhu Han","doi":"10.1109/GLOCOM.2016.7841629","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841629","url":null,"abstract":"Spectrum trading benefits secondary users (SUs) with accessing opportunities and primary users (PUs) with monetary gains in cognitive radio networks. In the spectrum trading market, bidding privacy is a serious concern for SUs, since untrustworthy PUs or spectrum traders may leverage bidding information to manipulate the trading or leak SU's bids to other SU competitors for illegal gains. Current centralized privacy preserving spectrum trading designs may incur extra infrastructure deployment, miss many instantaneous spectrum accessing opportunities, and have scalability issues. In this paper, we propose a novel privacy-preserving semi-distributed spectrum trading scheme, which has joint consideration of spectrum reuse, SUs' bidding privacy preservation, and PUs' revenue maximization. We use the conflict graph to characterize SUs' interference relationships, and jointly employ the Paillier Cryptosystem and dynamic matching with evolving preferences to conduct the privacy-preserving spectrum trading in a semi-distributed manner. Through security, complexity and performance analysis, we show that the proposed scheme can effectively preserve the privacy of SUs' bidding values, and notably increase the PUs' revenue and improve spectrum utilization with limited overhead.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"134 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":"122820364","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}
{"title":"Location Privacy of Non-Stationary Incumbent Systems in Spectrum Sharing","authors":"Pradeep Reddy Vaka, Sudeep Bhattarai, J. Park","doi":"10.1109/GLOCOM.2016.7841962","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841962","url":null,"abstract":"Although using geolocation databases for spectrum sharing has many pragmatic advantages, it also raises potentially serious operational security (OPSEC) issues. OPSEC is especially a paramount consideration in the light of recent calls in the U.S. for spectrum sharing between federal government (including military) systems and non- government systems (e.g., cellular service providers). In this paper, we explore the OPSEC, location privacy in particular, of incumbent radars in the 3.5 GHz band. First, we show that adversarial secondary users can easily infer the locations of incumbent radars by making seemingly innocuous queries to the database. Then, we propose several obfuscation techniques that can be implemented by the database for countering the inference attacks. We also investigate the inherent tradeoff between the degree of obfuscation and spectrum utilization efficiency. Finally, we validate our discussions by providing results from extensive simulations.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"27 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":"114601153","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}
Vitor Barbosa C. Souza, X. Masip-Bruin, E. Marín-Tordera, W. Ramírez, S. Sánchez-López
{"title":"Towards Distributed Service Allocation in Fog-to-Cloud (F2C) Scenarios","authors":"Vitor Barbosa C. Souza, X. Masip-Bruin, E. Marín-Tordera, W. Ramírez, S. Sánchez-López","doi":"10.1109/GLOCOM.2016.7842341","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7842341","url":null,"abstract":"The novel Fog-to-Cloud (F2C) computing paradigm has been recently proposed aiming at the enhanced integration of Fog Computing and Cloud Computing through the coordinated management of underlying resources, taking into account the peculiarities inherent to each computing model, and enabling the parallel and distributed execution of services into distinct fog/cloud resources. Nevertheless, studies on F2C are still premature and several issues remain unsolved yet. For instance, in an F2C scenario service allocation must cope with the specific aspects associated to cloud and fog resource models, requiring distinct strategies to properly map IoT services into the most suitable available resources. In this paper, we propose a QoS-aware service distribution strategy contemplating both service requirements and resource offerings. We model the service allocation problem as a multidimensional knapsack problem (MKP) aiming at an optimal service allocation taking into consideration delay, load balancing and energy consumption. The presented results, demonstrate that the adopted strategy may be applied by F2C computing reducing the service allocation delay, while also diminishing load and energy consumption on cloud and fog resources.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"10 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":"122205613","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}
{"title":"Learning Automata-Based Channel Reservation Scheme to Enhance QoS in Vehicular Adhoc Networks","authors":"V. Saritha, P. V. Krishna, S. Misra, M. Obaidat","doi":"10.1109/GLOCOM.2016.7841949","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841949","url":null,"abstract":"The very high mobility of the nodes in Vehicular Adhoc Networks (VANET) increases the rate at which the handoff occurs. This motivates researchers to investigate the novel strategies for channel allocation such that the handoff becomes transparent. At the same time the utilization of the channels need to be effective in order to enhance the QoS. Hence this paper proposes a channel reservation procedure based on learning automata and node speed to improve the QoS in VANET. Channel reusability technique is incorporated to make the efficient usage of channels. The percentage of dropped calls and handoff latency are used as metrics to evaluate the proposed method.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"11 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":"116848982","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}
{"title":"QoS-Aware VNF Placement Optimization in Edge-Central Carrier Cloud Architecture","authors":"F. Jemaa, G. Pujolle, Michel Pariente","doi":"10.1109/GLOCOM.2016.7842188","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7842188","url":null,"abstract":"Cloud computing and Network Function Virtualization (NFV) represent together a promising solution for wireless network operators to improve business agility and cope with the continuing growth in data traffic. Furthermore, the use of edge clouds in association with a centralized cloud, referred to as the edge-central cloud, notably improves user experience while ensuring scalability and load balancing. In such carrier cloud environment, efficient management mechanisms for the Virtualized Network Functions (VNFs) are of crucial importance. In this paper, we introduce VNF placement and provisioning optimization strategies over an edge- central carrier cloud infrastructure taking into account Quality of Service (QoS) requirements (i.e., response time, latency constraints and real-time requirements) and using queuing and QoS models. Our main design goals are to optimize resource utilization, to prevent cloudlet overload, and to avoid violation of Service Level Agreement (SLA) requirements. Through extensive simulations, we show how a trade-off can be achieved between these conflicting objectives.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"3 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":"117097942","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}
Zohair Abu-Shaban, H. Wymeersch, Xiangyun Zhou, G. Seco-Granados, T. Abhayapala
{"title":"Random-Phase Beamforming for Initial Access in Millimeter-Wave Cellular Networks","authors":"Zohair Abu-Shaban, H. Wymeersch, Xiangyun Zhou, G. Seco-Granados, T. Abhayapala","doi":"10.1109/GLOCOM.2016.7842197","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7842197","url":null,"abstract":"The utilization of the millimeter-wave frequency band (mm-wave) in the fifth generation ({5G}) of mobile communication is a highly-debated current topic. Mm-wave MIMO systems will use arrays with large number of antennas at the transmitter and the receiver, implemented on a relatively small area. With the inherent high directivity of these arrays, algorithms to help the user equipment find the base station and establish a communication link should be carefully designed. Towards that, we examine two beamforming schemes, namely, random-phase beamforming (RPBF) and directional beamforming (DBF), and test their impact on the Cram'er-Rao lower bounds (CRB) of jointly estimating the direction-of-arrival, direction-of-departure, time-of-arrival, and the complex channel gain, under the line-of-sight channel model. The results show that the application of RPBF is more appropriate in the considered scenario as it attains a lower CRB with fewer beams compared to DBF.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"35 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":"129463813","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}
V. Sulli, D. Giancristofaro, F. Santucci, M. Faccio
{"title":"An Analytical Method for Performance Evaluation of Digital Transparent Satellite Processors","authors":"V. Sulli, D. Giancristofaro, F. Santucci, M. Faccio","doi":"10.1109/GLOCOM.2016.7841581","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841581","url":null,"abstract":"Current perspectives for satellite communications are massively envisaging the introduction of a new generation of satellites based on semi-transparent transponder architectures. In this frame, technological constraints related to the development and implementation of novel payloads, that include significant on-board digital processing, call for careful system modeling and accurate digital hardware design in order to enable feasible trade-offs between hardware efficiency and overall link-budget performance. In this perspective, the present paper proposes a system model and a theoretical framework that include the following steps: i) fine characterization of the causes of non ideal behavior in all stages of a digital on-board processor, with definition of equivalent noise sources for the various blocks and derivation of their parameters, namely the noise figure and the noise temperature; ii) extension of the typical link-budget approach to incorporate contributions of the on-board digital segments. Numerical results are provided to validate the accuracy of approximations introduced in analytical modeling of the various blocks; a comparison with results obtained through C based Monte Carlo simulation is provided. Then a set of results are reported to illustrate - in a real satellite link design example - how the model can support advanced trade-offs that are of primary interest in the design of next generation satellite transponders, e,g. those based on translucent processors (digital transparent).","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"36 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":"128357941","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}
{"title":"A Fuzzy Support Vector Machine Algorithm for Cooperative Spectrum Sensing with Noise Uncertainty","authors":"Yu-Di Huang, Ying-Chang Liang, Gang Yang","doi":"10.1109/GLOCOM.2016.7841503","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841503","url":null,"abstract":"In cognitive radio networks, the performance of energy detection will be degraded significantly due to the cluster overlapping caused by noise uncertainty. To alleviate the noise uncertainty effect, a novel machine learning algorithm is proposed in this paper for cooperative spectrum sensing. The proposed algorithm incorporates fuzzy support vector machine and nonparallel hyperplane support vector machine. For membership assignment, kernel shadow c-means (KSCM) algorithm is utilized. Furthermore, the test statistics collected by the second users are arranged into a feature vector instead of being combined through weighted sum. Simulations results have shown that the proposed scheme, called NP-FSVM, is more robust to noise uncertainty than the existing methods.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"1 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":"128721733","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}
{"title":"Resource Management for Optical Interconnects in Data Centre Networks","authors":"D. P. Van, M. Fiorani, L. Wosinska, Jiajia Chen","doi":"10.1109/GLOCOM.2016.7842226","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7842226","url":null,"abstract":"This paper deals with resource management in data centre networks that feature optical interconnects. It first proposes an optical resource management framework as a platform to develop different solutions for multipoint-to-multipoint optical communication systems with a centralized controller. The paper takes optical intra-rack communications as an example application scenario of the framework and studies the intra-rack scheduling (IRS) problem using a theoretical approach. The problem is mapped into the classical open-shop scheduling problem, in which the optical interfaces are viewed as the jobs and the wavelengths used for communication among the interfaces are viewed as the machines. The IRS problem can therefore be solved by adopting the existing preemptive and/or non-preemptive open-shop scheduling algorithms. In a realistic intra-rack communication scenario with non-negligible network reconfiguration time, it is important to understand whether the preemptive or non-preemptive strategy provides better performance under given traffic conditions and system configurations. To address the question, this paper presents a performance analysis that allows to quantitatively compare the two scheduling strategies in terms of packet delay and potential energy savings obtained from sleep mode implementation. Analytical results reveal that the non-preemptive strategy outperforms the preemptive one for typical configurations used in data centre networks. In addition, the tuning and wake-up times of optical transceivers are shown to be key performance-determining factors. The proposed framework and obtained findings are not limited to the considered intra-rack communication scenario, but can be applied to any centralized optical switching systems featuring multipoint-to-multipoint transmissions with non-negligible reconfiguration time.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"45 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":"128727223","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}