A Coalition Formation Game in Partition Form for Peer-to-Peer File Sharing Networks

In current peer-to-peer file sharing networks, a large number of peers with heterogeneous connections simultaneously seek to download resources, e.g., files or file fragments, from a common seed at the time these resources become available, which incurs high download delays on the different peers. Unlike existing literature which mainly focused on cooperative strategies for data exchange between different peers after all the peers have already acquired their resources, in this paper, we study the cooperation possibilities among a number of peers seeking to download, concurrently, a number of resources at the time the availability of the resources is initially announced at a common seed. We model the problem as a coalitional game in partition form and we propose an algorithm for coalition formation among the peers. The proposed algorithm enables the peers to take autonomous decisions to join or leave a coalition while minimizing their average download delay. We show that, by using the proposed algorithm, a Nash-stable partition composed of coalitions of peers is formed. Within every coalition, the peers distribute their download requests between the seed and the cooperating partners in a way to minimize the total average delay incurred on the coalition. Analytically, we study the 2-peer scenario and derive the optimal download request distribution policies. Simulation results show that, using the proposed coalition formation game, the peers can improve their average download delay per peer of up to 99.6% compared to the non-cooperative approach for the case with N = 15 peers

Game-theoretic Resource Allocation Methods for Device-to-Device (D2D) Communication

Device-to-device (D2D) communication underlaying cellular networks allows mobile devices such as smartphones and tablets to use the licensed spectrum allocated to cellular services for direct peer-to-peer transmission. D2D communication can use either one-hop transmission (i.e., in D2D direct communication) or multi-hop cluster-based transmission (i.e., in D2D local area networks). The D2D devices can compete or cooperate with each other to reuse the radio resources in D2D networks. Therefore, resource allocation and access for D2D communication can be treated as games. The theories behind these games provide a variety of mathematical tools to effectively model and analyze the individual or group behaviors of D2D users. In addition, game models can provide distributed solutions to the resource allocation problems for D2D communication. The aim of this article is to demonstrate the applications of game-theoretic models to study the radio resource allocation issues in D2D communication. The article also outlines several key open research directions.Comment: Accepted. IEEE Wireless Comms Mag. 201

Resource Allocation for Device-to-Device Communications Underlaying Heterogeneous Cellular Networks Using Coalitional Games

Heterogeneous cellular networks (HCNs) with millimeter wave (mmWave) communications included are emerging as a promising candidate for the fifth generation mobile network. With highly directional antenna arrays, mmWave links are able to provide several-Gbps transmission rate. However, mmWave links are easily blocked without line of sight. On the other hand, D2D communications have been proposed to support many content based applications, and need to share resources with users in HCNs to improve spectral reuse and enhance system capacity. Consequently, an efficient resource allocation scheme for D2D pairs among both mmWave and the cellular carrier band is needed. In this paper, we first formulate the problem of the resource allocation among mmWave and the cellular band for multiple D2D pairs from the view point of game theory. Then, with the characteristics of cellular and mmWave communications considered, we propose a coalition formation game to maximize the system sum rate in statistical average sense. We also theoretically prove that our proposed game converges to a Nash-stable equilibrium and further reaches the near-optimal solution with fast convergence rate. Through extensive simulations under various system parameters, we demonstrate the superior performance of our scheme in terms of the system sum rate compared with several other practical schemes.Comment: 13 pages, 12 figure

Cross-layer optimization for cooperative content distribution in multihop device-to-device networks

With the ubiquity of wireless network and the intelligentization of machines, Internet of Things (IoT) has come to people's horizon. Device-to-device (D2D), as one advanced technique to achieve the vision of IoT, supports a high speed peer-to-peer transmission without fixed infrastructure forwarding which can enable fast content distribution in local area. In this paper, we address the content distribution problem by multihop D2D communication with decentralized content providers locating in the networks. We consider a cross-layer multidimension optimization involving frequency, space, and time, to minimize the network average delay. Considering the multicast feature, we first formulate the problem as a coalitional game based on the payoffs of content requesters, and then, propose a time-varying coalition formation-based algorithm to spread the popular content within the shortest possible time. Simulation results show that the proposed approach can achieve a fast content distribution across the whole area, and the performance on network average delay is much better than other heuristic approaches

A Self-Tuning procedure for resource management in InterCloud Computing

