Algorithm 1: DEUDHC ( )
1)	Input: Y, k, λ, {ci},{dsj} (0 ≤ j ≤ N) {N ∈ Z∣0 ≤ N ≤ 3}
2)	Output: dc % the communication distance estimate value of RSSI value Y
3)	while (1)
4)	new input Y % for every RSSI value
5)	for j = 1 to N do
6)	compute DjY = Dj(cj, Y)
7)	end for
8)	find minimum Dj(cj, Y)
9)	dc = dsj
10)	return dc
11)	End