Login| Sign Up| Help| Contact|

Patent Searching and Data


Title:
LOCATION ALGORITHM FOR WIRELESS NETWORKS
Document Type and Number:
WIPO Patent Application WO/2019/175640
Kind Code:
A2
Inventors:
SHARMA PRATIK (IN)
Application Number:
PCT/IB2018/051758
Publication Date:
September 19, 2019
Filing Date:
March 16, 2018
Export Citation:
Click for automatic bibliography generation   Help
Assignee:
SHARMA PRATIK (IN)
International Classes:
H04W40/00; H04W16/00
Download PDF:
Claims:
Claims

Following is the claim for this invention: -

1 . In this invention we have a wireless network deployed at an area or a site with the help of Wireless Access Points. Let us consider the two dimensional surface area of the site as a rectangle of m*n square unit area with m*n cells of one square unit each. Now depending upon the range of the Wireless Access Point and which cell it is placed in along with its orientation, the Wireless Access Point will cover a subset of cells of the total m*n cells. We build a hash map here consisting of Wireless Access Point identifier or its Medium Access Control (MAC) address as its key and the value as subset of the total m*n cells which are within the coverage of the Wireless Access Point with each object corresponding to the cell in the subset holding the expected Received Signal Strength Indicator (RSSI) value from the Wireless Access Point if the wireless client device is present in that cell. Now at run time when we get location feeds for a particular client device, we first look up for the Wireless Access Point we got the feed from and then we look up in the hash map to find out set of cells called location set who have their corresponding objects holding Received Signal Strength Indicator (RSSI) value very close or equal to the real time Received Signal Strength Indicator (RSSI) value in the location feed from the Wireless Access Point for the wireless client device. We form a set of such cells or location set for at least two Access Points (This method requires at least two Access Points to be deployed) or more if possible. Then we take an intersection of the location set (set of cells having their corresponding objects holding close or equal value of RSSI we got from the location feed) for each Wireless Access Point from whom we got the location feeds for the wireless client device. Then for each cell in the intersection we took earlier, we calculate the Total Difference by summing up the difference for each Wireless Access Point which is the difference between the Received Signal Strength Indicator (RSSI) value held by the object corresponding to the cell for the Wireless Access Point and the Received Signal Strength Indicator (RSSI) value received from the location feed for the wireless client device from the same Wireless Access Point. The cell with the minimum Total Difference value is where the wireless client Device is. If there are more cells with minimum Total Difference value then we consider previous location of the wireless client device in computing the current location and if there is no previous location then we choose the cell or current location closest to the entry point for the area where the wireless client device is in. The above novel technique of providing the location for a wireless client device is the claim for this invention.

Description:
Location Algorithm for Wireless Networks

In this invention we have a wireless network deployed at an area or a site with the help of Wireless Access Points. Let us consider the two dimensional surface area of the site as a rectangle of m*n square unit area with m*n cells of one square unit each. Now depending upon the range of the Wireless Access Point and which cell it is placed in along with its orientation, the Wireless Access Point will cover a subset of cells of the total m*n cells. We build a hash map here consisting of Wireless Access Point identifier or its Medium Access Control (MAC) address as its key and the value as subset of the total m*n cells which are within the coverage of the Wireless Access Point with each object corresponding to the cell in the subset holding the expected Received Signal Strength Indicator (RSSI) value from the Wireless Access Point if the wireless client device is present in that cell. Now at run time when we get location feeds for a particular client device, we first look up for the Wireless Access Point we got the feed from and then we look up in the hash map to find out set of cells called location set who have their corresponding objects holding Received Signal Strength Indicator (RSSI) value very close or equal to the real time Received Signal Strength Indicator (RSSI) value in the location feed from the Wireless Access Point for the wireless client device. We form a set of such cells or location set for at least two Access Points (This method requires at least two Access Points to be deployed) or more if possible. Then we take an intersection of the location set (set of cells having their corresponding objects holding close or equal value of RSSI we got from the location feed) for each Wireless Access Point from whom we got the location feeds for the wireless client device. Then for each cell in the intersection we took earlier, we calculate the Total Difference by summing up the difference for each Wireless Access Point which is the difference between the Received Signal Strength Indicator (RSSI) value held by the object corresponding to the cell for the Wireless Access Point and the Received Signal Strength Indicator (RSSI) value received from the location feed for the wireless client device from the same Wireless Access Point. The cell with the minimum Total Difference value is where the wireless client Device is.

If there are more cells with minimum Total Difference value then we consider previous location of the wireless client device in computing the current location and if there is no previous location then we choose the cell or current location closest to the entry point for the area where the wireless client device is in.