226 research outputs found

    Resource Allocation and Pricing in Secondary Dynamic Spectrum Access Networks

    Get PDF
    The paradigm shift from static spectrum allocation to a dynamic one has opened many challenges that need to be addressed for the true vision of Dynamic Spectrum Access (DSA) to materialize. This dissertation proposes novel solutions that include: spectrum allocation, routing, and scheduling in DSA networks. First, we propose an auction-based spectrum allocation scheme in a multi-channel environment where secondary users (SUs) bid to buy channels from primary users (PUs) based on the signal to interference and noise ratio (SINR). The channels are allocated such that i) the SUs get their preferred channels, ii) channels are re-used, and iii) there is no interference. Then, we propose a double auction-based spectrum allocation technique by considering multiple bids from SUs and heterogeneity of channels. We use virtual grouping of conflict-free buyers to transform multi-unit bids to single-unit bids. For routing, we propose a market-based model where the PUs determine the optimal price based on the demand for bandwidth by the SUs. Routes are determined through a series of price evaluations between message senders and forwarders. Also, we consider auction-based routing for two cases where buyers can bid for only one channel or they could bid for a combination of non-substitutable channels. For a centralized DSA, we propose two scheduling algorithms-- the first one focuses on maximizing the throughput and the second one focuses on fairness. We extend the scheduling algorithms to multi-channel environment. Expected throughput for every channel is computed by modelling channel state transitions using a discrete-time Markov chain. The state transition probabilities are calculated which occur at the frame/slot boundaries. All proposed algorithms are validated using simulation experiments with different network settings and their performance are studied

    PS-TRUST: Provably Secure Solution for Truthful Double Spectrum Auctions

    Full text link
    Truthful spectrum auctions have been extensively studied in recent years. Truthfulness makes bidders bid their true valuations, simplifying greatly the analysis of auctions. However, revealing one's true valuation causes severe privacy disclosure to the auctioneer and other bidders. To make things worse, previous work on secure spectrum auctions does not provide adequate security. In this paper, based on TRUST, we propose PS-TRUST, a provably secure solution for truthful double spectrum auctions. Besides maintaining the properties of truthfulness and special spectrum reuse of TRUST, PS-TRUST achieves provable security against semi-honest adversaries in the sense of cryptography. Specifically, PS-TRUST reveals nothing about the bids to anyone in the auction, except the auction result. To the best of our knowledge, PS-TRUST is the first provably secure solution for spectrum auctions. Furthermore, experimental results show that the computation and communication overhead of PS-TRUST is modest, and its practical applications are feasible.Comment: 9 pages, 4 figures, submitted to Infocom 201

    FlexAuc: Serving Dynamic Demands in a Spectrum Trading Market with Flexible Auction

    Full text link
    In secondary spectrum trading markets, auctions are widely used by spectrum holders (SHs) to redistribute their unused channels to secondary wireless service providers (WSPs). As sellers, the SHs design proper auction schemes to stimulate more participants and maximize the revenue from the auction. As buyers, the WSPs determine the bidding strategies in the auction to better serve their end users. In this paper, we consider a three-layered spectrum trading market consisting of the SH, the WSPs and the end users. We jointly study the strategies of the three parties. The SH determines the auction scheme and spectrum supplies to optimize its revenue. The WSPs have flexible bidding strategies in terms of both demands and valuations considering the strategies of the end users. We design FlexAuc, a novel auction mechanism for this market to enable dynamic supplies and demands in the auction. We prove theoretically that FlexAuc not only maximizes the social welfare but also preserves other nice properties such as truthfulness and computational tractability.Comment: 11 pages, 7 figures, Preliminary version accepted in INFOCOM 201

    SMART: Coordinated Double-Sided Seal Bid Multiunit First Price Auction Mechanism for Cloud-Based TVWS Secondary Spectrum Market

    Get PDF
    Spectrum trading is an important aspect of television white space (TVWS) and it is driven by the failure of spectrum sensing techniques. In spectrum trading, the primary users lease their unoccupied spectrum to the secondary users for a market fee. Although spectrum trading is considered as a reliable approach, it is confronted with a spectrum transaction completion time problem, which negatively impacts on end-users Quality of Service and Quality of Experience metrics. Spectrum transaction completion time is the duration to successfully conduct TVWS spectrum trading. To address this issue, this paper proposes simple mechanism auction reward truthful (SMART), a fast and iterative machine learning-assisted spectrum trading model to address this issue. Simulated results indicate thatSMART out-performs referenced VERUM algorithm in three key performance indicators: bit-error rate, instantaneous throughput, and probability of dropped packets by 10%, 5%, and 15%, respectively

    Integration of Blockchain and Auction Models: A Survey, Some Applications, and Challenges

    Get PDF
    In recent years, blockchain has gained widespread attention as an emerging technology for decentralization, transparency, and immutability in advancing online activities over public networks. As an essential market process, auctions have been well studied and applied in many business fields due to their efficiency and contributions to fair trade. Complementary features between blockchain and auction models trigger a great potential for research and innovation. On the one hand, the decentralized nature of blockchain can provide a trustworthy, secure, and cost-effective mechanism to manage the auction process; on the other hand, auction models can be utilized to design incentive and consensus protocols in blockchain architectures. These opportunities have attracted enormous research and innovation activities in both academia and industry; however, there is a lack of an in-depth review of existing solutions and achievements. In this paper, we conduct a comprehensive state-of-the-art survey of these two research topics. We review the existing solutions for integrating blockchain and auction models, with some application-oriented taxonomies generated. Additionally, we highlight some open research challenges and future directions towards integrated blockchain-auction models
    • …
    corecore