frequent path breaks that occur due to mobility of nodes, which leads to flooding of control
packets throughout the network. We propose a preferred link based routing protocol that
reduces flooding of control packets by selectively allowing some nodes to forward the
packets using a preferred list. We propose two algorithms to compute the preferred list. The
first algorithm computes the preferred list based on neighbor's degree. The second algorithm …