Хоров Евгений Михайлович

What Is the Fastest Way to Connect Stations to a Wi-Fi HaLow Network?

2018 · ARTICLE · en

Wi-Fi HaLow is an adaptation of the widespread Wi-Fi technology for the Internet of Things scenarios. Such scenarios often involve numerous wireless stations connected to a shared channel, and contention for the channel significantly affects the performance in such networks. Wi-Fi HaLow contains numerous solutions aimed at handling the contention between stations, two of which, namely, the Centralized Authentication Control (CAC) and the Distributed Authentication Control (DAC), address the contention reduction during the link set-up process. The link set-up process is special because the access point knows nothing of the connecting stations and its means of control of these stations are very limited. While DAC is self-adaptive, CAC does require an algorithm to dynamically control its parameters. Being just a framework, the Wi-Fi HaLow standard neither specifies such an algorithm nor recommends which protocol, CAC or DAC, is more suitable in a given situation. In this paper, we solve both issues by developing a novel robust close-to-optimal algorithm for CAC and compare CAC and DAC in a vast set of experiments.

Radio Resource and Traffic Management for Ultra-Reliable Low Latency Communications

2018 · CHAPTER · en

Ultra-Reliable Low Latency Communications (URLLC) is an important feature of 5G networks which cannot be enabled without redesigning the architecture of cellular networks. While most activities in 3GPP are focused on developing low-layer functionality, such as modulation and coding schemes, OFDMA numerology, fast hybrid automatic repeat request, in the paper, we study the influence of upper-layer functionality - specifically, resource allocation and traffic management algorithms - on URLLC performance. Although such algorithms cannot enable ultra-high reliability and ultra-low latency, with accurate system level simulations we show that the proper choice of such algorithms can significantly improve network capacity for URLLC traffic.

Анализ эффективности метода последовательных обновлений при рассылке служебной информации в беспроводных сетях

2018 · ARTICLE · ru

Во многих сценариях использования беспроводных сетей необходимо осуществ- лять рассылку большого объема служебной информации, что значительно снижает долю канальных ресурсов, доступных для передачи пользовательских данных. Эта проблема особенно остро проявляется в сетях с высокой плотностью устройств, сенсорных сетях, а также сетях с высокой мобильностью, таких как сети транспортных средств и беспилот- ных летательных аппаратов. Существует несколько методов рассылки служебной инфор- мации. В данной работе проводится исследование перспективного метода рассылки, осно- ванного на том, что станции в служебных сообщениях отправляют не всю информацию, а только обновления, произошедшие с момента отправки предыдущего сообщения (метод последовательных обновлений). Построена аналитическая модель данного метода рассыл- ки, позволяющая оценить средний объем рассылаемой информации, а также надежность и оперативность ее доставки соседним станциям. На основе построенной модели разра- ботан алгоритм адаптивного выбора параметров рассылки. С помощью имитационного моделирования в среде NS-3 показано, что использование разработанного алгоритма поз- воляет обеспечить минимальный объем рассылки при выполнении заданных ограничений на надежность и оперативность доставки информации.

Analytical study of incremental approach for information dissemination in wireless networks

2018 · CHAPTER · en

In many scenarios, control information dissemination becomes a bottleneck, which limits the scalability and the performance of wireless networks. Such a problem is especially crucial in mobile ad hoc networks, dense networks, networks of vehicles and drones, sensor networks. In other words, this problem occurs in any scenario with frequent changes in topology or interference level on one side and with strong requirements on delay, reliability, power consumption, or capacity on the other side. If the control information changes partially, it may be worth sending only differential updates instead of messages containing full information to reduce overhead. However, such an approach needs accurate tuning of dissemination parameters, since it is necessary to guarantee information relevance in error-prone wireless networks. In the paper, we provide a deep study of two approaches for generating differential updates - namely, incremental and cumulative - and compare their efficiency. We show that the incremental approach allows significantly reducing the amount of generated control information compared to the cumulative one, while providing the same level of information relevance. We develop an analytical model for the incremental approach and propose an algorithm which allows tuning its parameters, depending on the number of nodes in the network, their mobility, and wireless channel quality. Using the developed analytical model, we show that the incremental approach is very useful for static dense network deployments and networks with low and medium mobility, since it allows us to significantly reduce the amount of control information compared to the classical full dump approach.

Mathematical Study of QoS-aware Multicast Streaming in Wi-Fi Networks

