An Efficient Topology Management Algorithm in MANETs

Ad hoc network is a type of Local area network (LAN) which built casually as device get connected.In this type of network node forward packet by communicating with each other. MANETs is a type of ad hoc network which changes location and configure itself on space. It is being very challenging in MANETs to maintain the updated information of network’s topology regularly due to decentralized nature of network. This paper proposed an efficient topology management algorithm for robust mobility of nodes or stations in MANETs to preserve overall topology of network. The algorithm assumes that each node has information about the position and velocity of every other node. As in MANETs all nodes are mobile and moving randomly within the fixed range of network. So there is a chance that may a node goes beyond the range of network. In this algorithm a node calculates the distance between adjacent node and velocity of adjacent nodes then verify whether the calculated distance between adjacent node satisfy critical condition or not. If node satisfied the critical condition then there is no need to change the position of node else if node does not satisfied the critical condition then a calling mechanism is made by nearest adjacent node to that node so that node may satisfied the critical condition. Here the critical condition is threshold distance dth i.e. maximum distance between the two adjacent node. Advantage of this calling mechanism is that the overheads on network can be reduced significantly.