Improved Location Estimation in Wireless Sensor Networks Using a Vector-Based Swarm Optimized Connected Dominating Set

. 2019 Jan 17;19(2):376. doi: 10.3390/s19020376

Algorithm 1 Proposed Localization Algorithm

1:
procedure Anchor nodes $a_{j}$ and unknown nodes $u_{i}$
2:
Initialize ${A} = {a_{1}, a_{2}, \dots, a_{m}}$ and ${U} = {u_{1}, u_{2}, \dots \dots, u_{n}}$ and dominating set $D = \emptyset$
3:
for Broadcast by anchor node $a_{j}$ do
4:
Send $N D P : {A_a d d r, L e a s h_C = 1, S e q, A c c e p t_S = 0}$
5:
end for
6:
for On receiving, node $u_{i}$ computes do
7:
Leash_C = Leash_C - 1;
8:
Accept_S = 1;
9:
Send $R P N S : {A_a d d r, L e a s h_C, S e q, A c c e p t_S = 1, U_a d d r}$
10:
end for
11:
if $L e a s h_C = = 0 & & A c c e p t_S = = 1$ then
12:
Create $N S L$
13:
$a_{j} \to B S : N S L = {A_a d d r | U_a d d r_{1}, U_a d d r_{2}, \dots \dots}$
14:
else
15:
exit
16:
end if
17:
BS performs:
18:
while True do
19:
if $\forall u_{i} \in (\exists N (a_{j}) & & | D | \geq 3)$ then
20:
Break while loop;
21:
else
22:
Calculate the maximum degree anchor nodes $a_{m a x}$
23:
$D = D \cup a_{m a x}$
24:
end if
25:
end while
26:
$m^{'} = | D |$
27:
for k = 1 to m’ do
28:
BS creates binary vector $\lor_{j}, \forall_{j} = 1, 2, \dots, m^{'}$
29:
Apply $V B S O$ algorithm
30:
Apply Trilateration
31:
end for
32:
end procedure