English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

To address the exponentially increasing data rate demands of end users,necessitates efficient spectrum allocation among co-existing operators inlicensed and unlicensed spectrum bands to cater to the temporal and spatialvariations of traffic in the wireless network. In this paper, we address thespectrum allocation problem among non-cooperative operators via auctions. Theclassical Vickrey-Clarke-Groves (VCG) approach provides the framework for astrategy-proof and social welfare maximizing auction at high computationalcomplexity, which makes it infeasible for practical implementation. We proposesealed bid auction mechanisms for spectrum allocation which are computationallytractable and hence applicable for allocating spectrum by performing auctionsin short durations as per the dynamic load variations of the network. Weestablish that the proposed algorithm is strategy-proof for uniform demand.Furthermore, for non-uniform demand we propose an algorithm that satisfies weakstrategy-proofness. We also consider non-linear increase in the marginalvaluations with demand. Simulation results are presented to exhibit theperformance comparison of the proposed algorithms with VCG and other existingmechanisms.

Strategy-Proof Spectrum Allocation among Multiple Operators for Demand Varying Wireless Networks