Algorithm 5 CRBR-Localization Algorithm
Input: all nodes' neighborhood N; the initial node A; the actual node number n.
Output: node location permutation S.
1.	use Algorithm 1 to derive the permutation S
2.	k = the number of ordering S
3.	If k = = n then
4.	turn to Algorithm 4
5.	else if n − k = = 1
6.	turn to Algorithm 2
7.	else
8.	turn to Algorithm 3
9.	end if