Economic-Based Incentive Schemes for Dynamic Data Management in Mobile P2P Computing

Data management in mobile peer to peer (M-P2P) systems needs dynamic data management due to mobility and fragile wireless connection connecting resource constraint devices. Traditional methods of data management and services in mobile P2P environment generally assume all peers to cooperate. Since peer activities in M-P2P are not generally monitored, users assume that they are free to use the resources anyway they like. Under this feeling of freedom, a subset of users (free riders) begins to consume much more resources available on M-P2P than they wish to contribute. In addition, due to the dynamic nature of moving hosts, topology changes very often and traditional schemes fall short in providing reasonable data availability. This becomes much more important in M-P2P where the network communication is generally multi-hop and intermediate peers have to render relay services other than data providers to improve the connectivity. Economic-based incentive schemes have been proposed which may play a better role in inciting free riders to collaborate. The data and service availability can be increased by associating a price with data items and services. In such schemes, peers can bid for better services, intermediate peers can earn incentives by providing relay services and in fact, outgoing peers can lease data items to others to still earn incentives while disconnected. New peers can become data providers by providing hosting services to earn incentives. This tutorial will explore issues involved in managing resources using economic incentives

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

Analysis of a Reputation System for Mobile Ad-Hoc Networks with Liars

The application of decentralized reputation systems is a promising approach to ensure cooperation and fairness, as well as to address random failures and malicious attacks in Mobile Ad-Hoc Networks. However, they are potentially vulnerable to liars. With our work, we provide a first step to analyzing robustness of a reputation system based on a deviation test. Using a mean-field approach to our stochastic process model, we show that liars have no impact unless their number exceeds a certain threshold (phase transition). We give precise formulae for the critical values and thus provide guidelines for an optimal choice of parameters.Comment: 17 pages, 6 figure

Peer-to-Peer Networks and Computation: Current Trends and Future Perspectives

This research papers examines the state-of-the-art in the area of P2P networks/computation. It attempts to identify the challenges that confront the community of P2P researchers and developers, which need to be addressed before the potential of P2P-based systems, can be effectively realized beyond content distribution and file-sharing applications to build real-world, intelligent and commercial software systems. Future perspectives and some thoughts on the evolution of P2P-based systems are also provided

Transforming Energy Networks via Peer to Peer Energy Trading: Potential of Game Theoretic Approaches

Peer-to-peer (P2P) energy trading has emerged as a next-generation energy management mechanism for the smart grid that enables each prosumer of the network to participate in energy trading with one another and the grid. This poses a significant challenge in terms of modeling the decision-making process of each participant with conflicting interest and motivating prosumers to participate in energy trading and to cooperate, if necessary, for achieving different energy management goals. Therefore, such decision-making process needs to be built on solid mathematical and signal processing tools that can ensure an efficient operation of the smart grid. This paper provides an overview of the use of game theoretic approaches for P2P energy trading as a feasible and effective means of energy management. As such, we discuss various games and auction theoretic approaches by following a systematic classification to provide information on the importance of game theory for smart energy research. Then, the paper focuses on the P2P energy trading describing its key features and giving an introduction to an existing P2P testbed. Further, the paper zooms into the detail of some specific game and auction theoretic models that have recently been used in P2P energy trading and discusses some important finding of these schemes.Comment: 38 pages, single column, double spac