A New MPR Selection Algorithm Based on the Optimal Subset

This paper researches the Ad Hoc network OLSR (Optimized Link State Routing Protocol) optimal link-state routing protocol, and uses a mathematical point of collection to analyze the MPR (Multi Point Relay, MPR) set selection problem by a node and its neighbors which connect the node of containing a subset of the set. By calculating the remaining independent sub-set of the set of generated MPR relay node, as to find the minimum number of MPR set. The simulation results show that the algorithm reduces the delay through the network transmission, increasing the speed of network transmission.