Delay-Tolerant Network Routing Algorithm for Periodical Mobile Nodes

Lee, Youngse; Lee, Gowoon; Joh, Hangki; Ryoo, Intae

doi:10.9728/dcs.2014.15.1.1

Cited by 1 publication

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [12], a forwarding node is selected based on the information of location, speed, movement direction, and time. In [13], if the movement pattern is periodic in a considered network topology, a scheme to minimize the delivery time to reach the destination node from a source node was proposed. In [14], the contact period between nodes is estimated and a message is forwarded to a node closer to the next contact time with the destination node.…”

Section: Introductionmentioning

confidence: 99%

“…In related works, movement trajectory [10], movement direction, speed, estimated direction change, location [11,12], movement pattern [13], contact period [14], last contact duration, last contact time, current contact time [15], contact count, contact duration, the amount of exchanged messages [16], contact history [17], node type [20], historical throughput, historical contact time [21], encounter duration, non-encounter duration [22], rate of encounters [23], and delivery predictability of previously contact nodes [24] are used to decide a message forwarding. Most of the mentioned context information, however, reflect individual characteristics of contact nodes or node itself, and collective characteristics of nodes have not been considered well to deliver a message to a destination node.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Improved Opportunistic Routing Protocol Based on Context Information of Mobile Nodes

2018

View full text Add to dashboard Cite

Featured Application: The proposed routing protocol can be applied to enable communication in an extreme environment, where network infrastructure is not available.Abstract: Delay tolerant network (DTN) protocol was proposed for a network where connectivity is not available. In DTN, a message is delivered to a destination node via store-carry-forward approach while using opportunistic contacts. Probabilistic routing protocol for intermittently connected networks (PRoPHET) is one of the widely studied DTN protocols. In PRoPHET, a message is forwarded to a contact node, if the contact node has a higher delivery predictability to the destination node of the message. In this paper, we propose an improved opportunistic routing protocol, where context information of average distance travelled and average time elapsed from the reception of a message to the delivery of the message to the destination node is used. In the proposed protocol, the average distance and average time are updated whenever a message is delivered to a destination node. Then, both average distance and average time as well as delivery predictability of PRoPHET protocol are used to decide a message forwarding. The performance of the proposed protocol is analyzed and compared with that of PRoPHET and reachable probability centrality (RPC) protocol, which is one of the latest protocols using the contact history information of a mobile node. Simulation results show that the proposed protocol has better performance than both PRoPHET and RPC, from the aspect of delivery ratio, overhead ratio, and delivery latency for varying buffer size, message generation interval, and the number of nodes.

show abstract

Section: Introductionmentioning

confidence: 99%