Download now Free registration required
In a disruption/delay tolerant network, message carriers are often used to act as relays between segregated nodes and gateways. In this paper, the authors study a special routing problem for message carriers in delay tolerant networks, the visiting frequency problem. Specifically, they present a detailed analysis on a near-optimal visiting frequency on the nodes in a sub-region of the network, to ensure low average message delay, using a partitioning-based optimization approach. Then, they propose a multiple visit algorithm and apply the above near-optimal visiting frequency to their multiple visit algorithm, to guarantee the low average message delay for the network.
- Format: PDF
- Size: 249.3 KB