Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/5095
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computing-
dc.creatorChen, H-
dc.creatorLou, W-
dc.date.accessioned2014-12-11T08:28:11Z-
dc.date.available2014-12-11T08:28:11Z-
dc.identifier.isbn978-1-4577-1336-1-
dc.identifier.isbn978-0-7695-4510-3 (e-ISBN)-
dc.identifier.issn0190-3918-
dc.identifier.urihttp://hdl.handle.net/10397/5095-
dc.language.isoenen_US
dc.publisherIEEE Computer Societyen_US
dc.rights© 2011 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_US
dc.rightsThe following publication Chen, H., & Lou, W. (2011, September). On using contact expectation for routing in delay tolerant networks. In Parallel Processing (ICPP), 2011 International Conference on (pp. 683-692). IEEE.is available at http://dx.doi.org/10.1109/ICPP.2011.39en_US
dc.subjectDelay tolerant networksen_US
dc.subjectExpected encounter valueen_US
dc.subjectMinimum expected meeting delayen_US
dc.subjectRouting protocolsen_US
dc.titleOn using contact expectation for routing in delay tolerant networksen_US
dc.typeConference Paperen_US
dc.identifier.doi10.1109/ICPP.2011.39-
dcterms.abstractConventional routing algorithms rely on the existence of persistent end-to-end paths for the delivery of a message to its destination via a predesigned path. However, in a delay tolerant network (DTN), nodes are intermittently connected, and thus the network topology is dynamic in nature, which makes the routing become one of the most challenging problems. A promising solution is to predict the nodes’ future contacts based on their contact histories. In this paper, we first propose an expected encounter based routing protocol (EER) which distributes multiple replicas of a message proportionally between two encounters according to their expected encounter values. In case of single replica of a message, EER makes the routing decision by comparing the minimum expected meeting delay to the destination. We further propose a community based routing protocol (CR) which takes advantages of the high contact frequency property of the community. The simulations demonstrate the effectiveness of our proposed routing protocols under different network parameters.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitation2011 International Conference on Parallel Processing (ICPP), 13-16 Sept. 2011, p.683-692-
dcterms.issued2011-09-
dc.identifier.scopus2-s2.0-80155154101-
dc.identifier.rosgroupidr61330-
dc.description.ros2011-2012 > Academic research: refereed > Refereed conference paper-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
icpp2011[1].pdfPre-published version149.05 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

135
Last Week
1
Last month
Citations as of Mar 24, 2024

Downloads

180
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

12
Last Week
0
Last month
0
Citations as of Mar 28, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.