Neighbor Knowledge-based Rebroadcast algorithm for minimizing the routing overhead in Mobile Ad-hoc Networks

摘要

Mobile Ad-hoc Networks are constructed without any administration, providing the quality of service in spite of routing overhead. In MANET, it is impossible for a mobile host to contact with other hosts in a single-hop fashion. In a multi-hop scenario, packets sent by the source host are relayed by a number of intermediate hosts before reaching the destination host. Due to node mobility in MANETs, frequent path failures and route discoveries occur. Hence, RREQ (Route Request) packets have to be broadcasted for finding the route. This leads to excessive redundant retransmission of RREQ packets. This strategy induces routing overhead in MANET. In this paper, we propose a reliable routing method to obtain the Quality of Service in MANET. The bandwidth requirement is calculated using the strength of the node's signal in the established nodes. The selection of route is based on the fewer amounts of delay and strong stability. To ascertain the route more efficient than traditional broadcasting style, rebroadcast can be done with the assistance of neighbor knowledge methods. Here, NKR (Neighbor Knowledge-based Rebroadcast) algorithm and LVC (Loose Virtual Clustering) algorithm are used for routing overhead reduction in MANETs. The experimental results prove that the proposed work performs well in terms of routing overhead, network traffic and successful broadcast of data packets in the network. (C) 2019 Published by Elsevier B.V.