Towards Developing Enhanced Cluster-Based QoS-Aware Routing in MANET

Algorithm 2

Algorithm for MPR selection.

	Input: Node n, N1(n), N2(n)
	Process:
	Start with an empty multipoint relay set MPRn;
	Find and calculate the number of N1(n) of the current node
	IF (N1(n) status == symmetric && willingness != will never)
	Add these N1(n) nodes to the multipoint relay set MPRn
	Select N1(n) as MPR which provides the only path to reach some nodes in N2(n)
	Remove the nodes from N2(n) which are covered by a node in MPRn
	While (N2(n) not empty) Do//all nodes in N2(n) that are not covered by the MPRn
	IF (N1(n) is not in MPRn)
	Calculate the number of nodes that are reachable through it among the nodes in N2(n) and which are not yet covered by MPRn
	Calculate the QoS metrics value//as shown in equation (4)
	Select node of N1(n) as an MPR which reaches the maximum number of uncovered nodes in N2(n) and meets the QoS requirements
	ENDIF
	ELSE
	IF (multiple choices of N1(n))//N1(n) nodes having the same number of Node connectivity
	Select node of N1(n) as an MPR which have a maximum QoS metrics
	ENDIFRemove the nodes from N2(n) which are covered by a node in MPRn
	Output: MPR set of n