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

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Contention Aware Routing for Intermittently Connected Mobile Networks

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    SAURP_IEEE_afin011.pdf
    Size:
    372.2Kb
    Format:
    PDF
    Description:
    Accepted Manuscript
    Download
    Type
    Conference Paper
    Authors
    Elwhishi, Ahmed
    Ho, Pin Han
    Naik, Sagar
    Shihada, Basem cc
    KAUST Department
    Computer Science Program
    Date
    2011-08-21
    Permanent link to this record
    http://hdl.handle.net/10754/362172
    
    Metadata
    Show full item record
    Abstract
    This paper introduces a novel multi-copy routing protocol, called Self Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of miniature devices such as smart phones, hand-held devices, and sensors mounted in fixed or mobile objects. SAURP aims to explore the possibility of taking mobile nodes as message carriers in order for end-to-end delivery of the messages. The best carrier for a message is determined by the prediction result using a novel contact model, where the network status, including wireless link condition and nodal buffer availability, are jointly considered. The paper argues and proves that the nodal movement and the predicted collocation with the message recipient can serve as meaningful information to achieve an intelligent message forwarding decision at each node. The proposed protocol has been implemented and compared with a number of existing encounter-based routing approaches in terms of delivery delay, and the number of transmissions required for message delivery. The simulation results show that the proposed SAURP outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.
    Citation
    Elwhishi, Ahmed, Pin-Han Ho, Sagar Naik, and Basem Shihada. "Contention aware routing for intermittently connected mobile networks." In AFIN 2011, the third international conference on advances in future internet, pp. 8-15. 2011.
    Publisher
    IARIA
    Journal
    AFIN 2011, the third international conference on advances in future internet
    Additional Links
    http://www.thinkmind.org/index.php?view=article&articleid=afin_2011_1_20_70014
    Collections
    Conference Papers; Computer Science Program

    entitlement

     
    DSpace software copyright © 2002-2022  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    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.