Please use this identifier to cite or link to this item:
Title: On using contact expectation for routing in delay tolerant networks
Authors: Chen, H
Lou, W 
Keywords: Delay tolerant networks
Expected encounter value
Minimum expected meeting delay
Routing protocols
Issue Date: Sep-2011
Publisher: IEEE Computer Society
Source: 2011 International Conference on Parallel Processing (ICPP), 13-16 Sept. 2011, p.683-692 How to cite?
Abstract: Conventional 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.
ISBN: 978-1-4577-1336-1
978-0-7695-4510-3 (e-ISBN)
ISSN: 0190-3918
DOI: 10.1109/ICPP.2011.39
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.
The 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). available at
Appears in Collections:Conference Paper

Files in This Item:
File Description SizeFormat 
icpp2011[1].pdfPre-published version149.05 kBAdobe PDFView/Open
View full-text via PolyU eLinks SFX Query
Show full item record
PIRA download icon_1.1View/Download Contents


Last Week
Last month
Citations as of Aug 13, 2018

Page view(s)

Last Week
Last month
Citations as of Aug 13, 2018


Citations as of Aug 13, 2018

Google ScholarTM



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