{'fraction_non_alphanumeric': 0.01466275659824047, 'fraction_numerical': 0.005865102639296188, 'mean_word_length': 5.168674698795181, '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}}
Dynamic Relay Selection using a Greedy Cluster Strategy

One of the primary challenges of relay assisted communications in ad hoc network and device-to-device (D2D) communications in cellular network is sustenance of QoS requirements of mobile users. This paper proposes a relay selection technique based on a greedy clustering scheme that takes relay load and willingness into consideration during relay selection. With a dynamic selection imperative in a mobile environment this technique aims at optimizing the number of selected relays of a node by monitoring the current status of the relays. We compare our proposed technique with the relay selection technique of optimized Link State Routing (RFC 7181) over two scenarios: the first in an ad hoc scenario with a collection of mobile nodes and the second in D2D communication over cellular scenario. Simulation results show an overall improvement in performance in terms of average network throughput, packet loss rate and end-to-end delay for our proposed technique.