{'fraction_non_alphanumeric': 0.015, 'fraction_numerical': 0.002142857142857143, 'mean_word_length': 4.88655462184874, '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}}
Routing protocols to determine stable paths and trees using the inverse of predicted link expiration times for mobile ad hoc networks

The high-level contribution of this paper is the design and development of routing protocols to discover stable paths and trees for unicast and multicast communication based on the predicted link expiration times LETs of links in mobile ad hoc networks MANETs. Both of the stability-based unicast SILET and multicast MILET routing protocols discover routes through an on-demand request-reply cycle with a link weight being 1 plus the inverse of the LET of the link. The destination nodes and the multicast receiver nodes connect to the source node through paths that have the lowest sum of the link weights. The inclusion of a '1' in the link weight helps to minimise the hop count of the paths from the source node to each of the targeted end nodes of the communication session; the inclusion of the inverse of the LET in the path/tree optimisation function helps to maximise the path/tree lifetime. The proposed protocols effectively neutralise the stability-hop count tradeoff and are able to simultaneously maximise the path/tree lifetime and minimise the hop count per source-destination/source-receiver path. The performance of SILET and MILET has been extensively studied in the ns-2 simulator along with contemporary unicast and multicast routing protocols.