An Optimized Method for Minimum MPRs Selection Based on Node Density

Multipoint Relay (MPR) have been introduced in the proactive protocol OLSR to optimize the flooding overhead of control traffic. In this paper, we propose an optimized method for the selection of the minimum MPR set computed by greedy algorithm. On the basis of node density, an incomplete traversal process is executed in the common MPR set calculated by greedy algorithm in order to reselect the minimum MPR set. It is shown by the simulation that the optimized method can reduce the number of nodes in minimum MPR set and TC packets flooding in the network.