Shortest path routing with reliability requirement in delay tolerant networks

Lian, Huai-En; Chen, Chien; Chang, Je-Wei; Shen, Chien-Chung; Jan, Rong‐Hong

doi:10.1109/icfin.2009.5339556

Cited by 5 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Direct Contact [2] routing scheme is not a typical algorithm. In this case only one message is transmitted in the network, which is basically kept by the Source node until it contacts with Destination.…”

Section: Related Workmentioning

confidence: 99%

SocialRouting: The social-based routing algorithm for Delay Tolerant Networks

Schoeneich¹,

Surgiewicz²

2016

International Journal of Electronics and Telecommunications

View full text Add to dashboard Cite

Abstract-Delay and Disruptive Tolerant Networks (DTN) are relatively a new networking concept that could provide a robust communication in wide range of implementations from the space to battlefield or other military usage. However in such dynamic networks, which could be considered as a set of intermittently connected nodes, message forwarding strategy is a key issue. Existing routing solutions concentrate mainly on two major routing families flooding and knowledge based algorithms. This paper presents SocialRouting -the social-based routing algorithm designed for DTN. The use of the social properties of wireless mobile nodes is the novel way of message routing that is based on message ferrying between separated parts of the network. Proposed idea has been extensively tested using simulation tools. The simulations were made based on especially designed for measurements in DTN scenarios and compared with popular solutions.

show abstract

Section: Related Workmentioning

confidence: 99%

SocialRouting: The social-based routing algorithm for Delay Tolerant Networks

Schoeneich¹,

Surgiewicz²

2016

International Journal of Electronics and Telecommunications

View full text Add to dashboard Cite

show abstract

“…A form of Delay/Disruption Tolerant Networks (DTNs) are those constructed out of vehicles, and thus have scheduled contacts [1] or a space-time graph [2][3][4][5]. Thus, their schedule allows other nodes to determine suitable point of contacts and critically, allow them to compute different paths that meet various criteria.…”

Section: Introductionmentioning

confidence: 99%

A Novel Mobility-Based Routing Protocol for Semi-Predictable Disruption Tolerant Networks

Iranmanesh

Chin

2015

Int J Wireless Inf Networks

View full text Add to dashboard Cite

This letter considers routing in delay tolerant networks whereby nodes have semi-predictable mobility patterns within a time period. We propose a mobility-based routing protocol (MBRP) where nodes construct a space-time graph dynamically. As the space-time graph may be incomplete, MBRP presents a heuristic that evaluates encountered nodes based on their recorded mobility patterns in order to disseminate a finite number of bundle replicas. Simulation results, over a service quality metric comprising of delivery, delay and overhead, show that MBRP achieves up to 105 % improvement as compared to four well-known routing protocols. Finally, MBRP is capable of achieving 50 % of the performance attained by the optimal algorithm, whereby all nodes are preloaded with a space-time graph.

show abstract