Beijing Key Laboratory on Integration and Analysis of Large-scale Stream Data, College of Computer Science, North China University of Technology, Beijing, China The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.InterCloud Computing is a new cloud paradigm designed to guarantee service quality or performance and availability of on-demand resources. InterCloud enables cloud interoperability by promoting the interworking of cloud systems from different cloud providers using standard interfacing. Resource management in InterCloud, considered as an important functional requirement, has not attracted commensurate research attention. The focus of this paper is to propose a Software Cybernetic approach, in the form of an adaptive control framework, for efficient management of shared resources in peer-to-peer InterCloud computing. This research effort adopts cooperative game theory to model resource management in InterCloud. The space of cooperative arrangements (resource sharing) between the participant cloud systems is presented by using Integer Partitioning to characterise the worst case communication complexity in peer to peer InterCloud. Essentially, this paper presents an Integer partition based anytime algorithm as an optimal cost solution to the bi-objective optimisation problem in resource management, anchored principally on practical trade-off between the desired performance (quality of service) and communication complexity of collaborating resource clouds

Energy aware and privacy preserving protocols for ad hoc networks with applications to disaster management

Disasters can have a serious impact on the functioning of communities and societies. Disaster management aims at providing efficient utilization of resources during pre-disaster (e.g. preparedness and prevention) and post-disaster (e.g. recovery and relief) scenarios to reduce the impact of disasters. Wireless sensors have been extensively used for early detection and prevention of disasters. However, the sensor\u27s operating environment may not always be congenial to these applications. Attackers can observe the traffic flow in the network to determine the location of the sensors and exploit it. For example, in intrusion detection systems, the information can be used to identify coverage gaps and avoid detection. Data source location privacy preservation protocols were designed in this work to address this problem. Using wireless sensors for disaster preparedness, recovery and relief operations can have high deployment costs. Making use of wireless devices (e.g. smartphones and tablets) widely available among people in the affected region is a more practical approach. Disaster preparedness involves dissemination of information among the people to make them aware of the risks they will face in the event of a disaster and how to actively prepare for them. The content is downloaded by the people on their smartphones and tablets for ubiquitous access. As these devices are primarily constrained by their available energy, this work introduces an energy-aware peer-to-peer file sharing protocol for efficient distribution of the content and maximizing the lifetime of the devices. Finally, the ability of the wireless devices to build an ad hoc network for capturing and collecting data for disaster relief and recovery operations was investigated. Specifically, novel energy-adaptive mechanisms were designed for autonomous creation of the ad hoc network, distribution of data capturing task among the devices, and collection of data with minimum delay --Abstract, page iii

Collocation Games and Their Application to Distributed Resource Management

We introduce Collocation Games as the basis of a general framework for modeling, analyzing, and facilitating the interactions between the various stakeholders in distributed systems in general, and in cloud computing environments in particular. Cloud computing enables fixed-capacity (processing, communication, and storage) resources to be offered by infrastructure providers as commodities for sale at a fixed cost in an open marketplace to independent, rational parties (players) interested in setting up their own applications over the Internet. Virtualization technologies enable the partitioning of such fixed-capacity resources so as to allow each player to dynamically acquire appropriate fractions of the resources for unencumbered use. In such a paradigm, the resource management problem reduces to that of partitioning the entire set of applications (players) into subsets, each of which is assigned to fixed-capacity cloud resources. If the infrastructure and the various applications are under a single administrative domain, this partitioning reduces to an optimization problem whose objective is to minimize the overall deployment cost. In a marketplace, in which the infrastructure provider is interested in maximizing its own profit, and in which each player is interested in minimizing its own cost, it should be evident that a global optimization is precisely the wrong framework. Rather, in this paper we use a game-theoretic framework in which the assignment of players to fixed-capacity resources is the outcome of a strategic "Collocation Game". Although we show that determining the existence of an equilibrium for collocation games in general is NP-hard, we present a number of simplified, practically-motivated variants of the collocation game for which we establish convergence to a Nash Equilibrium, and for which we derive convergence and price of anarchy bounds. In addition to these analytical results, we present an experimental evaluation of implementations of some of these variants for cloud infrastructures consisting of a collection of multidimensional resources of homogeneous or heterogeneous capacities. Experimental results using trace-driven simulations and synthetically generated datasets corroborate our analytical results and also illustrate how collocation games offer a feasible distributed resource management alternative for autonomic/self-organizing systems, in which the adoption of a global optimization approach (centralized or distributed) would be neither practical nor justifiable.NSF (CCF-0820138, CSR-0720604, EFRI-0735974, CNS-0524477, CNS-052016, CCR-0635102); Universidad Pontificia Bolivariana; COLCIENCIAS–Instituto Colombiano para el Desarrollo de la Ciencia y la Tecnología "Francisco José de Caldas

Low-latency Data Uploading in D2D-enabled Cellular Networks

指導教員：姜　暁