{'fraction_non_alphanumeric': 0.02389937106918239, 'fraction_numerical': 0.007547169811320755, 'mean_word_length': 5.288537549407114, '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 Comparative Study of Network-based Approaches for Routing in Healthcare Wireless Body Area Networks

In this paper, we propose a minmax robust formulation for routing in healthcare wireless body area networks (WBAN). The proposed model minimizes the highest power consumption of each bio-sensor node placed in the body of a patient subject to flow rate and network topology constraints. We consider three topologies in the problem: a spanning tree, a star, and a ring topology as well. In particular, we use an equivalent polynomial formulation of the spanning tree polytope (Yannakakis, 1991) to avoid having an exponential number of cycle elimination constraints in the model. For the ring topology approach, we use constraints from the well known mixed integer linear programming (MILP) formulation of the traveling salesman problem (Pataki, 2003). Thus, we compute optimal solutions and lower bounds directly using the MILP and linear programming (LP) relaxations. Finally, we propose a Kruskal-based (Cormen et al., 2001) variable neighborhood search metaheuristic to improve the solutions obtained with the star topology approach. Our preliminary numerical results indicate that the tree approach is more convenient as it allows saving significantly more power while the ring approach is the most expensive one. They also indicate that the difference between the optimal objective function values for the tree and star formulations is not very large and that VNS can improve significantly the solutions obtained with the star configuration, although, at a higher computational cost.