Meng Qin, Jinglei Li, Qinghai Yang, Nan Cheng, K. Kwak, Xuemin Shen
{"title":"Self-Organized Energy Management in Energy Harvesting Small Cell Networks","authors":"Meng Qin, Jinglei Li, Qinghai Yang, Nan Cheng, K. Kwak, Xuemin Shen","doi":"10.1109/GLOCOM.2018.8647780","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647780","url":null,"abstract":"Small cell networks (SCNs) are envisioned as a promising solution to increase the network capacity and coverage. The densely deployments of SCNs in 5G networks pose new challenges for energy-efficient network management. Energy harvesting technique is put forward as a relatively new energy saving concept. However, due to the opportunistic nature of energy harvesting, the uncertainty and complexity will be introduced in energy harvesting SCNs (EH-SCNs) network management. In this paper, we study the self- organized cell operation management problem with different quality of service (QoS) requirements of users, in which the EH-SCNs needs to perform cell activation operation in a distributed manner with the uncertainty of harvested energy. With the assumption of Markovian energy harvesting process, multi-armed bandit game (MAB) based Thompson Sampling algorithm is developed to solve the small cell activation problem with a self-organized manner in EH-SCNs. Simulation results show that our proposed approach is particularly suitable to manage the large-scale EH-SCNs more efficiently under uncertain environment with incomplete information.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115618436","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}
Mohannad A. Alswailim, H. Hassanein, Mohammad Zulkernine
{"title":"A Context-Aware Privacy Scheme for Crisis Situations","authors":"Mohannad A. Alswailim, H. Hassanein, Mohammad Zulkernine","doi":"10.1109/GLOCOM.2018.8647222","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647222","url":null,"abstract":"Participatory sensing allows individuals and groups to contribute to an application using their handheld sensor devices. Data collected from participants including their location, time, contacts, etc. are vital to the accuracy of the application but are considered private to the participants. The design of a successful participatory sensing application must consider the challenge of the accuracy-privacy trade-off. In more critical situations when a crisis occurs, however, the accuracy-privacy trade-off becomes more complex. When a participant is at risk, data accuracy becomes more important than participant's privacy. In this paper, we propose a Context-Aware Privacy (CAP) scheme. CAP aims to provide privacy- preserved data to authorized recipients based on the status of participants. Depending on the recipient category, their role and policies enforced, a different level of participants' private data may be received. Experimental results show that the CAP scheme achieves a high level of privacy protection in safe areas. In risk areas/situations the scheme achieves a higher level of data accuracy than existing privacy schemes.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114680979","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":"Channel Coding for Energy Harvesting Communications Using Run Length Limited Codes","authors":"Mert Ozates, T. Duman","doi":"10.1109/GLOCOM.2018.8647264","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647264","url":null,"abstract":"We propose a serially concatenated coding scheme to communicate over binary energy harvesting communication channels with additive white Gaussian noise (AWGN), and design explicit and implementable codes for both long and short block lengths. Run length limited (RLL) codes are used to induce the required nonuniform input distributions for both cases. We employ low density parity check (LDPC) codes for long block lengths, while for short block lengths, we utilize convolutional codes as outer error correction codes. We consider different decoding approaches for the two cases, i.e., an iterative decoder is used for the former while Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm over the product trellis of the convolutional and run length limited codes is used for the latter. We also extend our work to joint energy and information transfer for both cases since similar coding solutions can be employed. Numerical examples demonstrate that the newly optimized codes with an inner RLL code are superior to the optimal codes over standard AWGN channels for long block lengths. Our results also show that, for the short block length case, concatenated convolutional and RLL codes with higher minimum distances offer excellent performance.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125218428","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}
Amit Goyal, Shalini Batra, Neeraj Kumar, G. Aujla, M. Obaidat
{"title":"Adaptive Skip Graph Framework for Peer-to-Peer Networks: Search Time Complexity Analysis","authors":"Amit Goyal, Shalini Batra, Neeraj Kumar, G. Aujla, M. Obaidat","doi":"10.1109/GLOCOM.2018.8648018","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8648018","url":null,"abstract":"With the enormous growth of number of nodes in a peer-to-peer (P2P) network, establishing a direct connection between two communicating nodes is a challenging task. It is mandatory to have a strong connection between different nodes for data sharing among P2P networks. Hence, this paper presents a modified data structure, named as Adaptive Skip Graph, a variant of a probabilistic data structure, skip list, which establishes a direct connection between two frequently communicating nodes by changing the membership vector of the caller node once the threshold is crossed. The proposed approach reduces the search time complexity of skip graph (O(log n)) substantially for the scenario where a node 'x' is repeatedly queried by a certain node 'y'. The results obtained using the proposed scheme are validated by experiments performed on a large set of nodes.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117277428","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":"Cross-Layer Optimization for VR Video Multicast Systems","authors":"Jounsup Park, Jenq-Neng Hwang, Hung-Yu Wei","doi":"10.1109/GLOCOM.2018.8647389","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647389","url":null,"abstract":"360-degree videos for Virtual Reality (VR) applications are getting more popular because of their diverse applications. However, VR videos usually need more bandwidth than conventional videos to provide the same quality of experience (QoE). Tiled videos can help save bandwidth by selecting lower quality encoding for the tiles with lower probability of viewing. Dynamic Adaptive Streaming over HTTP (DASH) enables the adaptive rate selection of tiles based on the channel conditions. Multicasting also can help save bandwidth, since many users share the spectrum when they request the same video contents. In this paper, we formulate the utility maximization problem to find which tiles should have which video representations to satisfy the most users in multicasting groups using limited resources. A cross-layer optimization framework, which includes user grouping, resource allocation, and the tile-based rate-selection algorithms, is proposed to maximize the total utility among all users. Simulation results show that the proposed cross-layer optimization framework can achieve a higher utility than the broadcasting solution or existing multicast solutions.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"35 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120818055","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":"Wireless MIMO Switching with Imperfect Channel State Information","authors":"Dong Wang, Fanggang Wang, B. Ai, Z. Zhong","doi":"10.1109/GLOCOM.2018.8647666","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647666","url":null,"abstract":"This paper investigates the transceiver design in a wireless multiple-input multiple-output (MIMO) switching network in which multiple users exchange messages via a multi-antenna relay. Previous work assumed that perfect channel state information (CSI) is known at the relay, which is intractable in practice. Regarding different types of CSI imperfection of uplink and downlink transmission, a statistical and a norm- bounded uncertainty model are adopted to characterize the imperfect CSI of uplink and downlink respectively for the transceiver design. An optimization problem is formulated by minimizing the worst-case mean square error (MSE) with respect to channel uncertainty in the constraint of the maximum transmit power of the relay. Since the problem is non-convex and difficult to solve, we divide the original problem into two subproblems in which the channel uncertainty of uplink and downlink are treated individually. For the uplink subproblem, we propose an iterative approach to determine a closed- form solution of the robust transceiver. In addition, a Sylvester equation is formulated which closed-form solution is provided explicitly for the downlink channel uncertainty subproblem. An overall iterative algorithm is proposed by combining the two algorithms for the subproblems, which can solve the original problem efficiently in a low complexity. Simulation results show that the proposed iterative algorithm reduces the sum MSE significantly in the channel uncertain scenarios.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120879861","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":"Reliability-Driven Vehicular Crowd-Sensing: A Case Study for Localization in Public Transportation","authors":"Cem Kaptan, B. Kantarci, A. Boukerche","doi":"10.1109/GLOCOM.2018.8647989","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647989","url":null,"abstract":"This paper proposes a new framework for GPS-less identification of location of public transportation vehicles by using machine intelligence algorithms by exploiting the vehicular crowd-sensing concept. Since data trustworthiness is vital when data is crowd- solicited via various non-dedicated sensors, assessment and quantification of the trustworthiness of participating sensors plays a key role in the accuracy of the acquired information. To this end, we propose two trustworthiness-aware recruitment schemes for the non-dedicated sensors in a vehicular crowd-sensing environment: Reliability-driven naive recruitment (RDNR) and Reliability-driven exclusive recruitment (RDER). The former determines to use the data of a mobile device with a probability equal to the reliability of the device whereas the latter excludes the participating devices whose reliability scores are below a certain threshold. The data acquired from the recruited participant pool then undergoes an unsupervised machine learning module that is hosted in the cloud. We evaluate the performance of RDNR and RDER in comparison to each other and a non-restrictive recruitment mechanism which does not consider reliability of participants at all. Through simulations, we show that over 85% and 98% accuracy can be achieved in the worst and best cases, respectively while consuming less energy than GPS-based localization approaches.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120934331","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":"Computation Efficiency Maximization for Wireless-Powered Mobile Edge Computing","authors":"Fuhui Zhou, Haijian Sun, Zheng Chu, R. Hu","doi":"10.1109/GLOCOM.2018.8647509","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647509","url":null,"abstract":"Energy-efficient computation is an inevitable trend for mobile edge computing (MEC) networks. However, resource allocation strategies for maximizing the computation efficiency have not been fully investigated. In this paper a computation efficiency maximization problem is formulated in the wireless-powered MEC network under a practical non-linear energy harvesting model. The energy harvesting time, the local computing frequency, the offtoading time, and power are all jointly optimized to maximize the computation efficiency under the max-min fairness criterion. The problem is non-convex and challenging to solve. An iterative algorithm is proposed to solve this problem. Simulation results show that our proposed resource allocation scheme outperforms the benchmark schemes in terms of the computation efficiency and verify the efficiency of our proposed algorithm. A tradeoff is elucidated between the achievable computation efficiency and the computation bits.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121046563","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}
Vipindev Adat, I. Politis, C. Tselios, P. Galiotos, S. Kotsopoulos
{"title":"On Blockchain Enhanced Secure Network Coding for 5G Deployments","authors":"Vipindev Adat, I. Politis, C. Tselios, P. Galiotos, S. Kotsopoulos","doi":"10.1109/GLOCOM.2018.8647581","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647581","url":null,"abstract":"The fifth generation of mobile networks is rapidly evolving, fueled by the ever-growing mobile traffic over recent years. Ultra-reliable and low latency provisioning of services with ranging contextual parameters mapped to highly fluctuating levels of quality of service and quality of user experience, render the optimum operation point of the future networks unsustainable. Network coding is emerging once more as a potential key enabler for optimizing bandwidth requirements and energy consumption in highly dense mobile network environments. Nonetheless, network coding deployments still need to consider security vulnerabilities and their countermeasures, before they can be adapted as part of the emerging mobile network deployments. This paper studies the performance of random linear network coding for wireless mobile networks with an emphasis on pollution attacks while proposing a novel blockchain based message authentication scheme in order to minimize delays and signalling costs.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121277579","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}
C. U. Bas, Rui Wang, S. Sangodoyin, Sooyoung Hur, Kuyeon Whang, Jeongho Park, Jianzhong Zhang, A. Molisch
{"title":"28 GHz Foliage Propagation Channel Measurements","authors":"C. U. Bas, Rui Wang, S. Sangodoyin, Sooyoung Hur, Kuyeon Whang, Jeongho Park, Jianzhong Zhang, A. Molisch","doi":"10.1109/GLOCOM.2018.8647674","DOIUrl":"https://doi.org/10.1109/GLOCOM.2018.8647674","url":null,"abstract":"This paper presents results from channel sounding campaigns that investigate the impact of foliage blockage on the wireless propagation channel characteristics at 28 GHz. The measurements are performed with a real-time channel sounder equipped with phased array antennas that allow beamforming and electronic beam steering for directionally resolved measurements. Thanks to the short measurement time and the excellent phase stability of the system, we obtain both directional and omnidirectional channel power delay profiles without any delay uncertainty. We derive models for the distance-dependent foliage attenuation for different receiver heights. Additionally, we compare the angular spread and delay spread for links with and without foliage blockage to understand the effects of foliage on all channel characteristics.","PeriodicalId":201848,"journal":{"name":"2018 IEEE Global Communications Conference (GLOBECOM)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127078316","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}