• 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 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 mobility prediction routing for intermittently connected mobile networks

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Predict_forward.pdf
    Size:
    637.7Kb
    Format:
    PDF
    Description:
    Accepted Manuscript
    Download
    Thumbnail
    Name:
    11276_2013_588_MOESM1_ESM.pdf
    Size:
    26.11Kb
    Format:
    PDF
    Description:
    Supplemental files
    Download
    Type
    Article
    Authors
    Elwhishi, Ahmed
    Ho, Pin-Han
    Shihada, Basem cc
    KAUST Department
    Computer Science Program
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Networks Laboratory (NetLab)
    Date
    2013-04-26
    Online Publication Date
    2013-04-26
    Print Publication Date
    2013-11
    Permanent link to this record
    http://hdl.handle.net/10754/348504
    
    Metadata
    Show full item record
    Abstract
    This paper introduces a novel multi-copy routing protocol, called predict and forward (PF), for delay tolerant networks, which aims to explore the possibility of using mobile nodes as message carriers for end-to-end delivery of the messages. With PF, the message forwarding decision is made by manipulating the probability distribution of future inter-contact and contact durations based on the network status, including wireless link condition and nodal buffer availability. In particular, PF is based on the observations that the node mobility behavior is semi-deterministic and could be predicted once there is sufficient mobility history information. We implemented the proposed protocol and compared it with a number of existing encounter-based routing approaches in terms of delivery delay, delivery ratio, and the number of transmissions required for message delivery. The simulation results show that PF outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.
    Citation
    Contention aware mobility prediction routing for intermittently connected mobile networks 2013, 19 (8):2093 Wireless Networks
    Publisher
    Springer Nature
    Journal
    Wireless Networks
    DOI
    10.1007/s11276-013-0588-7
    Additional Links
    http://link.springer.com/10.1007/s11276-013-0588-7
    ae974a485f413a2113503eed53cd6c53
    10.1007/s11276-013-0588-7
    Scopus Count
    Collections
    Articles; Computer Science Program; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  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.