Skip to Main Content
Greedy and Contention-based forwarding schemes perform data routing hop-by-hop, without discovering the end-to-end route to the destination. Accordingly, the neighboring node that satisfies specific criteria is selected as the next forwarder of the packet. Both schemes require the nodes participating in the selection process to be within the area that confronts the location of the destination. Therefore, the lifetime of links for such schemes is not only dependent on the transmission range, but also on the location parameters (position, speed and direction) of the sending node, the neighboring node and the destination. In this paper, we propose a new link lifetime prediction method for greedy and contention-based routing. The evaluation of the proposed method is conducted by the use of stability-based greedy routing algorithm, which selects the next hop node having the highest link lifetime.