NEED HELP ASAP!

Question

Create a program to localize medical devices in a hospital and to implement a common fingerprinting localization algorithm called the Nearest Neighbor (NN).

Task:

1. create an offline stage of 4 X 4 grid points.
2. each set of 4 grid points belongs to a specific direction such as Northwest, Northeast, Southeast, Southwest.
3. each grid point has one Received Signal Strength (RSS) measurement received from a surrounding BLE beacon.
4. Assume these measurements are generated randomly by the program.

For the online stage, some hospital devices are tracked based on the NN algorithm. The algorithm checks the measured RSS for one of the devices and compares it to all the grid points RSS initialized in the offline stage. The equation is: d = √(RSS_i - RSS_t )²

1. d - the distance computed between a Grid Point i and a target.
2. i - to the index of the grid point
3. t - to the target node.
4. If the distance with a Grid point x is found to be the shortest for one device, then the device is assumed to be located at the point. If there were equal minimum distances from 2 or more grid points to a target, choose only one. The same process is repeated for the others.

1) an Enum class consists of the 4 directions

2) an Enum class consists of 4 coordinates (0,0), (0,1), (1,0), (1,1) for each direction

3) GridPoint class that has coordinated, direction and RSS data members

4) OfflineStage class that initializes an array of grid points. Any RSS measurement generates randomly between 0 & -60 dBms

5) LocalizationTechniques interface consists of the hospital name member and the nearestNeighbour method

6) HealthDevice class related to the interface and consists 3 members:

1. String deviceName
2. int id (id of the device)
3. int rss

Answer 1

#include <math.h>

#include <stdio.h>

#define NORTH (1)

#define NE (2)

#define EAST (3)

#define SE (4)

#define SOUTH (5)

#define SW (6)

#define WEST (7)

#define NW (8)

/**********************************

NW N N NE

W NW NE E

W SW SE E

SW S S SE

************************************/

double DistanceFormula( double x1, double y1, double x2, double y2)

{

return(

sqrt(

(x1-x2)*(x1-x2) + (y1-y2)*(y1-y2)

)

);

}

int NearestNeighbor(double rssX, double rssY, double RSS[][4])

{

int iReturn=0;

double minDistance=9999;

double dDistance;

double X1,Y1;

//North (0,1) - (0,2)

X1 = RSS[0][1]; Y1 = RSS[0][2];

dDistance = DistanceFormula(X1,Y1,rssX,rssY);

if (dDistance<minDistance) { iReturn = NORTH; }

//NE (1,2) - (0,3)

X1 = RSS[1][2]; Y1 = RSS[0][3];

dDistance = DistanceFormula(X1,Y1,rssX,rssY);

if (dDistance<minDistance) { iReturn = NE; }

//EAST (1,3) - (2,3)

X1 = RSS[1][3]; Y1 = RSS[2][3];

dDistance = DistanceFormula(X1,Y1,rssX,rssY);

if (dDistance<minDistance) { iReturn = EAST; }

//SE (2,2) - (3,3)

X1 = RSS[2][2]; Y1 = RSS[3][3];

dDistance = DistanceFormula(X1,Y1,rssX,rssY);

if (dDistance<minDistance) { iReturn = SE; }

//SOUTH (3,1) - (3,2)

X1 = RSS[3][1]; Y1 = RSS[3][2];

dDistance = DistanceFormula(X1,Y1,rssX,rssY);

if (dDistance<minDistance) { iReturn = SOUTH; }

//SW (2,1) - (3,0)

X1 = RSS[2][1]; Y1 = RSS[3][0];

dDistance = DistanceFormula(X1,Y1,rssX,rssY);

if (dDistance<minDistance) { iReturn = SW; }

//WEST (1,0) - (2,0)

X1 = RSS[1][0]; Y1 = RSS[2][0];

dDistance = DistanceFormula(X1,Y1,rssX,rssY);

if (dDistance<minDistance) { iReturn = WEST; }

//NW (0,0) - (1,1)

X1 = RSS[0][0]; Y1 = RSS[1][1];

dDistance = DistanceFormula(X1,Y1,rssX,rssY);

if (dDistance<minDistance) { iReturn = NW; }

return(iReturn);

}

Go()

{

double RSS[][4] = { {10.35, 8.27, 12.45, 6.3},

{4.713 , 2.243, 6.67, 10.33},

{7.05, 7.24, 7.53, 8.21},

{7.11, 3.33, 5.34, 2.16}

};

double rssX=5, rssY=6;

int iReturn = NearestNeighbor(rssX,rssY,RSS);

printf("%d\n",iReturn);

}

main() { Go();}