WiFi信号量匹配算法

最新推荐文章于 2024-08-24 14:33:32 发布

daroubaozi123

最新推荐文章于 2024-08-24 14:33:32 发布

阅读量539

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/daroubaozi123/article/details/81235890

package Test;

import java.util.*;

public class Text2 {
public static void main(String[] args)
{
String[][] str = {{“0”,”2”,”-60”},{“0”,”4”,”-68”},{“0”,”6”,”-59”},{“0”,”8”,”-71”},{“0”,”10”,”-69”},{“0”,”12”,”-67”},
{“0”,”14”,”-66.5”},{“0”,”16”,”-69”},{“0”,”18”,”-57”},{“0”,”20”,”-59.5”},{“0”,”22”,”-65”},{“0”,”24”,”-60”},
{“0”,”26”,”-70.5”},{“0”,”28”,”-63.5”},{“0”,”30”,”-69.5”},{“0”,”32”,”-67”},{“0”,”34”,”-62”},{“0”,”36”,”-67”},
{“0”,”38”,”-70”},{“0”,”40”,”-74”},{“0”,”42”,”-72.5”},{“0”,”44”,”-68.5”},{“0”,”46”,”-68.5”},{“0”,”48”,”-71.5”},
{“0”,”50”,”-66”},{“0”,”52”,”-61”},{“0”,”54”,”-56”},{“0”,”56”,”-60.5”},{“0”,”58”,”-67.5”},{“0”,”60”,”-64.5”},
{“0”,”62”,”-73”},{“0”,”64”,”-74.5”},{“0”,”66”,”-71.5”},{“0”,”68”,”-63”},{“0”,”70”,”-59”},{“0”,”72”,”-60.5”},
{“0”,”74”,”-62.5”},{“0”,”76”,”-65”},{“0”,”78”,”-60”}}; //初始化采集的坐标及信号强度数据

    //str>>>对RSSI值选择排序
    for(int i = 0;i < str.length ;i++) {
        int k = i;
        for(int j = i + 1;j < str.length ;j++) {
            if(str[j][2].compareTo(str[k][2]) < 0) {
                k = j;
            }
        }
        String[] t = str[k];
        str[k] = str[i];
        str[i] = t;         
    }

    String[] strRssi = new String[str.length];
    for(int i = 0;i < str.length;i++) {
        strRssi[i] = new String(str[i][2]);
    }

    int index = Arrays.binarySearch(strRssi, "-61.5");
    float wr = Float.parseFloat("-61.5");

    System.out.println(index);                          //得到的下标

    if(index >= 0) {
        System.out.println(str[index][0]+","+str[index][1]);
    }
    else {
        index = -index - 1;
        float[] rs = new float[4];
        rs[0] = Float.parseFloat(str[index - 2][2]);
        rs[1] = Float.parseFloat(str[index - 1][2]);
        rs[2] = Float.parseFloat(str[index][2]);
        rs[3] = Float.parseFloat(str[index + 1][2]);

        double mix = 999;
        int location = 0;
        double dd = 0;

        for(int i = 0;i < 4;i++) {
            dd = Math.sqrt(Math.pow((wr - rs[i]), 2));
            if (mix - dd > 0.00001) {
                mix = dd;
                location = index - 2 + i;
            }
        }

        System.out.println(dd);            //欧式距离算法算出的值
        System.out.println(str[location][0] + "  " + str[location][1]);                //匹配到的坐标
    }

    //输出
    int i = 0;
    for(String a[]:str)
    {       
        System.out.print((i++) + "   ");
        for(String e:a)
        {               
            System.out.print(e);
            System.out.print("   ");
        }       
        System.out.println();
    }
}

}