BRADFORD SCHOLARS

    • Sign in
    View Item 
    •   Bradford Scholars
    • Engineering and Informatics
    • Engineering and Informatics Publications
    • View Item
    •   Bradford Scholars
    • Engineering and Informatics
    • Engineering and Informatics Publications
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of Bradford ScholarsCommunitiesAuthorsTitlesSubjectsPublication DateThis CollectionAuthorsTitlesSubjectsPublication Date

    My Account

    Sign in

    HELP

    Bradford Scholars FAQsCopyright Fact SheetPolicies Fact SheetDeposit Terms and ConditionsDigital Preservation Policy

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    A Framework for Dynamic Selection of Backoff Stages during Initial Ranging Process in Wireless Networks

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    View/Open
    Main article (716.8Kb)
    Download
    Publication date
    2017
    End of Embargo
    2018-08-07
    Author
    Mufti, Muhammad R.
    Afzal, Humaira
    Awan, Irfan U.
    Cullen, Andrea J.
    Keyword
    Customer premises equipment; Contention window; Ranging request collision probability; Average ranging success delay; Wireless networks; Backoff process
    Rights
    © 2017 Elsevier. Reproduced in accordance with the publisher's self-archiving policy. This manuscript version is made available under the CC-BY-NC-ND 4.0 license.
    Peer-Reviewed
    yes
    
    Metadata
    Show full item record
    Abstract
    The only available solution in the IEEE 802.22 standard for avoiding collision amongst various contending customer premises equipment (CPEs) attempting to associate with a base station (BS) is binary exponential random backoff process in which the contending CPEs retransmit their association requests. The number of attempts the CPEs send their requests to the BS are fixed in an IEEE 802.22 network. This paper presents a mathematical framework that helps the BS in determining at which attempt the majority of the CPEs become part of the wireless regional area network from a particular number of contending CPEs. Based on a particular attempt, the ranging request collision probability for any number of contending CPEs with respect to contention window size is approximated. The numerical results validate the effectiveness of the approximation. Moreover, the average ranging success delay experienced by the majority of the CPEs is also determined.
    URI
    http://hdl.handle.net/10454/12900
    Version
    Accepted Manuscript
    Citation
    Mufti MR, Afzal H, Awan I and Cullen A (2017) A framework for dynamic selection of backoff stages during initial ranging process in wireless networks. Journal of Systems and Software.133: 17-27.
    Link to publisher’s version
    https://doi.org/10.1016/j.jss.2017.08.013
    Type
    Article
    Notes
    The full text will be available at the end of the publisher's embargo: 7th Aug 2018
    Collections
    Engineering and Informatics Publications

    entitlement

     
    DSpace software (copyright © 2002 - 2023)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.