A Game Theoretic Analysis of Incentives in Content Production and Sharing over Peer-to-Peer Networks

User-generated content can be distributed at a low cost using peer-to-peer (P2P) networks, but the free-rider problem hinders the utilization of P2P networks. In order to achieve an efficient use of P2P networks, we investigate fundamental issues on incentives in content production and sharing using game theory. We build a basic model to analyze non-cooperative outcomes without an incentive scheme and then use different game formulations derived from the basic model to examine five incentive schemes: cooperative, payment, repeated interaction, intervention, and enforced full sharing. The results of this paper show that 1) cooperative peers share all produced content while non-cooperative peers do not share at all without an incentive scheme; 2) a cooperative scheme allows peers to consume more content than non-cooperative outcomes do; 3) a cooperative outcome can be achieved among non-cooperative peers by introducing an incentive scheme based on payment, repeated interaction, or intervention; and 4) enforced full sharing has ambiguous welfare effects on peers. In addition to describing the solutions of different formulations, we discuss enforcement and informational requirements to implement each solution, aiming to offer a guideline for protocol designers when designing incentive schemes for P2P networks.Comment: 31 pages, 3 figures, 1 tabl

When Mobile Blockchain Meets Edge Computing

Blockchain, as the backbone technology of the current popular Bitcoin digital currency, has become a promising decentralized data management framework. Although blockchain has been widely adopted in many applications, e.g., finance, healthcare, and logistics, its application in mobile services is still limited. This is due to the fact that blockchain users need to solve preset proof-of-work puzzles to add new data, i.e., a block, to the blockchain. Solving the proof-of-work, however, consumes substantial resources in terms of CPU time and energy, which is not suitable for resource-limited mobile devices. To facilitate blockchain applications in future mobile Internet of Things systems, multiple access mobile edge computing appears to be an auspicious solution to solve the proof-of-work puzzles for mobile users. We first introduce a novel concept of edge computing for mobile blockchain. Then, we introduce an economic approach for edge computing resource management. Moreover, a prototype of mobile edge computing enabled blockchain systems is presented with experimental results to justify the proposed concept.Comment: Accepted by IEEE Communications Magazin

Congestion control in multi-serviced heterogeneous wireless networks using dynamic pricing

Includes bibliographical references.Service providers, (or operators) employ pricing schemes to help provide desired QoS to subscribers and to maintain profitability among competitors. An economically efficient pricing scheme, which will seamlessly integrate users’ preferences as well as service providers’ preferences, is therefore needed. Else, pricing schemes can be viewed as promoting social unfairness in the dynamically priced network. However, earlier investigations have shown that the existing dynamic pricing schemes do not consider the users’ willingness to pay (WTP) before the price of services is determined. WTP is the amount a user is willing to pay based on the worth attached to the service requested. There are different WTP levels for different subscribers due to the differences in the value attached to the services requested and demographics. This research has addressed congestion control in the heterogeneous wireless network (HWN) by developing a dynamic pricing scheme that efficiently incentivises users to utilize radio resources. The proposed Collaborative Dynamic Pricing Scheme (CDPS), which identifies the users and operators’ preference in determining the price of services, uses an intelligent approach for controlling congestion and enhancing both the users’ and operators’ utility. Thus, the CDPS addresses the congestion problem by firstly obtaining the users WTP from users’ historical response to price changes and incorporating the WTP factor to evaluate the service price. Secondly, it uses a reinforcement learning technique to illustrate how a price policy can be obtained for the enhancement of both users and operators’ utility, as total utility reward obtained increases towards a defined ‘goal state’

Byzantine Attack and Defense in Cognitive Radio Networks: A Survey

The Byzantine attack in cooperative spectrum sensing (CSS), also known as the spectrum sensing data falsification (SSDF) attack in the literature, is one of the key adversaries to the success of cognitive radio networks (CRNs). In the past couple of years, the research on the Byzantine attack and defense strategies has gained worldwide increasing attention. In this paper, we provide a comprehensive survey and tutorial on the recent advances in the Byzantine attack and defense for CSS in CRNs. Specifically, we first briefly present the preliminaries of CSS for general readers, including signal detection techniques, hypothesis testing, and data fusion. Second, we analyze the spear and shield relation between Byzantine attack and defense from three aspects: the vulnerability of CSS to attack, the obstacles in CSS to defense, and the games between attack and defense. Then, we propose a taxonomy of the existing Byzantine attack behaviors and elaborate on the corresponding attack parameters, which determine where, who, how, and when to launch attacks. Next, from the perspectives of homogeneous or heterogeneous scenarios, we classify the existing defense algorithms, and provide an in-depth tutorial on the state-of-the-art Byzantine defense schemes, commonly known as robust or secure CSS in the literature. Furthermore, we highlight the unsolved research challenges and depict the future research directions.Comment: Accepted by IEEE Communications Surveys and Tutoiral