Message Scheduling and Forwarding in Congested DTNs

Handle URI:
http://hdl.handle.net/10754/362174
Title:
Message Scheduling and Forwarding in Congested DTNs
Authors:
Elwhishi, Ahmed; Ho, Pin-Han; Shihada, Basem ( 0000-0003-4434-4334 )
Abstract:
Multi-copy utility-based routing has been considered as one of the most applicable approaches to effective message delivery in Delay Tolerant Networks (DTNs). By allowing multiple message replicas launched, the ratio of message delivery or delay can be significantly reduced compared with other counterparts. Such an advantage, nonetheless, is at the expense of taking more buffer space at each node and higher complexity in message forwarding decisions. This paper investigates an efficient message scheduling and dropping policy via analytical modeling approach, aiming to achieve optimal performance in terms of message delivery delay. Extensive simulation results, based on a synthetic mobility model and real mobility traces, show that the proposed scheduling framework can achieve superb performance against its counterparts in terms of delivery delay.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Citation:
Elwhishi, Ahmed, Pin-Han Ho, and Basem Shihada. "Message Scheduling and Forwarding in Congested DTNs." In AFIN 2012, The Fourth International Conference on Advances in Future Internet, pp. 26-31. 2012.
Publisher:
IARIA
Journal:
AFIN 2012, The Fourth International Conference on Advances in Future Internet
Issue Date:
19-Aug-2012
Type:
Conference Paper
ISSN:
2308-4340
Additional Links:
http://www.shihada.com/node/publications/AFINMsgForward2012.pdf; http://www.thinkmind.org/index.php?view=article&articleid=afin_2012_2_10_50021
Appears in Collections:
Conference Papers; 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.authorShihada, Basemen
dc.date.accessioned2015-04-09T06:13:39Zen
dc.date.available2015-04-09T06:13:39Zen
dc.date.issued2012-08-19en
dc.identifier.citationElwhishi, Ahmed, Pin-Han Ho, and Basem Shihada. "Message Scheduling and Forwarding in Congested DTNs." In AFIN 2012, The Fourth International Conference on Advances in Future Internet, pp. 26-31. 2012.en
dc.identifier.issn2308-4340en
dc.identifier.urihttp://hdl.handle.net/10754/362174en
dc.description.abstractMulti-copy utility-based routing has been considered as one of the most applicable approaches to effective message delivery in Delay Tolerant Networks (DTNs). By allowing multiple message replicas launched, the ratio of message delivery or delay can be significantly reduced compared with other counterparts. Such an advantage, nonetheless, is at the expense of taking more buffer space at each node and higher complexity in message forwarding decisions. This paper investigates an efficient message scheduling and dropping policy via analytical modeling approach, aiming to achieve optimal performance in terms of message delivery delay. Extensive simulation results, based on a synthetic mobility model and real mobility traces, show that the proposed scheduling framework can achieve superb performance against its counterparts in terms of delivery delay.en
dc.language.isoenen
dc.publisherIARIAen
dc.relation.urlhttp://www.shihada.com/node/publications/AFINMsgForward2012.pdfen
dc.relation.urlhttp://www.thinkmind.org/index.php?view=article&articleid=afin_2012_2_10_50021en
dc.rightsCopyright (c) IARIA, 2012en
dc.titleMessage Scheduling and Forwarding in Congested DTNsen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalAFIN 2012, The Fourth International Conference on Advances in Future Interneten
dc.eprint.versionPost-printen
dc.contributor.institutionDept of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canadaen
dc.contributor.affiliationKing Abdullah University of Science and Technology (KAUST)en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.