1,277 research outputs found

    Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks

    Full text link
    Future wireless networks have a substantial potential in terms of supporting a broad range of complex compelling applications both in military and civilian fields, where the users are able to enjoy high-rate, low-latency, low-cost and reliable information services. Achieving this ambitious goal requires new radio techniques for adaptive learning and intelligent decision making because of the complex heterogeneous nature of the network structures and wireless services. Machine learning (ML) algorithms have great success in supporting big data analytics, efficient parameter estimation and interactive decision making. Hence, in this article, we review the thirty-year history of ML by elaborating on supervised learning, unsupervised learning, reinforcement learning and deep learning. Furthermore, we investigate their employment in the compelling applications of wireless networks, including heterogeneous networks (HetNets), cognitive radios (CR), Internet of things (IoT), machine to machine networks (M2M), and so on. This article aims for assisting the readers in clarifying the motivation and methodology of the various ML algorithms, so as to invoke them for hitherto unexplored services as well as scenarios of future wireless networks.Comment: 46 pages, 22 fig

    Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey

    Full text link
    Wireless sensor networks (WSNs) consist of autonomous and resource-limited devices. The devices cooperate to monitor one or more physical phenomena within an area of interest. WSNs operate as stochastic systems because of randomness in the monitored environments. For long service time and low maintenance cost, WSNs require adaptive and robust methods to address data exchange, topology formulation, resource and power optimization, sensing coverage and object detection, and security challenges. In these problems, sensor nodes are to make optimized decisions from a set of accessible strategies to achieve design goals. This survey reviews numerous applications of the Markov decision process (MDP) framework, a powerful decision-making tool to develop adaptive algorithms and protocols for WSNs. Furthermore, various solution methods are discussed and compared to serve as a guide for using MDPs in WSNs

    Efficient Traffic Management Algorithms for the Core Network using Device-to-Device Communication and Edge Caching

    Get PDF
    Exponentially growing number of communicating devices and the need for faster, more reliable and secure communication are becoming major challenges for current mobile communication architecture. More number of connected devices means more bandwidth and a need for higher Quality of Service (QoS) requirements, which bring new challenges in terms of resource and traffic management. Traffic offload to the edge has been introduced to tackle this demand-explosion that let the core network offload some of the contents to the edge to reduce the traffic congestion. Device-to-Device (D2D) communication and edge caching, has been proposed as promising solutions for offloading data. D2D communication refers to the communication infrastructure where the users in proximity communicate with each other directly. D2D communication improves overall spectral efficiency, however, it introduces additional interference in the system. To enable D2D communication, efficient resource allocation must be introduced in order to minimize the interference in the system and this benefits the system in terms of bandwidth efficiency. In the first part of this thesis, low complexity resource allocation algorithm using stable matching is proposed to optimally assign appropriate uplink resources to the devices in order to minimize interference among D2D and cellular users. Edge caching has recently been introduced as a modification of the caching scheme in the core network, which enables a cellular Base Station (BS) to keep copies of the contents in order to better serve users and enhance Quality of Experience (QoE). However, enabling BSs to cache data on the edge of the network brings new challenges especially on deciding on which and how the contents should be cached. Since users in the same cell may share similar content-needs, we can exploit this temporal-spatial correlation in the favor of caching system which is referred to local content popularity. Content popularity is the most important factor in the caching scheme which helps the BSs to cache appropriate data in order to serve the users more efficiently. In the edge caching scheme, the BS does not know the users request-pattern in advance. To overcome this bottleneck, a content popularity prediction using Markov Decision Process (MDP) is proposed in the second part of this thesis to let the BS know which data should be cached in each time-slot. By using the proposed scheme, core network access request can be significantly reduced and it works better than caching based on historical data in both stable and unstable content popularity

    Collaborative Vehicular Edge Computing Networks: Architecture Design and Research Challenges

    Get PDF
    The emergence of augmented reality (AR), autonomous driving and other new applications have greatly enriched the functionality of the vehicular networks. However, these applications usually require complex calculations and large amounts of storage, which puts tremendous pressure on traditional vehicular networks. Mobile edge computing (MEC) is proposed as a prospective technique to extend computing and storage resources to the edge of the network. Combined with MEC, the computing and storage capabilities of the vehicular network can be further enhanced. Therefore, in this paper, we explore the novel collaborative vehicular edge computing network (CVECN) architecture. We first review the work related to MEC and vehicular networks. Then we discuss the design principles of CVECN. Based on the principles, we present the detailed CVECN architecture, and introduce the corresponding functional modules, communication process, as well as the installation and deployment ideas. Furthermore, the promising technical challenges, including collaborative coalition formation, collaborative task offloading and mobility management, are presented. And some potential research issues for future research are highlighted. Finally, simulation results are verified that the proposed CVECN can significantly improve network performance

    Exploring intelligent service migration in a highly mobile network

    Get PDF
    Mobile services allow services to be migrated or replicated closer to users as they move around. This is now regarded as a viable mechanism to provide good Quality of Service to users in highly mobile environments such as vehicular networks. The vehicular environment is rapidly becoming a significant part of the internet and this presents various challenges that must be addressed; this is due to continuous handovers as mobile devices change their point of attachment to these networks resulting in a loss of service. Therefore, this explains the need to build a framework for intelligent service migration. This thesis addresses these issues. It starts by discussing the requirements for intelligent service migration. Then it investigates a low latency Quality of Service Aware Framework as well as an experimental transport protocol that would be favoured by vehicular networks. Furthermore, two analytical models are developed using the Zero-Server Markov Chain technique which is a way of analysing scenarios when the server is not continuously available to serve. Using the Zero-Server Markov Chain, the first analytical model looks at lost service due to continuous handovers and the communication dynamics of vehicular networks, while the second model analyses how service migration affects service delivery in these networks. Formulas are developed to yield the average number of packets in the system, the response time, the probability of blocking and a new parameter called the probability of lost service. These formulas are then applied to the Middlesex VANET Testbed to look at reactive and proactive service migration. These techniques are then incorporated into a new Service Management Framework to provide sustainable Quality of Service and Quality of Experience to mobile users in vehicular networks. This thesis also shows that this new approach is better than current approaches as it addresses key issues in intelligent service migration in such environments, and hence can play a significant part in the development of Intelligent Transport Systems for Smart Cities
    corecore