اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMobility-Aware Seamless Handover with MPTCP in Software-Defined HetNets
77
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, the problem of vertical handover in software-defined network (SDN) based heterogeneous networks (HetNets) is studied. In the studied model, HetNets are required to offer diverse services for mobile users. Using an SDN controller, HetNets have the capability of managing users access and mobility issues but still have the problems of ping-pong effect and service interruption during vertical handover. To solve these problems, a mobility-aware seamless handover method based on multipath transmission control protocol (MPTCP) is proposed. The proposed handover method is executed in the controller of the software-defined HetNets (SDHetNets) and consists of three steps: location prediction, network selection, and handover execution. In particular, the method first predicts the users location in the next moment with an echo state network (ESN). Given the predicted location, the SDHetNet controller can determine the candidate network set for the handover to pre-allocate network wireless resources. Second, the target network is selected through fuzzy analytic hierarchical process (FAHP) algorithm, jointly considering user preferences, service requirements, network attributes, and user mobility patterns. Then, seamless handover is realized through the proposed MPTCP-based handover mechanism. Simulations using real-world user trajectory data from Korea Advanced Institute of Science & Technology show that the proposed method can reduce the handover times by 10.85% to 29.12% compared with traditional methods. The proposed method also maintains at least one MPTCP subflow connected during the handover process and achieves a seamless handover.
قيم البحث
اقرأ أيضاً
Recently, Multipath TCP (MPTCP) has been proposed as an alternative transport approach for datacenter networks. MPTCP provides the ability to split a flow into multiple paths thus providing better performance and resilience to failures. Usually, MPTC
P is combined with flow-based Equal-Cost Multi-Path Routing (ECMP), which uses random hashing to split the MPTCP subflows over different paths. However, random hashing can be suboptimal as distinct subflows may end up using the same paths, while other available paths remain unutilized. In this paper, we explore an MPTCP-aware SDN controller that facilitates an alternative routing mechanism for the MPTCP subflows. The controller uses packet inspection to provide deterministic subflow assignment to paths. Using the controller, we show that MPTCP can deliver significantly improved performance when connections are not limited by the access links of hosts. To lessen the effect of throughput limitation due to access links, we also investigate the usage of multiple interfaces at the hosts. We demonstrate, using our modification of the MPTCP Linux Kernel, that using multiple subflows per pair of IP addresses can yield improved performance in multi-interface settings.
Software-defined networking (SDN) provides an agile and programmable way to optimize radio access networks via a control-data plane separation. Nevertheless, reaping the benefits of wireless SDN hinges on making optimal use of the limited wireless fr
onthaul capacity. In this work, the problem of fronthaul-aware resource allocation and user scheduling is studied. To this end, a two-timescale fronthaul-aware SDN control mechanism is proposed in which the controller maximizes the time-averaged network throughput by enforcing a coarse correlated equilibrium in the long timescale. Subsequently, leveraging the controllers recommendations, each base station schedules its users using Lyapunov stochastic optimization in the short timescale, i.e., at each time slot. Simulation results show that significant network throughput enhancements and up to 40% latency reduction are achieved with the aid of the SDN controller. Moreover, the gains are more pronounced for denser network deployments.
Software-defined networking (SDN) is the concept of decoupling the control and data planes to create a flexible and agile network, assisted by a central controller. However, the performance of SDN highly depends on the limitations in the fronthaul wh
ich are inadequately discussed in the existing literature. In this paper, a fronthaul-aware software-defined resource allocation mechanism is proposed for 5G wireless networks with in-band wireless fronthaul constraints. Considering the fronthaul capacity, the controller maximizes the time-averaged network throughput by enforcing a coarse correlated equilibrium (CCE) and incentivizing base stations (BSs) to locally optimize their decisions to ensure mobile users (MUs) quality-of-service (QoS) requirements. By marrying tools from Lyapunov stochastic optimization and game theory, we propose a two-timescale approach where the controller gives recommendations, i.e., sub-carriers with low interference, in a long-timescale whereas BSs schedule their own MUs and allocate the available resources in every time slot. Numerical results show considerable throughput enhancements and delay reductions over a non-SDN network baseline.
Drone-mounted base stations (DBSs) are promising solutions to provide ubiquitous connections to users and support many applications in the fifth generation of mobile networks while full duplex communications has the potential to improve the spectrum
efficiency. In this paper, we have investigated the backhaul-aware uplink communications in a full-duplex DBS-aided HetNet (BUD) problem with the objective to maximize the total throughput of the network, and this problem is decomposed into two sub-problems: the DBS Placement problem (including the vertical dimension and horizontal dimensions) and the joint UE association, power and bandwidth assignment (Joint-UPB) problem. Since the BUD problem is NP-hard, we propose approximation algorithms to solve the sub-problems and another, named the AA-BUD algorithm, to solve the BUD problem with guaranteed performance. The performance of the AA-BUD algorithm has been demonstrated via extensive simulations, and it is superior to two benchmark algorithms with up to 45.8% throughput improvement.
Machine-to-machine (M2M) communications have attracted great attention from both academia and industry. In this paper, with recent advances in wireless network virtualization and software-defined networking (SDN), we propose a novel framework for M2M
communications in software-defined cellular networks with wireless network virtualization. In the proposed framework, according to different functions and quality of service (QoS) requirements of machine-type communication devices (MTCDs), a hypervisor enables the virtualization of the physical M2M network, which is abstracted and sliced into multiple virtual M2M networks. Moreover, we formulate a decision-theoretic approach to optimize the random access process of M2M communications. In addition, we develop a feedback and control loop to dynamically adjust the number of resource blocks (RBs) that are used in the random access phase in a virtual M2M network by the SDN controller. Extensive simulation results with different system parameters are presented to show the performance of the proposed scheme.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
