RSSI-Based Smooth Localization for Indoor Environment

Algorithm 1

Formal description of the TSL subalgorithm.

TSL sub-algorithm:

Step 1. Weight Assignment

 For each AP_𝑖∈AP_𝑖1,AP_𝑖2,…,AP_𝑖𝑠

 For each reference point 𝑗

  𝑃_𝑖𝑗=1𝜎_𝑖𝑗√𝑒2𝜋^{−(𝑥𝑖−𝜇𝑖𝑗)2/(2𝜎2𝑖𝑗)}

  𝑃_𝑗=∏^𝑠_𝑘=1𝑃_𝑖𝑘𝑗

  𝑃𝑤(𝑗)=^𝑗∑^𝑛_𝑘=1𝑃_𝑘

Step 2. Accumulative Weight Computation

 Construct a tree 𝑇 rooted at 𝐿(𝑡) for graph 𝐺

 For each reference point 𝑗

  Aw(𝑗)=𝑤𝑗𝑤(𝑗),𝑗isaleaf+_{𝑘∈𝑐ℎ𝑙(𝑗)}Aw(𝑘),else

Step 3. Localization Determination

  𝐻𝑜𝑝=0;

  𝑝𝑜𝑠=𝑛𝑢𝑙𝑙;

 For each point 𝑗 do

 If Aw(𝑗)≥𝑤₀

  If ℎ𝑜𝑝_𝑗>𝐻𝑜𝑝

    𝑝𝑜𝑠=𝑗

  𝐻𝑜𝑝=ℎ𝑜𝑝_𝑗

 If  𝐻𝑜𝑝>0

   𝐿(𝑡+1)=𝑝𝑜𝑠

 Else

   𝐿(𝑡+1)=𝐿(𝑡)