{'fraction_non_alphanumeric': 0.0225140712945591, 'fraction_numerical': 0.0, 'mean_word_length': 4.960893854748603, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Delay analysis of bursty traffic in finite-buffer disruption-tolerant networks with two-hop routing

We consider sparse mobile ad-hoc networks (i.e., disruption-tolerant networks or DTNs) wherein a direct communication path from a source to a destination via multiple hops does not exist due to both mobility and sparseness of the nodes. Hence, the nodes will deliver messages from source to destination using a “store, carry, and forward” strategy. Our goal is to analytically study the packet latency in such networks for a two-hop unicast scenario with bursty packet arrivals at the source. We exploit an embedded Markov chain approach combined with our novel iterative estimation technique to study both network delay and queuing delay. Constraints posed by both the limited node buffer size and contention between nodes for wireless channel are also considered in order to obtain a more realistic model. Finally, our iterative results are validated using simulations for well-known mobility models such as random walk on a grid and the random waypoint mobility.