Research Article

A Novel Indoor Localization Algorithm for Efficient Mobility Management in Wireless Networks

Algorithm 2

Optimization of the final location of the test point.
Input: , , R, offset
Output: The coordinates of the target point
Calculate the number of the reference points with the degree of and ,
denoted as and , respectively.
if=, then
if, then
Find the set , where is a reference point of degree
and m is the number of the reference points of degree in .
Obtain the all candidate set , where is a candidate set which
contains three reference points. One is the reference point of degree , the others
are any two points in the R.
else
Select the reference points with degree , and
as the candidate set C.
else
if, then
Find the set , where is a reference point of degree
and m is the number of the reference points of degree in .
Obtain the all candidate set , where is a candidate set which
contains three reference points. One is the reference point of degree in R, the
others are two points with degree of .
else
The will be used as the radius and recalculate the degrees of each
reference point according to the procedure in step 3, the repeat the operation of steps 1 to
11.
if, then
Find all the reference points of , three of three combinations as the
candidate set C.
According to all the candidate set C, calculate the perimeter of the triangle enclosed by the
reference point in the set, select the set of reference points with the shortest perimeter, and
find the center of the triangle as the coordinate of the point to be measured.
return result.