Improving Energy Efficiency of Multimedia Content Dissemination by Adaptive Clustering and D2D Multicast

Algorithm 4

The decision for D2D multicast relaying powers.

	Run at any DCH (e.g., k)
	Input: null
	Output:
(1)	If receive η, Nk, and MTK from the MCP via the base station then
(2)	Initialize the set Ek as “empty”
(3)
(4)	Compute according to formula (5) through using as the input
(5)	For each member of do
(6)
(7)	Compute according to formula (5) through using as the input
(8)
(9)	Compute according to formula (6) through using as the input parameter
(10)	If and then add to EkEnd if // is the maximum power of the DCH k
(11)	End for
(12)	Arrange the members of the set Ek in an ascending order and then take jth transmission power (e.g., ) //usually j is 3, if is less than j, the maximum value in Ek is taken
(13)	Invoke Algorithm 2 to get or
(14)	and or
(15)	Send () to the MCP via the base station
(16)	If the received αk or βk is 1 then reap the benefits
(17)	Else think about adjustment for ()
(18)	End if
(19)	End if