• 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.

    Efficient Channel Allocation Scheme with Triangle Communication

    Thumbnail
    Date
    2009-05-26
    Author
    Sungbum, Hong
    Malluhi, Q.
    Jacob, T.
    Metadata
    Show full item record
    Abstract
    Radio is a valuable resource for wireless/mobile communication systems. In this paper, we present an efficient algorithm using a novel triangle communication model to synchronize processes effectively by searching for free channels for wireless mobile communication systems. A geographical area controlled by a mobile switching center (MSC) is divided into many small hexagonal regions called cells. Each cell in a sub-cluster can effectively collect channel information from the first tier of co-channel cells through the triangle communication model. The performance of the communication model is characterized in terms of message complexity, response time and failure locality. For fair evaluation, we introduce a novel metric, which is called accumulated failure locality (AFL). The triangle communication model improves message complexity,response time and AFL of the algorithm. With AFL, we examine our algorithm, and produce an AFL vector. We discuss the algorithm and prove its correctness. We also show that the algorithm requires at most O(Nsc) messages,where Nsc is the number of cells in a sub-cluster.This is compared to the algorithms (Boukerche et al., 2002) which requires O((Ng)2), where Ng is the number of channel groups in the large bandwidth allocated to the system.
    DOI/handle
    http://dx.doi.org/10.1109/ICN.2009.64
    http://hdl.handle.net/10576/10461
    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