{"title":"Wireless network optimization via stochastic sub-gradient descent: Rate analysis","authors":"A. S. Bedi, K. Rajawat","doi":"10.1109/WCNC.2018.8377002","DOIUrl":"https://doi.org/10.1109/WCNC.2018.8377002","url":null,"abstract":"This paper considers a general stochastic resource allocation problem that arises widely in wireless networks, cognitive radio networks, smart-grid communications, and cross-layer design. The problem formulation involves expectations with respect to a collection of random variables with unknown distributions, representing exogenous quantities such as channel gain, user density, or spectrum occupancy. The problem is solved in dual domain using a constant step-size stochastic dual subgradient descent (SDSD) method. This results in a primal resource allocation subproblem at each time instant. The goal here is to characterize the non-asymptotic behavior of such stochastic resource allocations in an almost sure sense. This paper establishes a convergence rate result for the SDSD algorithm that precisely characterizes the trade-off between the rate of convergence and the choice of constant step size e. Towards this end, a novel stochastic bound on the gap between the objective function and the optimum is developed. The asymptotic behavior of the stochastic term is characterized in an almost sure sense, thereby generalizing the existing results for the stochastic subgradient methods. As an application, the power and user-allocation problem in device-to-device networks is formulated and solved using the SDSD algorithm. Further intuition on the rate results is obtained from the verification of the regularity conditions and accompanying simulation results.","PeriodicalId":360054,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123552412","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}
Muhammad Usman, M. R. Asghar, I. S. Ansari, F. Granelli, Q. Abbasi, K. Qaraqe
{"title":"A marketplace for efficient and secure caching for IoT applications in 5G networks","authors":"Muhammad Usman, M. R. Asghar, I. S. Ansari, F. Granelli, Q. Abbasi, K. Qaraqe","doi":"10.1109/WCNC.2018.8377254","DOIUrl":"https://doi.org/10.1109/WCNC.2018.8377254","url":null,"abstract":"As the communication industry is progressing towards fifth generation (5G) of cellular networks, the traffic it carries is also shifting from high data rate traffic from cellular users to a mixture of high data rate and low data rate traffic from Internet of Things (IoT) applications. Moreover, the need to efficiently access Internet data is also increasing across 5G networks. Caching contents at the network edge is considered as a promising approach to reduce the delivery time. In this paper, we propose a marketplace for providing a number of caching options for a broad range of applications. In addition, we propose a security scheme to secure the caching contents with a simultaneous potential of reducing the duplicate contents from the caching server by dividing a file into smaller chunks. We model different caching scenarios in NS-3 and present the performance evaluation of our proposal in terms of latency and throughput gains for various chunk sizes.","PeriodicalId":360054,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123773152","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":"Adapting the number of antennas and power to traffic load: When to turn on massive MIMO?","authors":"Kamil Senel, Emil Björnson, E. Larsson","doi":"10.1109/WCNC.2018.8377286","DOIUrl":"https://doi.org/10.1109/WCNC.2018.8377286","url":null,"abstract":"In this work, we consider the downlink of a multi-user multiple-input multiple-output (MIMO) system and aim to find the jointly optimal number of base station (BS) antennas and transmission powers that minimize the power consumption while satisfying each user's signal-to-interference-and-noise-ratio (SINR) constraint and the BS's power constraint. Different from prior work, we consider a power consumption model that takes both transmitted and hardware-consumed power into account. We formulate the joint optimization problem for a single-cell system and derive closed-form expressions for the optimal number of BS antennas and transmission powers. The solution can be utilized in practice to turn on and off antennas depending on the traffic load variations. Substantial power savings are demonstrated by simulation.","PeriodicalId":360054,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123782773","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}
Luca Buccheri, Silvio Mandelli, Stephan Saur, L. Reggiani, M. Magarini
{"title":"Hybrid retransmission scheme for QoS-defined 5G ultra-reliable low-latency communications","authors":"Luca Buccheri, Silvio Mandelli, Stephan Saur, L. Reggiani, M. Magarini","doi":"10.1109/WCNC.2018.8377097","DOIUrl":"https://doi.org/10.1109/WCNC.2018.8377097","url":null,"abstract":"One of the key challenges in next generation 5G networks is to deliver Ultra-Reliable Low-Latency Communications (URLLC). Recent advances in information theory about principles that govern short packet transmissions pointed out that, for the URLLC typical short packet dimension, achieving higher reliabilities comes at the price of a lower maximum achievable rate, thus reducing spectral efficiency. Hence, retransmissions are used in LTE and planned for 5G, in order to achieve reliability with a better resource consumption, at the price of increased packet latency. Keeping in mind the stringent requirements for URLLC, in this paper we analyze the tradeoffs and limitations of retransmission strategies considered in the literature, either too demanding in terms of wireless resources and aggressive URLLC performance or the contrary. Then we propose a novel scheme, whose purpose is to match the URLLC requirements, minimizing the resource consumption. We evaluate the schemes through simulations and highlight the advantages of the proposed scheme, providing also insights on the performance HARQ techniques in URLLC scenarios.","PeriodicalId":360054,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115198984","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":"Radio resource and service orchestration for virtualised multi-tenant mobile Het-Nets","authors":"B. Rouzbehani, L. Correia, Luisa Caeiro","doi":"10.1109/WCNC.2018.8377110","DOIUrl":"https://doi.org/10.1109/WCNC.2018.8377110","url":null,"abstract":"Virtualization as a promising technology for future mobile communications enables the principle of customized services and multi-tenancy by providing a shared resource platform to all the involved tenants in an isolated manner. This paper proposes a model of radio resource management in virtualized heterogeneous mobile networks comprised of different access technologies. To realize the concept of virtualization, the roles of Infrastructure Providers (InPs) and network operators are separated. A virtualization platform is responsible for aggregating and vitalizing all the radio resources from different access technologies owned by InPs, and distributing the total capacity among various Virtual Network Operators (VNOs) in the role of tenants, according to service priorities and some fairness criteria, with the aim of satisfying their Service Level Agreements (SLAs). The model considers two VNOs with the capability of providing different service classes and SLAs in a multi access technology environment. Results under different channel conditions and traffic loads confirm a level of isolation in the performance of each VNO, while the SLAs are addressed to the highest possible level. Furthermore, almost always 100% of the aggregated capacity is utilized independently of the variation of different network parameters.","PeriodicalId":360054,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115570833","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}
Stefan Reis, D. Pesch, Bernd-Ludwig Wenning, M. Kuhn
{"title":"Empirical path loss model for 2.4 GHz IEEE 802.15.4 wireless networks in compact cars","authors":"Stefan Reis, D. Pesch, Bernd-Ludwig Wenning, M. Kuhn","doi":"10.1109/WCNC.2018.8377277","DOIUrl":"https://doi.org/10.1109/WCNC.2018.8377277","url":null,"abstract":"Wireless sensor systems are becoming increasingly attractive as a means to flexibly extend sensing capabilities towards more intelligent cars. Wireless sensors can reduce cabling costs and weight, allow for cheaper customization, and allow retrofitting new functionality into older vehicles. The communication system design for these wireless sensor systems requires models for radio propagation in cars. In this paper we present a novel empirical path loss model for the 2.4 GHz based IEEE 802.15.4 radio channel. Our model is based on extensive measurements in two compact cars. We have extracted model parameters for two types of wireless links, those between sensors in the car and those towards sensors on the outside of the car. We have calibrated the model parameters for both path loss and shadow fading to fit our measurements.","PeriodicalId":360054,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122919349","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 offloading over a shared communication channel for mobile cloud computing","authors":"Kai Guo, Mingcong Yang, Yongbing Zhang","doi":"10.1109/WCNC.2018.8376951","DOIUrl":"https://doi.org/10.1109/WCNC.2018.8376951","url":null,"abstract":"In this paper, we focus on the problem of offloading computation intensive tasks of mobile applications from resource-scarce mobile devices to the servers located at the edge networks in order to minimize the average response time of the applications. We consider a number of mobile devices connected by a shared communication channel to a server located in the edge network and therefore transmission collision occurs if more than one mobile device attempts to transmit data simultaneously. We first formulate the offloading problem as a mixed integer programming (MIP) problem. Since the problem is NP-hard, we design a heuristic algorithm that considers possible transmission collision over the shared channel and offloads efficiently tasks of a mobile application to the server. We demonstrated that our proposed algorithm outperforms previous offloading algorithms significantly in terms of the average response time. Furthermore, we showed that our proposed algorithm yields less energy consumption than previous algorithms in realistic system scenarios.","PeriodicalId":360054,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121875693","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}
A. Jurcut, Madhusanka Liyanage, Jinyong Chen, Cornelia Györödi, Jingsha He
{"title":"On the security verification of a short message service protocol","authors":"A. Jurcut, Madhusanka Liyanage, Jinyong Chen, Cornelia Györödi, Jingsha He","doi":"10.1109/WCNC.2018.8377349","DOIUrl":"https://doi.org/10.1109/WCNC.2018.8377349","url":null,"abstract":"Short Message Service (SMS) is a text messaging service component of smart phones, web, or mobile communication systems which requires a high level of security to provide user authentication and data confidentiality. To provide such security features, a high security communication protocol for SMS, called Message Security Communication Protocol (MSCP) was proposed. In this paper, MSCP is formally analyzed using an automated logic-based verification tool with attack detection capabilities. The performed formal verification reveals that the proposed protocol is susceptible to parallel session and denial-of-service (DoS) attacks. The reasoning why these attacks are possible is detailed and an amended protocol is proposed to counter the identified attacks. Formal verification of the amended protocol provides confidence regarding the correctness and effectiveness of the proposed modifications.","PeriodicalId":360054,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129590185","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}
Abdulkadir Celik, A. AlGhadhban, B. Shihada, Mohamed-Slim Alouini
{"title":"Design and provisioning of optical wireless data center networks: A traffic grooming approach","authors":"Abdulkadir Celik, A. AlGhadhban, B. Shihada, Mohamed-Slim Alouini","doi":"10.1109/WCNC.2018.8377411","DOIUrl":"https://doi.org/10.1109/WCNC.2018.8377411","url":null,"abstract":"Traditional wired data center networks (DCNs) suffer from cabling complexity, lack flexibility, and are limited by the speed of digital switches. In this paper, we alternatively develop a top-down traffic grooming (TG) approach for design and provisioning of optical wireless DCNs. While switches are modeled as hybrid opto-electronic cross-connects, links are modeled as wavelength division multiplexing (WDM) capable free-space optic (FSO) channels. Using the standard TG terminology, we formulate the optimal mixed integer linear problem considering the virtual topology, flow conversation, connection topology, non-bifurcation, and capacity constraints. Thereafter, we develop a fast sub-optimal solution where mice flows (MFs) are groomed and forwarded on predetermined rack-to-rack (R2R) lightpaths. On the other hand, elephant flows (EFs) are forwarded over dedicated server-to-server (S2S) express lightpaths whose routes and capacity are dynamically determined based on wavelength and capacity availability. Emulation results show that proposed models and algorithms provide a significant throughput improvement upon traditional DCNs for both MFs and EFs.","PeriodicalId":360054,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128270533","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":"Optimal data partitioning and forwarding in opportunistic mobile networks","authors":"Ning Wang, Jie Wu","doi":"10.1109/WCNC.2018.8376979","DOIUrl":"https://doi.org/10.1109/WCNC.2018.8376979","url":null,"abstract":"In opportunistic mobile networks, existing schemes rely on the assumption that data can be entirely transmitted at each contact. However, in an opportunistic mobile network, the transmission probability exponentially decreases as the data size increases. That is, the contact duration in each contact might be insufficient to deliver large data. Therefore, it is reasonable to partition original data into small data chunks and each chunk is forwarded through an opportunistic path. The objective of this paper is to find an optimal data partition strategy where the data delivery ratio is maximized under a given deadline. There is a trade-off in data partitioning. Each small chunk in a path has a higher delivery probability than the original data, and consequently, a shorter delivery latency under the persistent transmission model with re-transmission. However, the destination needs to receive all chunks in multiple paths (a path is a sequence of contacts) to retrieve the data. A delay in any path will lead to a longer delivery latency. We formulate the data partitioning problem and propose solutions in blind flooding. In the blind flooding scenario, we find the optimal data partitioning size. Network coding technique is used to the proposed method to further improve the performance. Extensive experiments on realistic traces show that our scheme achieves a much better performance than those without partitioning.","PeriodicalId":360054,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123456096","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}