We have previously shown that the geographic routing’s greedy packet forwarding distance (PFD), in dissimilarity values of its average measures, characterizes a mobile ad hoc network’s (MANET) topology by node size. In this article, we demonstrate a distribution-based analysis of the PFD measures that were generated by two representative greedy algorithms, namely GREEDY and ELLIPSOID. The result shows the potential of the distribution-based dissimilarity learning of the PFD in topology characterizing. Characterizing dynamic MANET topology supports context-aware performance optimization in position-based or geographic packet routing.

Broadcasting is an inevitable operation in networks. This paper addresses the issues related to broadcasting such as node interference and latency delay in ad-hoc networks .These problems could be overcome by our proposed algorithm approximate directional routing protocol (ADRP) which is mainly inspired by the existing on-demand directional routing protocol (DRP). DRP is also similar to Dynamic Source Routing (DSR). The use of directional antennas for broadcasting is gaining acceptance in ad-hoc networks. The key benefits of smart antennas are minimum energy consumption and bandwidth conservation. Although excess of literature is directed toward the use of smart antennas, a powerful protocol for reducing redundancy, end-to-end delay, and interference is being researched. One such protocol is ADRP. ADRP is a reactive protocol that combines the effect of DRP and approximation algorithm that finds optimal solution for broadcast problems. Omni-directional antennas are capable of wide angle signal transmission. Compared with omni-directional antennas, its successor directional antennas have come up with significant advantages of reducing packet redundancy and interference by gaining higher signal-to-noise ratio. The duo pack will considerably decrease end-to-end delay and node interference giving out significant performance benefits thereby substantially increasing throughput.