{'fraction_non_alphanumeric': 0.013386880856760375, 'fraction_numerical': 0.002677376171352075, 'mean_word_length': 5.127049180327869, '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}}
On the Age of Information in Multi-Source Multi-Hop Wireless Status Update Networks

This paper studies a multi-source “age of information” problem in multi-hop wireless networks with packetized status updates and explicit channel contention. Specifically, the scenario considered in this paper assumes that each node in the network is a both a source and a monitor of information. Nodes take turns broadcasting their information to other nodes in the network while also maintaining tables of status updates for the information received from all other nodes in the network. Lower bounds on the peak and average age of information are derived and are found to be a function of fundamental graph properties including the connected domination number of the graph and the average shortest path length. In addition to these converse results, achievability results are developed through the presentation of an explicit algorithm for constructing near-optimal status update schedules along with an analytical upper bound for the average and peak age of these schedules. Finally, numerical results are presented that compute the bounds, construct schedules, and compute the achieved average and peak ages of these schedules exhaustively over every connected network topology with nine or fewer nodes. The results show that the the developed schedules achieve a peak age exactly matching the lower bounds and an average age within a multiplicative factor of 1.035 of the lower bound in all tested cases.