DTN Routing of Data Messages with Epidemic Distribution of Mobility Plans of Mobile Wireless Nodes

Yo Chigira and Hiroaki Higaki


Wireless Multihop Networks, Ad-Hoc Networks, DTN, Routing


Conventional ad-hoc routing protocols are designed for networks with dense distribution of mobile wireless nodes, i.e. it is possible with high probability to configure wireless multihop transmission routes. Thus, it is almost impossible for such routing protocols to be applied to wireless networks with sparse distribution of wireless nodes. DTN (Delay-Tolerant Networks) routing protocols are combination of wireless multihop transmissions and store-carry-forward. Some DTN routing protocols adopt copies of data messages for higher reachability though higher communication and storage overhead are required. In other DTN routing protocols, each intermediate mobile wireless node holds received messages or forwards one of its neighbor nodes selected according to their locations, velocities, mobility plans and so on. For selection of the next-hop node, the above information is required to be advertised with lower communication overhead. This paper proposes a localized distribution method of mobility plans where each node distributes all the achieved mobility plans to its neighbor node and a routing method for data message transmissions where each node determines its next-hop node based on the achieved mobility plans. That is, mobility plans are distributed according to Epidemic Routing. The methods are expected to realize higher reachability of data messages with lower communication and computation overheads.

Important Links:

Go Back