Valentin Del Piccolo, Ahmed Amamou, Bruno Vidalenc, M. Bouet, K. Haddadou
{"title":"Design and Analysis of a TRILL - OpenFlow Bridge","authors":"Valentin Del Piccolo, Ahmed Amamou, Bruno Vidalenc, M. Bouet, K. Haddadou","doi":"10.1109/GLOCOM.2016.7841728","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841728","url":null,"abstract":"Cloud computing is expected to keep growing and therefore more and more data centers are being built. In parallel of this increasing amount of data centers, there are also more cloud providers. On one side, this heterogeneity in the cloud market allows a user to choose and change its cloud provider. On the other side, thanks to this growing number of cloud providers, it is now possible to have small cloud providers forming a cloud federation. This way, they can mutualize their resources in order to accommodate their clients and compete with bigger cloud providers. However, solutions are needed to interconnect data centers. Those solutions must allow a cloud provider to interconnect its data centers to other cloud providers' one. This interconnection must be achieved even if the data centers do not use the same technology. This is the problem we focus on in this paper and we propose a solution to interconnect a TRILL data center with an OpenFlow one. We design and implement this solution in order to analyze its impact on both throughput and latency. Concerning the latency, we found that our solution increases it by 3% compared to the OpenFlow solution. Throughput-wise, we have an 8% lower throughput than TRILL.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131995383","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}
M. Khoshkholgh, A. Haghighi, K. Navaie, K. Shin, Victor C. M. Leung
{"title":"Exploiting Quantization Uncertainty for Enhancing Capacity of Limited-Feedback MISO Ad Hoc Networks","authors":"M. Khoshkholgh, A. Haghighi, K. Navaie, K. Shin, Victor C. M. Leung","doi":"10.1109/GLOCOM.2016.7841830","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841830","url":null,"abstract":"In this paper we investigate the capacity of random wireless networks in which transmitters are equipped with multiantennas. A quantized version of channel direction information (CDI) is also available, provided by the associated single antenna receivers. We adopt tools of stochastic geometry and random vector quantization to incorporate the impacts of interference and quantization errors, respectively. We first study the capacity of Aloha, and channel quality information (CQI)-based scheduling, whereby the transmissions decision in each transceiver pair depends on the strength of the CQI against a prescribed threshold. We then propose a new scheduling scheme, namely modified CQI (MCQI), by which the quantization error is effectively incorporated in the scheduling. Further we obtain the capacity of MCQI-based scheduling. Simulation results confirm our analysis and show that the proposed MCQI-based scheduling improves the capacity compared to the CQI-based scheduling and Aloha. It is also seen that the performance boost is more significant where the feedback capacity is low and the network is dense. In comparison with the case of high feedback capacity, the network capacity is not reduced by low feedback capacity in the MCQI-based scheduling. This is of practical importance since the network designer can save the feedback resources by employing MCQI-based scheduling without compromising the capacity and increasing the receivers' complexity.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126472358","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":"STRIVE: Socially-Aware Three-Tier Routing in Information-Centric Vehicular Environment","authors":"J. Khan, Y. Ghamri-Doudane","doi":"10.1109/GLOCOM.2016.7842301","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7842301","url":null,"abstract":"Content distribution in vehicular networks is greatly impaired by high mobility and intermittent connectivity. Social-aware content distribution schemes based on typical centrality metrics address the challenge, however they suffer due to their network-centric nature instead of information centric. We suggest to exploit the recently proposed information-centric networking architecture which cater the issue by decoupling host-user and support in-network caching at intermediate nodes. In this paper, we propose a novel information-centric social-aware content distribution protocol, STRIVE confining the broadcast nature of interest/content by routing it selectively towards high centrality information facilitator vehicles. We use a three-tier forwarding strategy to discover potential local and global information facilitators in an urban environment for efficient content delivery. The performance evaluation implements a scalable simulation environment deploying up to 2986 vehicles using realistic vehicular mobility traces. Simulation results show that our proposed novel vehicle centrality based content distribution protocol, STRIVE outperforms existing social content distribution metrics used in the literature.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129933440","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}
Yanru Wang, K. K. Chai, Yue Chen, J. Schormans, J. Loo
{"title":"Energy-Delay Aware Restricted Access Window with Novel Retransmission for IEEE 802.11ah Networks","authors":"Yanru Wang, K. K. Chai, Yue Chen, J. Schormans, J. Loo","doi":"10.1109/GLOCOM.2016.7841806","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841806","url":null,"abstract":"Restricted Access Window (RAW) has been introduced to IEEE 802.11ah MAC layer to decrease collision probability. However, the inappropriate application of RAW duration for diverse groups of devices would increase uplink energy consumption, delay and lower down the data rate. In this paper, we study a RAW optimization problem with a novel retransmission scheme that utilizes the next empty slot for retransmission in the uplink. The problem is formulated based on overall energy efficiency and delay of each RAW by applying probability theory and Markov Chain. To jointly optimize energy efficiency and delay, an energy-delay aware window control algorithm is proposed to adapt RAW size by estimating the number of time slots and internal slot duration in one RAW for different groups. The optimal solution is derived by applying Gradient Descent approach. Simulation results show that our proposed algorithm improves up to 113.3% energy efficiency and reduces 53.4% delay compared to the existing RAW.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133316588","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}
F. Chiti, Dario Di Giacomo, R. Fantacci, L. Pierucci, Camillo Carlini
{"title":"Optimized Narrow-Band M2M Systems for Massive Cellular IoT Communications","authors":"F. Chiti, Dario Di Giacomo, R. Fantacci, L. Pierucci, Camillo Carlini","doi":"10.1109/GLOCOM.2016.7842106","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7842106","url":null,"abstract":"Simple connectivity and data requirements together with high lifetime of battery are the main issues for the machine-to-machine (M2M) communications. 3GPP focuses on three main licensed standardizations based on Long Term Evolution (LTE), GSM and clean-slate technologies. The paper considers the last one and proposes a modified slotted-Aloha method to increase the capability of supporting a massive number of low-throughput devices. The proposed method increases the access rate of users belonging to each class considered in the clean-slate standard and consequently the total throughput offered by the system. To derive the mean access rate per class, we use the Markov chain approach and simulation results are provided for scenarios with different data rate and also in terms of cell average delay.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"15 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":"115450400","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":"Improving Broadcast Performance of Radio Duty-Cycled Internet-of-Things Devices","authors":"Salih Serdar Guclu, T. Ozcelebi, J. Lukkien","doi":"10.1109/GLOCOM.2016.7841888","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841888","url":null,"abstract":"Asynchronous Radio Duty Cycling (ARDC) protocols can make embedded networked devices more energy efficient by keeping their radio off most of the time without a need for synchronization between devices. Some ARDC protocols can operate under 6LoWPAN adaptation layer in order to enable the vision of Internet-of-Things for battery operated devices. In this paper, we propose three different protocols which are modifications of the widely accepted ARDC protocol, ContikiMAC. The proposed solutions drastically improve energy efficiency and link layer delay for broadcast packets. Moreover, the proposed solutions are backward compatible with ContikiMAC and provide high reliability against frame reception errors. We present a detailed comparison with the legacy ContikiMAC and a standardized ARDC protocol, IEEE 802.15.4e Coordinated Sampled Listening (CSL), as well as the case of no duty cycling.","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":"115655894","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}
Wensheng Lin, Bo Li, Mao Yang, Qiao Qu, Zhongjiang Yan, Xiaoya Zuo, Bo Yang
{"title":"Integrated Link-System Level Simulation Platform for the Next Generation WLAN - IEEE 802.11ax","authors":"Wensheng Lin, Bo Li, Mao Yang, Qiao Qu, Zhongjiang Yan, Xiaoya Zuo, Bo Yang","doi":"10.1109/GLOCOM.2016.7841905","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841905","url":null,"abstract":"As the most widely used standards for wireless local area network (WLAN), IEEE 802.11 standards are continuously amended by introducing new techniques so as to meet the increasing demands. In order to verify the performance of amended protocols, network simulation is considered as a significant method. However, as far as we know, current simulation tools are only for either media access control layer (MAC) or physical layer (PHY). The separate simulation of MAC and PHY can hardly evaluate the performance of IEEE 802.11ax in whole system level for authenticity and objectivity. Hence, the next generation WLAN (IEEE 802.11ax) requires integrated system simulation to take impacts of both MAC and PHY techniques into account. Moreover, IEEE 802.11ax introduces some new techniques, such as orthogonal frequency division multiple access (OFDMA), multi-user multiple input multiple output (MU- MIMO) and non-continuous channel bonding. In this paper, we design and further implement the integrated link-system level simulation platform, which makes it possible to evaluate the new technologies for IEEE 802.11ax. Moreover, we propose a MAC protocol combining OFDMA, MU-MIMO, non-continuous channel bonding and link adaptation and further evaluate its performance. Finally, we validate performance gains of IEEE 802.11ax through simulation, and the simulation results show that IEEE 802.11ax has obviously higher throughput, better quality of service (QoS) and higher multi- channel efficiency. To the best of our knowledge, this is the first work to design and implement simulation platform for IEEE 802.11ax with an integrated link- system level framework.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"819 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120931978","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":"An Analysis of Centrality Measures for Complex and Social Networks","authors":"F. Grando, Diego Noble, L. Lamb","doi":"10.1109/GLOCOM.2016.7841580","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841580","url":null,"abstract":"Measures of complex network analysis, such as vertex centrality, have the potential to unveil existing network patterns and behaviors. They contribute to the understanding of networks and their components by analyzing their structural properties, which makes them useful in several computer science domains and applications. Unfortunately, there is a large number of distinct centrality measures and little is known about their common characteristics in practice. By means of an empirical analysis, we aim at a clear understanding of the main centrality measures available, unveiling their similarities and differences in a large number of distinct social networks. Our experiments show that the vertex centrality measures known as information, eigenvector, subgraph, walk betweenness and betweenness can distinguish vertices in all kinds of networks with a granularity performance at 95%, while other metrics achieved a considerably lower result. In addition, we demonstrate that several pairs of metrics evaluate the vertices in a very similar way, i.e. their correlation coefficient values are above 0.7. This was unexpected, considering that each metric presents a quite distinct theoretical and algorithmic foundation. Our work thus contributes towards the development of a methodology for principled network analysis and evaluation.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":" 19","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120941084","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 Sequential Posted Price Mechanism for D2D Content Sharing Communications","authors":"Shiwei Huang, Changyan Yi, Jun Cai","doi":"10.1109/GLOCOM.2016.7841547","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841547","url":null,"abstract":"In this paper, the incentive mechanism design issue for device-to-device (D2D) content-sharing communications is discussed. In literature, most of works are based on auction/game theory, where all content owners first report their ask prices/costs towards the base station (BS) which finally decides only one winner from them to transmit data towards the content requester. One disadvantage of these works is that content owners may be frequently activated to provide auction/game information (such as prices/costs), leading to high energy consumption, but finally may not win to gain benefit. To address this, we propose a sequential posted price mechanism where the BS sends offers with posted prices to content owners in sequence and activates only one owner each time. The BS stops sending new offers as long as there is already an owner accepting an offer or when the BS finds the expected cost of sending a new offer is larger than the cost of direct transmission. The optimal posted prices and offer- stopping rule of the BS are derived by the backward principle of dynamic programming. Simulation results show that the proposed mechanism can effectively limit the proportion of content owners being activated while the BS maintains an acceptable expected cost.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"5 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":"121043939","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":"Asynchronous Channel Training in Massive MIMO Systems","authors":"Xun Zou, H. Jafarkhani","doi":"10.1109/GLOCOM.2016.7841614","DOIUrl":"https://doi.org/10.1109/GLOCOM.2016.7841614","url":null,"abstract":"Pilot contamination has been regarded as the bottleneck in time division duplexing (TDD) multi- cell massive multiple-input multiple-output (MIMO) systems. The pilot contamination problem cannot be addressed with large-scale antenna arrays. We provide a novel asynchronous channel training scheme to reduce the impact of pilot contamination without the cooperation of base stations. The scheme takes advantage of sampling diversity by inducing intentional timing mismatch. Then, the optimal linear minimum mean square error (LMMSE) estimator is designed to minimize the channel matrix estimation error. Finally, simulation results demonstrate that our scheme can provide significant performance improvement compared with the conventional synchronous systems that suffer from pilot contamination.","PeriodicalId":425019,"journal":{"name":"2016 IEEE Global Communications Conference (GLOBECOM)","volume":"30 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":"127538442","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}