{"title":"Cooperative Video Quality Adaptation for Delay-Sensitive Dynamic Streaming using Adaptive Super-Resolution","authors":"Minseok Choi, Won Joon Yun, Joongheon Kim","doi":"10.23919/WiOpt56218.2022.9930547","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930547","url":null,"abstract":"This paper proposes a cooperative and dynamic quality adaptation scheme for delay-sensitive video streaming between the transmitter and the receiver. We present a novel adaptive super-resolution (SR) technique that adaptively controls the quality enhancement rate and computation time. Due to the capability of enhancing the quality of video chunks at the user device side, the transmitter can aggressively transcode video chunks to reduce the delivery latency and power consumption. Also, adaptive SR can control the tradeoff between playback stall rate and CPU consumption of the user device. Simulation results verify the performance of adaptive SR and show that the proposed video delivery scheme is very good to balance tradeoff among the following performance metrics for online video services: 1) playback stall rate, 2) average quality measure, 3) transmission power, and 4) CPU consumption of the user device.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121614632","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":"Intelligent RAN Power Saving using Balanced Model Training in Cellular Networks","authors":"V. Singh, M. Gupta, C. Maciocco","doi":"10.23919/WiOpt56218.2022.9930603","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930603","url":null,"abstract":"optimizing power consumption of 5G systems and next generation technology deployments is a critical problem. It is essential that the solution for optimizing power consumption takes into account the tradeoffs with maintaining service level agreement (SLA). Mobile network operator (MNO) may have different priorities for the objectives of saving power and for maintaining SLA, which depends on factors, such as customer contract, location, time of day, type of traffic, etc. In this paper, we design an intelligent solution using switching cells on-off action to save power, using machine learning (ML)/ deep learning (DL) methods to forecast future traffic load. We firstly identify the problem of training imbalance in traffic load prediction due to data imbalance in real cellular networks, and MNO preferences for the competing objectives of saving power and SLA maintenance. We then propose a novel solution that incorporates Balancing Loss Function, which addresses the training imbalance problem. Compared with the performance of previous approaches such as Mean Square Error (MSE) minimization traffic forecast based methods, we demonstrate using network field data that our method is able to achieve upto 3X improvement in service quality outage, with fairly similar power savings.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"513 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134063646","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}
Isfar Tariq, Kartik Patel, T. Novlan, S. Akoum, M. Majmundar, G. Veciana, S. Shakkottai
{"title":"Bandit Learning-based Online User Clustering and Selection for Cellular Networks","authors":"Isfar Tariq, Kartik Patel, T. Novlan, S. Akoum, M. Majmundar, G. Veciana, S. Shakkottai","doi":"10.23919/WiOpt56218.2022.9930562","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930562","url":null,"abstract":"Current wireless networks employ sophisticated multi-user transmission techniques to fully utilize the physical layer resources for data transmission. At the MAC layer, these techniques rely on a semi-static map that translates the channel quality of users to the potential transmission rate (more precisely, a map from the Channel Quality Index to the Modulation and Coding Scheme) for user selection and scheduling decisions. However, such a static map does not adapt to the actual deployment scenario and can lead to large performance losses. Furthermore, adaptively learning this map can be inefficient, particularly when there are a large number of users. In this work, we make this learning efficient by clustering users. Specifically, we develop an online learning approach that jointly clusters users and channel-states, and learns the associated rate regions of each cluster. This approach generates a scenario-specific map that replaces the static map that is currently used in practice. Furthermore, we show that our learning algorithm achieves sub-linear regret when compared to an omniscient genie. Next, we develop a user selection algorithm for multi-user scheduling using the learned user-clusters and associated rate regions. Our algorithms are validated on the WiNGS simulator from AT&T Labs, that implements the PHY/MAC stack and simulates the channel. We show that our algorithm can efficiently learn user clusters and the rate regions associated with the user sets for any observed channel state. Moreover, our simulations show that a deployment-scenario-specific map significantly outperforms the current static map approach for resource allocation at the MAC layer.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133685037","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}
Hang Zou, Yifei Sun, Chao Zhang, S. Lasaulce, M. Kieffer, L. Saludjian
{"title":"Goal-Oriented Quantization: Applications to Convex Cost Functions with Polyhedral Decision Space","authors":"Hang Zou, Yifei Sun, Chao Zhang, S. Lasaulce, M. Kieffer, L. Saludjian","doi":"10.23919/WiOpt56218.2022.9930620","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930620","url":null,"abstract":"In this paper, the situation in which a receiver has to execute a task from a quantized version of the information source of interest is considered. The task is modeled by the minimization problem of a general cost function f(x;g) for which the decision x has to be taken from quantized parameters g. Especially, we focus on the particular scenario where the decision space is a convex polyhedron with cost function being convex. Furthermore, we propose a new goal-oriented quantization algorithm by combining the procedure of iteratively expanding and reinstating decision set together with Jensen’s inequality. Proposed method could also be extended to some non-convex scenarios, namely, weakly convex cost function whose eigenvalues of Hessian matrix w.r.t decision x are lower-bounded. Numerical results show that proposed algorithm can considerably reduce the optimality loss (OL) compared to conventional approaches or the required number of quantization bits to achieve a certain relative optimality loss.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124812772","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}
P. Zappalà, Amal Benhamiche, Matthieu Chardy, F. Pellegrini, Rosa Figueiredo
{"title":"A timing game approach for the roll-out of new mobile technologies","authors":"P. Zappalà, Amal Benhamiche, Matthieu Chardy, F. Pellegrini, Rosa Figueiredo","doi":"10.23919/WiOpt56218.2022.9930538","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930538","url":null,"abstract":"When adopting a novel mobile technology, a mobile network operator faces the dilemma of determining which is the best time to start the installation of next generation equipment onto the existing infrastructure. In a strategic context, the best possible time for deployment is also the best response to competitors’ actions, subject to normative and material constraints and to the customer’s adoption curve. We formulate in this paper a finite discrete-time game which captures the main features of the problem for a two-player game played over a prescribed finite horizon. Our numerical results provide insights on the possible optimal tradeoffs for an operator between fixed costs and installation strategies.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115102413","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}
Ali Al Khansa, R. Visoz, Y. Hayel, S. Lasaulce, Rasha Alkhansa
{"title":"Parallel Retransmissions in Orthogonal Multiple Access Multiple Relay Networks","authors":"Ali Al Khansa, R. Visoz, Y. Hayel, S. Lasaulce, Rasha Alkhansa","doi":"10.23919/WiOpt56218.2022.9930609","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930609","url":null,"abstract":"In this paper, we propose a novel selection strategy for the orthogonal Multiple Access Multiple Relay Networks (MAMRN). Rather than selecting a single relaying node to help one source node at a given retransmission time slot, we propose allocating one source to be helped by multiple relaying nodes. The idea is to exploit the multipath diversity of the different relaying nodes in order to optimize the spectral efficiency. We present the control exchange process in the novel selection strategy and we compare it to that of the prior art. In addition, we investigate the effect of equal gain combining on the performance, as well as the effect of the rates and the channel configuration. The numerical results show that the proposed strategy outperforms the prior art by exploiting the power budget available at each relaying node included in the system.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132733636","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}
Alba Jano, R. S. Ganesan, Fidan Mehmeti, Serkut Ayvaşık, W. Kellerer
{"title":"Energy-Efficient and Radio Resource Control State Aware Resource Allocation with Fairness Guarantees","authors":"Alba Jano, R. S. Ganesan, Fidan Mehmeti, Serkut Ayvaşık, W. Kellerer","doi":"10.23919/WiOpt56218.2022.9930553","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930553","url":null,"abstract":"In the next-generation wireless networks, energy efficiency (EE) is a fundamental requirement due to the limited battery power and the deployment of various devices in hardly accessible areas. While a plethora of approaches have been proposed to increase users’ EE, there are still many unresolved issues stemming mainly from the limited wireless resources. In this paper, we investigate the energy-efficient resource allocation, taking into account users’ radio resource control (RRC) state. We aim to achieve max-min fairness among users in an uplink orthogonal frequency-division multiple access (OFDMA) system while fulfilling data rate requirements and transmit power constraints. In particular, we avoid waste of the energy through unnecessary state transitions when no network resources are available. We study the impact of the RRC Resume procedure on users’ EE and propose allocating resources while users are in their current RRC Connected or RRC Inactive state. The solution is obtained from a constrained optimization problem, whose output is max-min fair and energy-efficient. To that end, we use generalized fractional programming and the Lagrangian dual decomposition approach to allocate the radio resources and transmission power iteratively. Using extensive realistic simulations with input parameters from measurement data, we compare the results of our approach against benchmark models and show the performance improvements RRC state awareness brings. Specifically, using our approach, the users’ EE increases by at least 10% on average.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"485 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116193312","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":"Content Caching with Personalized and Incumbent-aware Recommendation: An optimization Approach","authors":"Yi Zhao, Zhanwei Yu, Qing He, Di Yuan","doi":"10.23919/WiOpt56218.2022.9930536","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930536","url":null,"abstract":"Content recommendation can be tailored by not only personal interests, but also the incumbent content, namely the content that a user is currently viewing. Incumbent-aware recommendation adds a new dimension to optimizing content caching. We study this optimization problem subject to user satisfaction constraints. We prove the problem’s NP-hardness, and present an integer linear programming formulation that enables global optimality for small-scale instances. On the algorithmic side, we first present a polynomial-time algorithm that delivers the global optimum of the recommendation sub-problem, by leveraging the problem’s inherent graph structure. Next, we propose a fast, alternating algorithm for the overall problem. Numerical results using synthesized and real-world data show the close-to-optimal performance of the proposed algorithm.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125443588","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}
Karl-Ludwig Besser, Eduard Axel Jorswieck, J. Coon
{"title":"Multi-User Frequency Assignment for Ultra-Reliable mmWave Two-Ray Channels","authors":"Karl-Ludwig Besser, Eduard Axel Jorswieck, J. Coon","doi":"10.23919/WiOpt56218.2022.9930571","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930571","url":null,"abstract":"We consider a multi-user two-ray ground reflection scenario with unknown distances between transmitter and receivers. By using two frequencies per user in parallel, we can mitigate possible destructive interference and ensure ultra-reliability with only very limited knowledge at the transmitter. In this work, we consider the problem of assigning two frequencies to each receiver in a multi-user communication system such that the average minimum receive power is maximized. In order to solve this problem, we introduce a generalization of the quadratic multiple knapsack problem to include heterogeneous profits and develop an algorithm to solve it. Compared to random frequency assignment, we report a gain of around 6dB in numerical simulations.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125530027","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":"Beam Tracking for Dynamic mmWave Channels: A New Training Beam Sequence Design Approach","authors":"Deyou Zhang, Ming Xiao, M. Skoglund","doi":"10.23919/WiOpt56218.2022.9930586","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930586","url":null,"abstract":"In this paper, we develop an efficient training beam sequence design approach for millimeter wave MISO tracking systems. We impose a discrete state Markov process assumption on the evolution of the angle of departure and introduce the maximum a posteriori criterion to track it in each beam training period. Since it is infeasible to derive an explicit expression for the resultant tracking error probability, we turn to its upper bound, which possesses a closed-form expression and is therefore leveraged as the objective function to optimize the training beam sequence. Considering the complicated objective function and the unit modulus constraints imposed by analog phase shifters, we resort to the particle swarm algorithm to solve the formulated optimization problem. Numerical results validate the superiority of the proposed training beam sequence design approach.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131294129","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}