This algorithm works based on node connectivity when we have multiple 1-hop neighbors. If an equal solution still exists, a node with maximum bandwidth is chosen as MPR
This approach selects nodes as MPR if it has the largest bottleneck bandwidth path to the source node
Proposed QoS MPR selection
This is our proposed approach with the aware of multiple qualities of service metrics. In this algorithm, first, it checks 1-hop node connectivity, if multiple ties to the same 2-hop neighbor nodes, select the one having the maximum number of 2-hop neighbors and that meet an optimal QoS metrics as MPR. If more than one node in 1-hop neighbor can cover the same maximum number of nodes in a 2-hop neighbor, a 1-hop neighbor having better QoS metrics in terms of delay, quality, and bandwidth is selected as MPR