Intelligent Transportation Systems (ITS) will become an essential part of every city in the near future. They should support various vehicle-to-everything (V2X) applications that improve road safety or even enable autonomous driving. Recently, the European Telecommunications Standards Institute (ETSI) introduced a multi-access (mobile) edge computing concept as a promising solution to satisfy the V2X delay and computational requirements. Based on this concept, the tasks generated by V2X applications can be offloaded to servers at the edge of the radio access network (RAN). There is a need for a task offloading algorithm that minimizes the ITS operator expenses connected with the servers deployment and maintenance while satisfying the requirements of the V2X applications. Most of the existing papers in the literature do not pay much attention to queuing delays at servers. In this paper, the queuing delays are analyzed by considering a general-type task computational time distribution. A non-linear optimization problem is formulated to minimize the ITS operator expenses subject to delays and computational resources constraints. The flexibility is also improved by considering that a delay constraint is satisfied with a given probability. To solve this problem, a method for linearization of the problem is proposed, and consequently, an algorithm based on Integer Linear Programming (ILP) is designed. A heuristic algorithm called Cost-effective Heuristic Algorithm for Task offloading (CHAT) is also introduced that provides close to optimal results and has much lower computational complexity than the ILP algorithm. The efficiency of the CHAT algorithm is studied in several scenarios in terms of the computational time, delays, and the total server energy consumption as the cost function. The results show that the CHAT algorithm satisfies the requirements of the V2X applications in all the considered scenarios and reduces the ITS operator expenses over twice compared with other algorithms proposed in the literature.
Ultra reliable low latency communications (URLLC) is one of the most promising and demanding services in 5G systems. This service requires very low latency of less than 1 − 10 ms and very high transmission reliability: the acceptable packet loss ratio is about 10 −5 . To satisfy such strict requirements, many issues shall be solved. This paper focuses on the link adaptation problem, i.e., the selection of a modulation and coding scheme (MCS) for transmission based on the received channel quality indicator (CQI) reports. On the one hand, link adaptation should select a robust MCS to provide high reliability. On the other hand, it should select the highest possible MCS to reduce channel resource consumption. The paper shows that even for one URLLC user, link adaptation is still a challenging problem, especially in highly-variant channels. To solve this problem, a conservative link adaptation algorithm is designed. The algorithm estimates the strongest channel degradation at the time moment of the actual packet transmission and selects an MCS taking into account the worst degradation. The obtained results show that the proposed algorithm is efficient in terms of both the packet loss ratio and the channel resource consumption.
Wi-Fi facilitates the Internet connectivity of billions of devices worldwide, making it an indispensable technology for modern life. Wi-Fi networks are becoming significantly denser, making energy consumption and its effects on operational costs and environmental sustainability crucial considerations. Wi-Fi has already introduced several mechanisms to enhance the energy efficiency of non-access point (non-AP) stations (STAs). However, the reduction of energy consumption of APs has never been a priority. Always-on APs operating at their highest capabilities consume significant power, which affects the energy costs of the infrastructure owner, aggravates the environmental impact, and decreases the lifetime of battery-powered APs. IEEE 802.11bn, which will be the basis of Wi-Fi 8, makes a big leap forward by introducing the AP power save (PS) framework. In this article, we describe and analyze the main proposals discussed in the IEEE 802.11bn Task Group (TGbn), such as scheduled power save, (semi-)dynamic power save, and cross-link power save. We also consider other proposals that are being discussed in TGbn, namely the integration of wake-up radios (WuRs) and STA offloading. We then showcase the potential benefits of AP PS in several scenarios, including a deployment of 470 real APs on a university campus. Our numerical analysis reveals that AP power consumption can be decreased on average by up to 28 percent, with further improvement potential. Finally, we outline the open challenges that need to be addressed to optimally integrate AP PS in Wi-Fi and ensure its compatibility with legacy devices.
1 December 2020 in Journal of Communications Technology and Electronics
This paper considers a computing resource management problem in the context of intelligent transport systems (ITSs). An operator’s expense minimization problem subject to delay constraints that include transmission and computational delays is formulated. To solve the problem, an algorithm based on a method of reducing the problem to an integer linear programming problem is proposed. The simulation results show that the proposed algorithm significantly reduces an operator’s expenses compared to existing approaches while satisfying the strict delay requirements of various applications.
Various networking protocols currently used in wireless networks disseminate much control information. In particular, the deterministic channel access protocol (called MCCA) specified in the IEEE 802.11 standard sends information about channel reservations. The standard proposes a novel approach to reduce this overhead, which is based on dividing various pieces of control information into several groups. When the content of some group changes, the station sends a differential update related to this group. However, a group management algorithm (GMA) — which directly affects the performance of such an approach — is not specified in the standard. Previous studies propose a simple GMA which is based on the idea to use as low number of groups as possible. However, when the content of groups changes very fast, the overhead is high. In this paper, we propose and study an enhanced GMA which manyfold reduces the overhead. We develop an analytical model to evaluate the proposed GMA performance and to find its optimal parameters. We also obtain an explicit formula for the optimal parameters in the asymptotic case. We show that such asymptotically optimal parameters, which do not depend on traffic parameters, provide low overhead in non-asymptotic case as well. Thus, the proposed GMA can be easily implemented without any complex method for parameters adjustment.1
Various networking protocols disseminate much control information. An important task is to reduce the amount of such information in order to free channel resources for user data. In the paper, we study a novel group-based approach for dissemination of control information introduced in the latest version of the IEEE 802.11 standard. The key idea of this approach is to join various pieces of information into a small number of groups and send differential updates related only to those groups which content is changed. However, the group management algorithm (GMA) which directly affects the performance of such an approach is not specified. We consider a simple GMA, develop an analytical model to estimate the amount of sent control information, and show that this amount is significantly less than for the classical full dump approach.