Optimal Node Routing Layouts in Mobile Adhoc Network

Mobile Adhoc Network (MANET) is a self-organizing network of various network devices responsible for communication. In MANET, new layouts are adopted for energy optimization, security implementation, traffic minimization and overhead reduction. MANET are aggressive in nature. This requires modification in network routing protocols for performance enhancement. This paper presents the detailed survey of different layouts involved in the implementation of network routing protocols in MANET. The survey is classified into four phases involved in MANET routing applications namely- routing protocols, neighborhood discovery, distributed or centralized hash tables, and bloom filter. Firstly, the classification of routing protocols based on various traffic models presents the MANET configuration. Secondly, a neighborhood discovery mechanism conveys the enhancement in the routing configurations. Thirdly, application of hash table operation (distributed/ centralized) 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 unpredictability occurs during the prediction of optimal node routing due to the dynamic nature of the MANET. Moreover, the presence of ejected malicious node in another cluster disgraced the link stability. This survey conveys the problems such as 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 reduce the problems in traditional research works.