A Forwarder Fast Selection Algorithm for Implicit Routing Protocol

In order to overcome the inefficiency of existing forwarder selection algorithms of implicit routing protocols,this paper presents a forwarder fast selection algorithm(FFS) based on IEEE 802.11 DCF mechanism.By requiring the forwarder candidates to backoff the slot count according to its forwarding priority before sending the CTS,and selecting a random slot as its CTS resending time when collision occurs,FFS can select the forwarder more quickly and efficiently.Simulation result shows that FFS exceeds existing algorithms in power efficiency,time delay,and packet delivery ratio.