Dynamic Spectrum Auction with Time Optimization in Cognitive Radio Networks

Wu, Guangen; Ren, Pinyi; Du, Qinghe

doi:10.1109/vtcfall.2012.6398966

Cited by 5 publications

(3 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed scheme was based on Privacy Preserving Bid Submission Protocol (PPBS) and Private Spectrum Distribution Protocol (PSD) to help deal with the problem of privacy that may occur during the auction process. A dynamic auction with auction period optimisation was considered in [18]. A double-auction process for spectrum allocation for both the buyer-side and seller-side that achieves truthfulness, individual rationality and budgetbalance was proposed in [19].…”

Section: Introductionmentioning

confidence: 99%

Energy Efficient Spectrum Auction Process with Utility Functions

Oloyede

Grace

2017

Wireless Pers Commun

View full text Add to dashboard Cite

The concept of green payments together with single and multiple bidding processes for short-term spectrum auctions are compared based on two reference cases: (1) when the users and the auctioneer are aware of the value of the reserve price, and (2) when the value of the reserve price is known only to the auctioneer. This involves a novel concept known as the green payment. This concept is combined with the use of probabilities to determine the users participating in the auction process. The purpose of the green payment and the probability is to help in reducing the amount of energy wasted as a result of the auction process. The utility of each user and that of the wireless service provider with and without the green payment is also examined. The revenue obtained from each of the examined models is also compared to determine which model is more profitable for the WSP. This paper shows that the use of multiple bidding process for short-term spectrum auctions gives a better performance measure when compared to the single bidding process, more particularly when the value of the reserve price is known to the auctioneer and the users in the system. It also shows that using the proposed probability equation in combination with the concept of the green payment helps in reducing the amount of energy consumed by the system.

show abstract

Section: Introductionmentioning

confidence: 99%

Energy Efficient Spectrum Auction Process with Utility Functions

Oloyede

Grace

2017

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…In these researches, according to rational characteristics of game players, they are divided into two types of complete rationality and bounded rationality. Complete rationality denotes that users immediately select strategies to maximize their reward and corresponding researches include: the price and auction model in the game are proposed to access spectrum correspondingly [3,4]; Li et al [5] a coalitional game theoretic approach is proposed to conduct spectrum access; Wang et al [6] investigate two game theoretical mechanism design methods to suppress collusion and cheating behavior of selfish users; Xu et al [7] make opportunistic spectrum access reach global optimization using two local interaction games. On the other hand, bounded rationality is defined as that the ability is limited and information obtained is not complete for game players, and they do not always follow the principle of utility maximization.…”

Section: Introductionmentioning

confidence: 99%

Dynamic Spectrum Access Mechanism Based on Graphical Evolutionary Game in Radio Network

Yuan

Zhu

et al. 2015

Wireless Pers Commun

View full text Add to dashboard Cite

In order to realize efficient data transmission for multiple bounded rationality users sharing multiple channels in radio network, a dynamic spectrum access mechanism based on graphical evolutionary game is proposed to describe user's dynamic process for distributing transmission rate. The mechanism can reflect the real game relationship among users, thus simplifying the complexity of the game. Meanwhile, a dynamic spectrum access algorithm with smaller complexity and corresponding dynamic equation are designed for the mechanism, converging to Nash equilibrium with faster speed and obtaining higher system throughput. At Nash equilibrium, the reward of individual user is identical on each channel. Theory analyzes and proves that the dynamic equation is globally asymptotically stable, which illustrates that when user deviates because of bounded rationality, it is still able to converge again with faster speed and guarantee better performance with less deviation, and user's deviation only affects its neighboring users, not spreading to the whole network. Simulation comparison verifies the superiority above.

show abstract

“…This allocation method assumes that robots are completely rational, so it does not consider the benefits of the individual robot. Auction [ 5 , 6 ] is a fast and effective method of negotiation; when applying it into multirobot task allocation, robots can ensure the maximization of the overall benefits, at the same time considering their own benefits. Eric and Ofear [ 7 ] give up the ideas from traditional auction methods to pursue optimal task allocation strategy, so this paper focuses on the study of how to use robots efficiently in each team and how to prevent robots interfering with each other in the process of task execution, as well as how to execute the allocated tasks efficiently based on auction.…”

Section: Introductionmentioning

confidence: 99%

Research on Multirobot Pursuit Task Allocation Algorithm Based on Emotional Cooperation Factor

Fang

Wang

et al. 2014

The Scientific World Journal

View full text Add to dashboard Cite

Multirobot task allocation is a hot issue in the field of robot research. A new emotional model is used with the self-interested robot, which gives a new way to measure self-interested robots' individual cooperative willingness in the problem of multirobot task allocation. Emotional cooperation factor is introduced into self-interested robot; it is updated based on emotional attenuation and external stimuli. Then a multirobot pursuit task allocation algorithm is proposed, which is based on emotional cooperation factor. Combined with the two-step auction algorithm recruiting team leaders and team collaborators, set up pursuit teams, and finally use certain strategies to complete the pursuit task. In order to verify the effectiveness of this algorithm, some comparing experiments have been done with the instantaneous greedy optimal auction algorithm; the results of experiments show that the total pursuit time and total team revenue can be optimized by using this algorithm.

show abstract

Dynamic Spectrum Auction with Time Optimization in Cognitive Radio Networks

Cited by 5 publications

References 23 publications

Energy Efficient Spectrum Auction Process with Utility Functions

Energy Efficient Spectrum Auction Process with Utility Functions

Dynamic Spectrum Access Mechanism Based on Graphical Evolutionary Game in Radio Network

Research on Multirobot Pursuit Task Allocation Algorithm Based on Emotional Cooperation Factor

Contact Info

Product

Resources

About