A survey: Optimal node routing strategies in MANET

MANET, a self-organizing network of various devices responsible for seamless communication. Routing protocols involved in the communication adopts new strategies to assure energy, security, traffic minimization, overhead. Dynamic nature of the MANET requires the modification in routing protocols for performance improvement. This paper presents the detailed survey of strategies involved in the implementation of routing protocols in the MANET. The survey categorized into four phases namely, routing protocols, neighborhood discovery, centralized / distributed hash tables, and bloom filter involved in MANET routing applications. First, the categorization of routing protocols on the basis of various traffic models presents the MANET structure. Second, a neighborhood discovery mechanism conveys the improvement in the routing configurations. Third, application of hash table mechanisms (centralized / distributed) to MANET to improve the matching efficiencies and computational speed. Finally, the application of bloom filter concept to improve service discovery rate and reduce the fake identities. Traditionally, the uncertainty occurs during the prediction of optimal node routing due to the dynamic nature of the MANET. Moreover, the presence of removed malicious node in another cluster degraded the link stability. This survey conveys the difficulties namely, storage overhead, mobility nature, malicious nodes and false positive rates in the traditional methods. The detailed survey leads to the stone of integration of Distributed Hash Table (DHT) with a bloom filter to overcome the difficulties in traditional research works.