Dominating set based position routing in mobile ad hoc networks

A variety of position based routing algorithms have been proposed to reduce communication overheads. Communication overheads can be further reduced by introducing the concept of dominating set to position based routing algorithms. A set is a dominating set if all the nodes in the network are either in the set or neighbors of the nodes in the set. We apply a dominant pruning dominating set in VD-GEDIR, CH-MFR, R-DIR, LAR, and DREAM algorithms in the mobile ad hoc environment. The results show that the flooding ratio has been significantly reduced without influencing the success rate and hop counts after applying the dominating set. A random walk mobility model has been chosen to implement the movement of nodes in a proactive environment.