{'fraction_non_alphanumeric': 0.02913907284768212, 'fraction_numerical': 0.0, 'mean_word_length': 5.096774193548387, '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}}
A Markovian Approach to Modeling the Optimal Lifetime of Multi-hop Wireless Sensor Networks

A Markov Decision Process (MDP) framework is presented for modeling the lifetime of Multi-hop Wireless Sensor Networks (WSNs). The model applies to both non-cooperative and cooperative (CT) networks. To our knowledge, this is the first work to model the lifetime of multi-hop networks that jointly considers the dynamics of MAC layer link admission, routing layer queuing and energy evolution. We propose a new algorithm that exploits the Stochastic Shortest Path (SSP) structure and Mixed Integer Linear Programming (MILP) to efficiently solve the problem. Numerical results on the optimal lifetime of non-CT and CT networks are presented to validate the model.