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

Handle URI:
http://hdl.handle.net/10754/348538
Title:
Self-Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks
Authors:
Elwhishi, Ahmed; Ho, Pin-Han; Naik, K.; Shihada, Basem ( 0000-0003-4434-4334 )
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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
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
Issue Date:
Jul-2013
DOI:
10.1109/TPDS.2012.23
Type:
Article
ISSN:
1045-9219
Additional Links:
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6127867
Appears in Collections:
Articles; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorElwhishi, Ahmeden
dc.contributor.authorHo, Pin-Hanen
dc.contributor.authorNaik, K.en
dc.contributor.authorShihada, Basemen
dc.date.accessioned2015-04-06T08:29:41Zen
dc.date.available2015-04-06T08:29:41Zen
dc.date.issued2013-07en
dc.identifier.citationSelf-Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks 2013, 24 (7):1422 IEEE Transactions on Parallel and Distributed Systemsen
dc.identifier.issn1045-9219en
dc.identifier.doi10.1109/TPDS.2012.23en
dc.identifier.urihttp://hdl.handle.net/10754/348538en
dc.description.abstractThis 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.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.relation.urlhttp://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6127867en
dc.rights© 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.en
dc.titleSelf-Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networksen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalIEEE Transactions on Parallel and Distributed Systemsen
dc.eprint.versionPost-printen
dc.contributor.institutionUniversity of Waterloo, 33-375 Kingscourt DR., Waterloo, ON N2K 3N7, Canadaen
dc.contributor.institutionDepartment of Electrical and Computer Engineering, University of Waterloo, 200 University Avenue West, Waterloo, Ontario N2L 3G1, Canadaen
kaust.authorShihada, Basemen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.