Socially Trusted Collaborative Edge Computing in Ultra Dense Networks

Small cell base stations (SBSs) endowed with cloud-like computing capabilities are considered as a key enabler of edge computing (EC), which provides ultra-low latency and location-awareness for a variety of emerging mobile applications and the Internet of Things. However, due to the limited computation resources of an individual SBS, providing computation services of high quality to its users faces significant challenges when it is overloaded with an excessive amount of computation workload. In this paper, we propose collaborative edge computing among SBSs by forming SBS coalitions to share computation resources with each other, thereby accommodating more computation workload in the edge system and reducing reliance on the remote cloud. A novel SBS coalition formation algorithm is developed based on the coalitional game theory to cope with various new challenges in small-cell-based edge systems, including the co-provisioning of radio access and computing services, cooperation incentives, and potential security risks. To address these challenges, the proposed method (1) allows collaboration at both the user-SBS association stage and the SBS peer offloading stage by exploiting the ultra dense deployment of SBSs, (2) develops a payment-based incentive mechanism that implements proportionally fair utility division to form stable SBS coalitions, and (3) builds a social trust network for managing security risks among SBSs due to collaboration. Systematic simulations in practical scenarios are carried out to evaluate the efficacy and performance of the proposed method, which shows that tremendous edge computing performance improvement can be achieved.Comment: arXiv admin note: text overlap with arXiv:1010.4501 by other author

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

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

Improving shared access to Cloud of Things resources.

Cloud of Things (CoT) is an emerging paradigm that integrates Cloud Computing and Internet of Things (IoT) to support a wide range of real-world applications. Resource allocation plays a vital role in CoT, especially when allocating IoT physical resources to Cloud-based applications to ensure seamless application execution. Due to the heterogeneity and the constrained capacities of IoT resources, resource allocation is a challenge. This complexity leads to missing/limiting shared access to the IoT physical resources and consequently lessen the reusability of the resources across multiple applications. This issue results in, 1) replicating IoT deployments making them expensive and not feasible for many prospective users, 2) existing IoT infrastructures are over-provisioned to meet the unpredictable application requirements in which resources may be significantly underutilised, and 3) the adoption of CoT is slowed. Improving shared access to CoT resources can provide efficient resource allocation, improve resource utilisation and likely to reduce the cost of IoT deployments. Existing solutions include small-scale, hardware and platform-dependent mechanisms to enable or improve shared access to IoT resources. The research presented in this thesis considers trading CoT resources in a marketplace as an approach to improve shared access to CoT resources. It proposes a solution to Cot resource allocation that re-imagines CoT resources as commodities that can be provided and consumed by the marketplace participants. The novel contributions of the research presented in this thesis are summarised as follows: 1) a model to describe and quantify the value of CoT resources, 2) a resource sharing and allocation strategy called Exclusive Shared Access (ESA) to CoT resources, 3) a QoS-aware optimisation model for trading CoT resources as a single and multipleobjective optimisation problem, and 4) a marketplace architecture and experimental evaluation to verify its performance and scalability

AMACoT: a marketplace architecture for trading Cloud of Things resources

Cloud of Things (CoT) is increasingly viewed as a paradigm that can satisfy the diverse requirements of emerging IoT applications. The potential of CoT is not yet realised due to challenges in sharing and reusing IoT physical resources across multiple applications. Existing approaches provide small-scale and hardware-dependent shared access to IoT resources. This paper considers using market mechanisms to commoditise CoT resources as the approach to enable shared access to CoT resources and to improve their reusability. In order to achieve this, the requirements for trading CoT resources are discussed to conceptualise the proposed approach. A generic description model for CoT resource is introduced to quantify the value of CoT resources. In this paper, a marketplace architecture for trading CoT resources referred to as AMACoT is proposed. By formulating the trading of CoT resources as an optimisation problem, the proposed approach is experimentally validated. The evaluation measures the system performance and verifies the optimisation problem using three evolutionary algorithms. The evaluation of the optimisation algorithms demonstrates the optimality of trading CoT resources solutions in terms of resource cost, resource utilisation, provider lock-in and provider profit

An Energy-driven Network Function Virtualization for Multi-domain Software Defined Networks

Network Functions Virtualization (NFV) in Software Defined Networks (SDN) emerged as a new technology for creating virtual instances for smooth execution of multiple applications. Their amalgamation provides flexible and programmable platforms to utilize the network resources for providing Quality of Service (QoS) to various applications. In SDN-enabled NFV setups, the underlying network services can be viewed as a series of virtual network functions (VNFs) and their optimal deployment on physical/virtual nodes is considered a challenging task to perform. However, SDNs have evolved from single-domain to multi-domain setups in the recent era. Thus, the complexity of the underlying VNF deployment problem in multi-domain setups has increased manifold. Moreover, the energy utilization aspect is relatively unexplored with respect to an optimal mapping of VNFs across multiple SDN domains. Hence, in this work, the VNF deployment problem in multi-domain SDN setup has been addressed with a primary emphasis on reducing the overall energy consumption for deploying the maximum number of VNFs with guaranteed QoS. The problem in hand is initially formulated as a "Multi-objective Optimization Problem" based on Integer Linear Programming (ILP) to obtain an optimal solution. However, the formulated ILP becomes complex to solve with an increasing number of decision variables and constraints with an increase in the size of the network. Thus, we leverage the benefits of the popular evolutionary optimization algorithms to solve the problem under consideration. In order to deduce the most appropriate evolutionary optimization algorithm to solve the considered problem, it is subjected to different variants of evolutionary algorithms on the widely used MOEA framework (an open source java framework based on multi-objective evolutionary algorithms).Comment: Accepted for publication in IEEE INFOCOM 2019 Workshop on Intelligent Cloud Computing and Networking (ICCN 2019

Optimal deployments of defense mechanisms for the internet of things

Internet of Things (IoT) devices can be exploited by the attackers as entry points to break into the IoT networks without early detection. Little work has taken hybrid approaches that combine different defense mechanisms in an optimal way to increase the security of the IoT against sophisticated attacks. In this work, we propose a novel approach to generate the strategic deployment of adaptive deception technology and the patch management solution for the IoT under a budget constraint. We use a graphical security model along with three evaluation metrics to measure the effectiveness and efficiency of the proposed defense mechanisms. We apply the multi-objective genetic algorithm (GA) to compute the {\em Pareto optimal} deployments of defense mechanisms to maximize the security and minimize the deployment cost. We present a case study to show the feasibility of the proposed approach and to provide the defenders with various ways to choose optimal deployments of defense mechanisms for the IoT. We compare the GA with the exhaustive search algorithm (ESA) in terms of the runtime complexity and performance accuracy in optimality. Our results show that the GA is much more efficient in computing a good spread of the deployments than the ESA, in proportion to the increase of the IoT devices

Applications of Repeated Games in Wireless Networks: A Survey

A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference