Performance of New Broadcast Forwarding Criteria in MANET

In a mobile ad hoc network (MANET), packet broadcast is common and frequently used to disseminate information. Broadcast consume large amount of bandwidth resource, which is scarce in MANET environment. The problem is to find the ideal forward node set so as to minimize the bandwidth consumed, which is a NP-Complete problem. In this paper we will investigate three dominant node approximation algorithms: dominant pruning, total dominant pruning and partial dominant pruning algorithm. An extension to the original algorithms, modified termination criteria, is proposed. Simulation results show that the new termination criteria ensure the same coverage using a reduced number of forward nodes.

• Type: Conference
• Year: 2004
• Where: ICOIN
• Authors: Lijuan Zhu, Bu-Sung Lee, Boon-Chong Seet, Kai Juan Wong, Genping Liu, Shell-Ying Huang, Keok-Kee Lee
• Keywords: Dominant Pruning, Forward Nodes, ICOIN 2004, Total Dominant Pruning