2018 · CHAPTER · en

tbd

Ultra-Reliable Low Latency Communications in Future Wi-Fi Networks

2018 в печати · CHAPTER · en

Ultra Reliable Low Latency Communications (URLLC) is an important challenge for the next generation wireless networks, which poses very strict requirements to the delay and packet loss ratio. Satisfaction is hardly possible without introducing additional functionality to the existing communication technologies. In the paper, we propose and study an approach to enable URLLC in Wi-Fi networks by exploiting an additional radio similar to that of 802.11ba. We develop a mathematical model of a heterogeneous network with devices transmitting regular and URLLC data. With the model, we evaluate the efficiency of the proposed approach in terms of delay for URLLC traffic and throughput available for non-URLLC traffic. We show that our approach allows decreasing the delay by orders of magnitude, while the throughput is reduced insignificantly.

Scheduling for Downlink Non-Orthogonal Multiple Access in Wi-Fi Networks

2018 · CHAPTER · en

Analytical study of incremental approach for information dissemination in wireless networks

2018 · CHAPTER · en

In many scenarios, control information dissemination becomes a bottleneck, which limits the scalability and the performance of wireless networks. Such a problem is especially crucial in mobile ad hoc networks, dense networks, networks of vehicles and drones, sensor networks. In other words, this problem occurs in any scenario with frequent changes in topology or interference level on one side and with strong requirements on delay, reliability, power consumption, or capacity on the other side. If the control information changes partially, it may be worth sending only differential updates instead of messages containing full information to reduce overhead. However, such an approach needs accurate tuning of dissemination parameters, since it is necessary to guarantee information relevance in error-prone wireless networks. In the paper, we provide a deep study of two approaches for generating differential updates - namely, incremental and cumulative - and compare their efficiency. We show that the incremental approach allows significantly reducing the amount of generated control information compared to the cumulative one, while providing the same level of information relevance. We develop an analytical model for the incremental approach and propose an algorithm which allows tuning its parameters, depending on the number of nodes in the network, their mobility, and wireless channel quality. Using the developed analytical model, we show that the incremental approach is very useful for static dense network deployments and networks with low and medium mobility, since it allows us to significantly reduce the amount of control information compared to the classical full dump approach.

Анализ эффективности метода последовательных обновлений при рассылке служебной информации в беспроводных сетях

2018 · ARTICLE · ru

Во многих сценариях использования беспроводных сетей необходимо осуществ- лять рассылку большого объема служебной информации, что значительно снижает долю канальных ресурсов, доступных для передачи пользовательских данных. Эта проблема особенно остро проявляется в сетях с высокой плотностью устройств, сенсорных сетях, а также сетях с высокой мобильностью, таких как сети транспортных средств и беспилот- ных летательных аппаратов. Существует несколько методов рассылки служебной инфор- мации. В данной работе проводится исследование перспективного метода рассылки, осно- ванного на том, что станции в служебных сообщениях отправляют не всю информацию, а только обновления, произошедшие с момента отправки предыдущего сообщения (метод последовательных обновлений). Построена аналитическая модель данного метода рассыл- ки, позволяющая оценить средний объем рассылаемой информации, а также надежность и оперативность ее доставки соседним станциям. На основе построенной модели разра- ботан алгоритм адаптивного выбора параметров рассылки. С помощью имитационного моделирования в среде NS-3 показано, что использование разработанного алгоритма поз- воляет обеспечить минимальный объем рассылки при выполнении заданных ограничений на надежность и оперативность доставки информации.

Analysis of the Differential Update Method for Control Information Dissemination in Wireless Networks

2018 · ARTICLE · en

Various wireless networks scenarios involve dissemination of large amounts of control information. This limits the channel resources available for transmission of the user data. This problem is especially crucial in dense networks, sensor networks, and high-mobility networks (e.g., networks of vehicles and drones). Several methods for dissemination of control information are known. This study is focused on the promising method called differential update. The idea behind it is that control messages sent by stations should contain only the information modified since the transmission of the previous message. An analytical model of this method has been developed. It allows one to estimate the average amount of transmitted control information and the reliability and promptness of its delivery to neighboring stations. An algorithm for adaptive tuning of parameters of the differential update method has been developed on the basis of this model. Simulation results obtained with NS-3 simulator demonstrate that the proposed algorithm minimizes the amount of sent control information while satisfying the set of requirements on reliability and promptness of its delivery.