• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesTitleAuthorsKAUST AuthorsIssue DateSubmit DateSubjectsThis CollectionTitleAuthorsKAUST AuthorsIssue DateSubmit DateSubjects

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguidePlumX LibguideSubmit an Item

    Statistics

    Display statistics

    Self-Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    saur.pdf
    Size:
    994.2Kb
    Format:
    PDF
    Description:
    Accepted Manuscript
    Download
    Type
    Article
    Authors
    Elwhishi, Ahmed
    Ho, Pin-Han
    Naik, K.
    Shihada, Basem cc
    KAUST Department
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Date
    2013-07
    Permanent link to this record
    http://hdl.handle.net/10754/348538
    
    Metadata
    Show full item record
    Abstract
    This paper introduces a novel multicopy routing protocol, called Self-Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of devices in miniature such as smart phones of heterogeneous capacities in terms of energy resources and buffer spaces. SAURP is characterized by the ability of identifying potential opportunities for forwarding messages to their destinations via a novel utility function-based mechanism, in which a suite of environment parameters, such as wireless channel condition, nodal buffer occupancy, and encounter statistics, are jointly considered. Thus, SAURP can reroute messages around nodes experiencing high-buffer occupancy, wireless interference, and/or congestion, while taking a considerably small number of transmissions. The developed utility function in SAURP is proved to be able to achieve optimal performance, which is further analyzed via a stochastic modeling approach. Extensive simulations are conducted to verify the developed analytical model and compare the proposed SAURP with a number of recently reported encounter-based routing approaches in terms of delivery ratio, delivery delay, and the number of transmissions required for each message delivery. The simulation results show that SAURP outperforms all the counterpart multicopy encounter-based routing protocols considered in the study.
    Citation
    Self-Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks 2013, 24 (7):1422 IEEE Transactions on Parallel and Distributed Systems
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Journal
    IEEE Transactions on Parallel and Distributed Systems
    ISSN
    1045-9219
    DOI
    10.1109/TPDS.2012.23
    Additional Links
    http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6127867
    ae974a485f413a2113503eed53cd6c53
    10.1109/TPDS.2012.23
    Scopus Count
    Collections
    Articles; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2019  DuraSpace
    Quick Guide | Contact Us | Send Feedback
    Open Repository is a service hosted 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. For anonymous users the allowed maximum amount is 50 search results.

    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.