Favor-aware distributed spectrum allocation via compressive skycube query

In the practical wireless cognitive radio networks (CRNs), the secondary users (SUs) usually show different favors to spectrum attributes, which brings new challenges to spectrum allocation. How to reduce the communication cost and allocate the spectrum according to favors is a meaningful topic. Prior skycube solution, which consists of all possible non-empty skylines, is not suitable for power-limited and resource-scarce CRNs. Aiming at eliminating redundant transmission and allocating spectrum reasonably, we propose a favor-aware distributed spectrum allocation algorithm (FA-DSA) based on compressive skycube query. The main idea is to ignore the information which may not affect the allocation results and only transmit the information which SUs may be interested in. FA-DSA is implemented in three stages: grouping, query and allocation. Grouping is to divide the users into groups according to their different favors, and quering stage is to implement compressive skycube query. After getting the query results, in the allocating stage SUs will make the allocation decision jointly while avoiding conflict with each other. The simulations measure the performance of our approach and show the advantage of FA-DSA in terms of reducing communication cost for query and allocation.