Node Credit Based Efficient Flooding (NCBEF) Method for Mobile Ad-hoc Networks

Abstract

Effective routing is one important research issue for mobile ad-hoc network where gadgets have confined resources. Due to non-foreseeing network topology, frequent link failure occurred that drives route break, partitions and high routing overhead issue. These issues result superfluous resource wastage and diminish network life. Existing reactive routing algorithm helps nodes to discover route via broadcast of route request to all these reachable nodes. Receiving node of route request further forward to all its neighbours’ nodes that lead flooding. Here broadcasting of route request results several issues such as wastage of resources, congestions, redundancy of route request and broadcast storm problem. Though to maximize resource utilization and minimize broadcast storm problem, efficient broadcast method in routing algorithm is required. Numerous contributions have done towards efficient broadcasting which concentrate different aspects. In this paper, NCBEF method is presented that motive was to do efficient flooding. NCBEF method enables node to broadcast route request to some neighbours instead of all. To do this, NCBEF method, determine high creditable neighbours during hello signal transmission. Few hypotheses were formulated to evaluate and test NCBEF method. Hypotheses were evaluated by simulation of NCBEF method in network simulator software on the basis of certain criteria.