No abstract

Control channel is used to transmit protocol or signal information between wireless network nodes and is a key component of wireless network. Compared with data information, protocol or signal information is usually much less, so the spectrum bandwidth requirement of control channel is also much less than that of data channel. In order to optimize the usage of the limited spectrum resources, this paper focuses on the issue of control channel selection. We propose a greedy algorithm which minimizes the total spectrum bandwidth of the set of control channels. Theoretical analysis proves that the proposed algorithm can achieve the optimal set of control whose sum of the spectrum bandwidth is the minimum. Simulation results also show that the proposed algorithm consumes less spectrum resources than other algorithms in the same wireless network environment.

In this paper, we discuss several cost-sharing methods for cover-set games, for example, approximately budget-balanced, in the core, and/or strategyproof. Different from the traditional set cover game, in cover-set game, the elements stand for services, and each agent is both a service provider and receiver. In this study, for unselfish agents, we design a cost allocation method that can recover no less than [Formula: see text] fraction of the total cost, where [Formula: see text] and [Formula: see text] is the maximum number of receiving services among all agents. In addition, for agents who are selfish service providers with privately known valuations, we present a strategyproof charging mechanism, further, the total cost is no more than [Formula: see text] times that of an optimal solution.