The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we introduce the diversity of extortion by setting individuals' extortion capacities related to their degrees and study the evolution of cooperation on the heterogeneous BA scale-free network with the normalized payoff mechanism. We find that when individuals' extortion factors are negatively correlation with their degrees, extortioners can act as catalysts to make cooperation dominate...
This article investigates the problem of distributed channel selection in opportunistic spectrum access networks from a perspective of interference minimization. The traditional physical (PHY)-layer interference model is for information theoretic analysis. When practical multiple access mechanisms are considered, the recently developed binary medium access control (MAC)-layer interference model in...
In this paper we study the channel selection problem with dynamic users in distributed opportunistic spectrum access systems. Different with the ordinary assumption that users have data to transmit all the time, we assume that users transmit data randomly in each slot. The dynamical transmitting model makes the active number of users time-varying and channel interference levels dynamic. It makes a...
This article investigates the problem of distributed spectrum resource allocation in the ultra-dense small cell networks, which takes the different loads of small cell base stations (SBSs) into consideration. Here, we simplify the load as the number of active users served by a SBS. We formulate the problem of load-aware channel selection as a graphical game and propose a distributed learning algorithm...
This article investigates the problem of efficient distributed dynamic spectrum access in self-organizing networks with goe-location database, using a game theoretic approach. In particular, we propose a novel utility function, which aims to complete the data transmission of users and improve the satisfactory level of network by considering the efficient use of TV White-space Spectrum (TVWS) resource...
The objective function of a cognitive network is the basis for optimizing its operation parameters. However, one kind of attack, named OFA (Objective Function Attack), could exploit some cognitive characters to disrupt the optimizing process, which will result in the operation parameters deviating from the optimal value. Existed defense strategies for OFA mainly focus on verifying the fluctuation...
This paper researches and compares the questions of the output competition and cooperation of the manufacturers between two color TV supply chains under the Cournot and Stackelberg game models. By studying we succeeded in finding the scope of the output cooperation distribution coefficient being required by both sides of the game for realizing the outputs cooperation. Further more, we extend the two...
Differing from some past studies methods, this paper studies the question of price competition from the angle of the starting point of contesting market shares of the manufacturers between two color TV supply chains under the Stackelberg game model. By the study we succeed in getting the prerequisite of the price reduction and its equilibrium result of price competition of the two color TV manufactures...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.