{'fraction_non_alphanumeric': 0.012333965844402278, 'fraction_numerical': 0.003795066413662239, 'mean_word_length': 5.133720930232558, '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}}
An Efficient Routing Mechanism Based on Heading Angle

The aim of this paper is to develop an efficient routing mechanism based on heading angle to establish connections. This can be done by prevent unessential links to be established between each pair of nodes that form the connection between the source and the destination. The unessential links represent the fragile links which could be broken easily according to the arbitrary movement of the nodes. This work enhanced the previous work on heading angle where connections requests are served under FCFS [14] where as the current work restrict the range to consider for routing. We measure the performance of the proposed approach by evaluating it against the enhanced ad-hoc on demand distance vector (EAODV) routing protocol. The simulation results reveal that the proposed approach demonstrates better performance than EAODV for all scenarios using the Random Waypoint mobility model. Numerical result demonstrates the performance. The result show the average values based on 50 simulations runs.