Design and Implementation of Binary Tree Based Proactive Routing Protocols for Large MANETS

Abstract

The Mobile Ad hoc Network (MANET) is collection of connected mobile nodes without any centralized administration. Proactive routing approach is one of those categories of proposed routing protocol which is not suitable for larger network due to their high overhead to maintain routing table for each and every node. The novelty of this approach is to form a binary tree structure of several independent sub-networks by decomposing a large network to sub-networks. Each sub-network is monitored by selected agent node which is selected by several broadcasted regulations. Agent node maintains two routing information one for local routing within sub-network and another for routing through all other agent node. Initially whole network is divided in two nearly equal independent sub-networks, and this process follows up to feasible number of nodes in each sub-network. So in routing mechanism first source node checks for destination within sub-network then source send destination address to respective parent agent node if destination is not available in local routing, this process follows up to the destination node. This approach allowed any proactive routing protocol with scalability for every routing mechanism. The proposed approach is thoroughly analyzed and its justification for the connectivity through sub-networks, routing between each source to destination pair, scalability, etc are given, which show expected performance.