• English
    • العربية
  • العربية
  • Login
  • QU
  • QU Library
  •  Home
  • Communities & Collections
  • Help
    • Item Submission
    • Publisher policies
    • User guides
    • FAQs
  • About QSpace
    • Vision & Mission
View Item 
  •   Qatar University Digital Hub
  • Qatar University Institutional Repository
  • Academic
  • Faculty Contributions
  • College of Engineering
  • Computer Science & Engineering
  • View Item
  • Qatar University Digital Hub
  • Qatar University Institutional Repository
  • Academic
  • Faculty Contributions
  • College of Engineering
  • Computer Science & Engineering
  • View Item
  •      
  •  
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Coalitional double auction for spatial spectrum allocation in cognitive radio networks

    Thumbnail
    Date
    2014-06
    Author
    Sun, Gaofei
    Feng, Xinxin
    Tian, Xiaohua
    Gan, Xiaoying
    Xu, Youyun
    Wang, Xinbing
    Guizani, Mohsen
    ...show more authors ...show less authors
    Metadata
    Show full item record
    Abstract
    Recently, many dynamic spectrum allocation schemes based on economics are proposed to improve spectrum utilization in cognitive radio networks (CRNs). However, existing mechanisms do not take into account the economic efficiency and the spatial reusability simultaneously, which leaves room to further enhance the spectrum efficiency. In this paper, we introduce the coalition double auction for efficient spectrum allocation in CRNs, where secondary users (SUs) are partitioned into several coalitions and the spectrum reusability can be executed within each coalition. The partition formation process is not only related to the interference condition between SUs, but also the expected economic goals. Therefore, we propose a fully-economic spatial spectrum allocation mechanism by incorporating the coalition formation approach with auction theory. With the proposed scheme, the primary operator acts as an auctioneer, who performs multiple virtual auctions to form a stable partition of SUs and conducts a final auction to decide the winning SUs. Moreover, we propose a possible operation rules for the primary operator to iteratively change the partition, and prove that the virtual auctions could converge in finite time. Comprehensive theoretical analysis and simulation results are presented to show that our scheme can satisfy the crucial economic robustness properties of double auction, and outperform existing mechanisms.
    DOI/handle
    http://dx.doi.org/10.1109/TWC.2013.042114.130952
    http://hdl.handle.net/10576/4467
    Collections
    • Computer Science & Engineering [‎2428‎ items ]

    entitlement


    Qatar University Digital Hub is a digital collection operated and maintained by the Qatar University Library and supported by the ITS department

    Contact Us | Send Feedback
    Contact Us | Send Feedback | QU

     

     

    Home

    Submit your QU affiliated work

    Browse

    All of Digital Hub
      Communities & Collections Publication Date Author Title Subject Type Language Publisher
    This Collection
      Publication Date Author Title Subject Type Language Publisher

    My Account

    Login

    Statistics

    View Usage Statistics

    About QSpace

    Vision & Mission

    Help

    Item Submission Publisher policiesUser guides FAQs

    Qatar University Digital Hub is a digital collection operated and maintained by the Qatar University Library and supported by the ITS department

    Contact Us | Send Feedback
    Contact Us | Send Feedback | QU

     

     

    Video