• 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

    ARBR: Adaptive reinforcement-based routing for DTN

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    Collaborative RL_DTN_paper_IEEE_WiMob.pdf
    Size:
    444.5Kb
    Format:
    PDF
    Description:
    Accepted Manuscript
    Download
    Type
    Conference Paper
    Authors
    Elwhishi, Ahmed
    Pin-Han Ho
    Naik, K.
    Shihada, Basem cc
    KAUST Department
    Computer Science Program
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Networks Laboratory (NetLab)
    Date
    2010-10
    Permanent link to this record
    http://hdl.handle.net/10754/350278
    
    Metadata
    Show full item record
    Abstract
    This paper introduces a novel routing protocol in Delay Tolerant Networks (DTNs), aiming to solve the online distributed routing problem. By manipulating a collaborative reinforcement learning technique, a group of nodes can cooperate with each other and make a forwarding decision for the stored messages based on a cost function at each contact with another node. The proposed protocol is characterized by not only considering the contact time statistics under a novel contact model, but also looks into the feedback on user behavior and network conditions, such as congestion and buffer occupancy sampled during each previous contact with any other node. Therefore, the proposed protocol can achieve high efficiency via an adaptive and intelligent routing mechanism according to network conditions. Extensive simulation is conducted to verify the proposed protocol, where a comparison is made with a number of existing encounter-based routing protocols in term of the number of transmissions of each message, message delivery delay, and delivery ratio. The results of the simulation demonstrate the effectiveness of the proposed technique.
    Citation
    Elwhishi, Ahmed, Pin-Han Ho, K. Naik, and Basem Shihada. "ARBR: Adaptive reinforcement-based routing for DTN." In Wireless and Mobile Computing, Networking and Communications (WiMob), 2010 IEEE 6th International Conference on, pp. 376-385. IEEE, 2010.
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Journal
    2010 IEEE 6th International Conference on Wireless and Mobile Computing, Networking and Communications
    Conference/Event name
    6th Annual IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob'2010
    DOI
    10.1109/WIMOB.2010.5645040
    Additional Links
    http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5645040
    ae974a485f413a2113503eed53cd6c53
    10.1109/WIMOB.2010.5645040
    Scopus Count
    Collections
    Conference Papers; 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.