DRANS: Daily Routine Analysis for Node Searching in delay tolerant networks

Abstract

In delay tolerant networks, the success rate and the transmission speed are restricted by limited social interaction and complex node mobility pattern analysis. To increase the success rate and reduce the transmission delay in delay tolerant networks, we propose Daily Routine Analysis for Node Searching in delay tolerant networks. In Daily Routine Analysis for Node Searching, each node is required to generate a Staying Probability Table and a Transiting Probability Table by analyzing its own daily routine, then to distribute its Staying Probability Table and Transiting Probability Table to the whole network with the help of other nodes having different mobility patterns. On the basis of the Staying Probability Table and Transiting Probability Table, Daily Routine Analysis for Node Searching further provides a node tracking strategy and an opportunistic routing strategy for delivering data from the source node to the destination node. Trace-driven experiments are performed to compare Daily Routine Analysis for Node Searching with previous node searching methods. The experimental results demonstrate that Daily Routine Analysis for Node Searching is able to promote the success rate and reduce the transmission delay effectively.

Geo-DMP: A DTN-Based Mobile Prototype for Geospatial Data Retrieval

“…By dividing the whole area into a series of subregions, the position of a node can thus be represented by the subarea it currently lies in, and further, the moving process of a node can be simplified as a discrete sequence of subregions. Whereas various ways to generate subregions are presented in existing works, including breaking into regular shapes [66][67][68][69], geometric partitioning [70,71], and artificial clustering [72,73], etc., an apparent shortcoming is that none of them are in line with actual environments, as they neglect natural boundaries such as roads, rails, rivers, outer periphery of buildings, among others. Especially for most used grid-based methods, although it is easier to control the area size, code the area, and maintain the hierarchy information, some researchers point out that the determination of the size, position, and orientation of grids is arbitrary [74], and the fixed-size unit is not sufficient to reflect the density of users and their activities [75].…”