Adaptive analysis of characteristic nodes using prediction method in DTN

Abstract

In this paper, we propose an algorithm that select efficient relay nodes using information of network environment and nodes. The proposed algorithm can be used changeable weight factors as following network environment in node density. The routing protocols adopting store-carry-forward method are used for solving network problems occurred by unstable end-to-end connection in Delay Tolerant Networks(DTNs). Exiting DTN routing algorithms have problems that large latency and overhead because of deficiency of network informations. The proposed algorithm could be provide a solution this problems using changeable weight factor and prediction of network environment. Thus, selected relay nodes work efficiently in unstable and stressed network environment. Simulation results show that enhancement performance as overhead, delivery ratio, average latency compared to exiting DTN routing algorithm.

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

“…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.…”

“…In [11], the information of current location, movement direction, speed, and estimated direction change of a mobile node with GPS (global positioning system) is used to decide whether the node approaches near the destination node and a message is forwarded if a node has the closest estimated approach to the destination node. 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.…”