Wireless communications network

• US 20040147267A1
• Filed: 03/25/2004
• Published: 07/29/2004
• Est. Priority Date: 03/28/2001
• Status: Abandoned Application

• Current Assignee: Norwood Systems Pty Ltd. (Norwood Systems Ltd.)
• Original Assignee: Norwood Systems Pty Ltd. (Norwood Systems Ltd.)
• Inventors: Parsons, David, Hill, Stephen, Kenny, Steven, Poon, Dickson
• Application Number:
  US10/473,066
• Publication Number:
  US 20040147267A1
• Time in Patent Office: Days
• US Class Current: 455/441
• CPC Class Codes: H04W 36/0064 of control information between different access points
• CPC Class Codes: H04W 64/00 Locating users or terminals or network equipment for network management purposes, e.g. mobility management
• CPC Class Codes: H04W 84/10 Small scale networks; Flat hierarchical networks
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

A wireless telecommunications network (100) comprises a multiplicity of Bluetooth™ units, some of which are fixed and act as base units (BS1; BS2; BS3; BS4) and some mobile (MS1; MS2; MS3; MS4). The fixed units are connected to a Local Area Network (LAN) along with a telephony gateway (4) and a PABX (5) and PSTN (6). Methods for controlling handoff of mobile units while roaming within the network are provided, as well a method for determining the order of handoffs and the positions of mobile positions within the network.

Claims

1. A method for determining information regarding a mobile terminal'"'"'s movement within a wireless network including a plurality of fixed and mobile terminals, the method comprising the steps of:

measuring synchronised Received Signal Strength Information (RSSI) measurements at, at least, two different points in time from at least three fixed terminals for a mobile terminal moving within the network;

interpolating the synchronised measurements to provide an estimate of the distance of the mobile terminal, from each of the at least three fixed terminals, at each different point in time;

determining an estimated position of the mobile terminal, at each different point in time, from the estimated distances of the mobile terminal from each of the fixed terminals; and

determining the mobile terminal velocity by dividing the distance between the positions of the mobile terminal at the two different points in time by the time interval between the two different points in time.

2. A method as claimed in claim 1, wherein the estimated position is determined by triangulation.

3. A method as claimed in claim 1 or claim 2, wherein the method further includes the step of carrying out a plurality of determinations of the estimated position of the mobile terminal and applying a non-linear least squares fit algorithm to the triangulation step.

4. A method as claimed in claim 3, wherein the non-linear least squares fit algorithm includes the step of deriving the sum of squares error function and determines the mobile terminal position that minimises that function.

5. A method as claimed in any preceding claim, wherein the method further includes the steps of defining a residual error for the mobile terminal and each fixed terminal, the residual error being defined as the value of the absolute difference between the distance estimate and the calculated distance using the co-ordinates of the fixed terminal and the mobile terminal estimates, determining any residual error values having a value greater than a predetermined level removing any RSSI measurements between the mobile terminal and a fixed terminal within a predefined radius of a location where the residual error values are greater than the predetermined value, from future calculations.

6. A method as claimed in any preceding claim, wherein the method further includes the step of determining the direction of travel of the mobile terminal.

7. A method as claimed in any preceding claim, wherein the method further includes the step of building a map of mobile terminal movement within the network environment.

8. A wireless network comprising a plurality of fixed terminals in communication with one or more mobile terminals roaming within the network, the network including control means operable to determine the velocity of a mobile terminal by measuring synchronised Received Signal Strength Information (RSSI) measurements for the mobile terminal from at least three fixed terminals at at least two different points in time;

to interpolate the measurements to provide an estimate of the distance of the mobile terminal from each of the at least three fixed terminals at each different point in time;

to estimate a position of the mobile terminal, at each different point in time, from the estimated distances of the mobile terminal from the at least three fixed terminal; and

to determine the velocity of the mobile terminal by dividing the distance between the positions of the mobile terminal at the two different points in time by the time interval between the two different points in time.

9. A wireless network as claimed in claim 8, wherein the control means is operable to estimate the mobile terminal position using triangulation.

10. A wireless network as claimed in claim 8 or claim 9, wherein the control means is further operable to provide a plurality of determinations of the estimated position of the mobile terminal and to apply a non-linear least squares fit algorithm to the triangulation step.

11. A wireless network as claimed in claim 10, wherein the non-linear squares fit algorithm includes the step of deriving the sum of squares error function and determines the mobile terminal position that minimises that function.

12. A wireless network as claimed in any of claims 8 to 11, wherein the control means is further operable to define a residual error for the mobile terminal and each base terminal as the value of the absolute difference between the distance estimate and the calculated distance using the co-ordinates of the fixed terminal and the mobile terminal estimates, to determine if any residual error values have a value greater than a predetermined level;

and to remove any RSSI measurements between the mobile terminal and a fixed terminal within a predefined radius of a location where the residual error values are greater than the predetermined value, from future calculations.

13. A wireless network as claimed in any of claims 8 to 12, wherein the control means is further operable to determine, on the basis of the measurements, the direction of movement of the mobile terminal within the network.

14. A wireless network as claimed in any of claims 8 to 13, wherein the control means is further operable to build up a map of the mobile terminal movement within the wireless network environment from the velocity and direction of travel information.

15. A wireless network as claimed in any of claims 8 to 14, wherein the control means may include storage means for storage of the velocity and direction of travel information therein.

16. A wireless network comprising a plurality of terminals, the terminals being operable within the network as either master or slave units, and within the network there is provided first second and third terminals in which the first and second terminals are in communication with each other in a first piconet whereby the first terminal is a master unit and the second terminal is a slave unit, the terminals being operable to control a switch in communication between the second and first terminals to communication between the second and third terminals in a second piconet.

17. A wireless network as claimed in claim 16, wherein the first and third terminals are operable to communicate with each other to request and agree transfer of communication between the first and second terminals to communication between second and third terminals, to communicate information regarding the first piconet, and the second terminal, to the third terminal, the third terminal being further operable, upon receipt of the information and agreement to accept the second terminal into the second piconet, to temporarily assume the role of master of the first piconet to enable communication with the second terminal and to provide information regarding the second piconet to the second terminal, the second terminal being operable, in response to the second piconet information to respond to the third terminal and to communicate therewith to transfer the second terminal into the second piconet.

18. A wireless network as claimed in claim 17, wherein communication between the first and second terminals is suspended during transfer of the second terminal to the second piconet.

19. A wireless network as claimed in any of claims 16 to 18, wherein the network is a network of Bluetooth™

units.

20. A method for performing handoff from a first terminal in communication with a second terminal, to a third terminal in a wireless network comprising a plurality of terminals, the terminals being operable within the network as either master or slave units, and within the network there is provided the first second and third terminals in which the first and second terminals are in communication with each other in a first piconet whereby the first terminal is a master unit and the second terminal is a slave unit, the method including the step of controlling a switch in communication between the second and first terminals to communication between the second and third terminals in a second piconet.

21. A method as claimed in claim 20, wherein the method further includes the steps of the first and third terminals communicating with each other to request and agree transfer of communication between the first and second terminals to communication between second and third terminals, and to communicate information regarding the first piconet, and the second terminal, to the third terminal;

the third terminal temporarily assuming the role of master of the first piconet to enable communication with the second terminal and providing information regarding the second piconet to the second terminal, upon receipt of the information and agreement to accept the second terminal into the second piconet; and

the second terminal responding, in response to the second piconet information, to the third terminal and to communicate therewith, to transfer the second terminal into the second piconet.

22. A method as claimed in claim 21, wherein communication between the first and second terminals is suspended during transfer of the second terminal to the second piconet.

23. A method as claimed in any of claims 20 to 22, wherein the method includes the step of determining the third terminal from the terminals in the wireless network.

24. A method for determining handoff sequencing within a wireless network comprising a plurality of fixed terminals in wireless communication with one or more mobile terminals roaming within the network, the method including the steps of:

determining the probable paths of the mobile terminals within the network;

determining a set of fixed terminals within the network to which the mobile terminals could be in communication therewith;

creating a first bipartite graph with the set of fixed and mobile terminals;

applying weightings to the edges of the first bipartite graph in accordance with predetermined parameters to create a weighted bipartite graph; and

solving an optimal assignment problem for the weighted bipartite graph to derive a second graph having a second set of edges, to determine a new set of connections between mobile and fixed terminals.

25. A method as claimed in claim 24, further comprising the step of comparing the first and second bipartite graphs, whereby edges not in the first graph represent communications links that should be made, and edges in the first, but not in the second, represent communications links that need to be broken.

26. A method as claimed in claim 24 or claim 25, wherein the predetermined parameters include providing high weightings for active connections that should not be broken unless required to allow all mobile terminals to be connected, and low weightings for connections requiring handoff.

27. A method as claimed in any of claims 24 to 26, wherein a further predetermined parameter is the probable path that a mobile terminal may take within the network.

28. A method as claimed in claim 27, wherein the probable path is determined by historical data.

29. A method as claimed in claim 27, wherein the probable path is determined by its velocity.

30. A method as claimed in any of claims 24 to 29, wherein a further predetermined parameter is the number of fixed terminals to be used.

31. A wireless network comprising a plurality of fixed terminals in wireless communication with one or more mobile terminals roaming within the network, the network including a control means operable to determine the probable paths of the mobile terminals within the network, and a set of fixed terminals within the network to which the mobile terminals could be in communication therewith, the control means being further operable to create a first bipartite graph with the set of fixed and mobile terminals, to apply weightings to the edges of the first bipartite graph in accordance with predetermined parameters to create a weighted bipartite graph, and to solve an optimal assignment problem for the weighted bipartite graph to derive a second graph having a second set of edges, to determine a new set of connections between mobile and fixed terminals.

32. A network as claimed in claim 31, wherein the control means is further operable to compare the first and second bipartite graphs such that edges not in the first graph represent communications links that should be made, and edges in the first, but not in the second represent communications links that need to be broken.

33. A network as claimed in claim 31 or claim 32, wherein the predetermined parameters include providing high weightings for active connections that should not be broken unless required to allow all mobile terminals to be connected, and low weightings for connections requiring handoff.

34. A network as claimed in any of claims 31 to 33, wherein a further predetermined parameter is the probable path that a mobile terminal may take within the network.

35. A network as claimed in claim 34, wherein the probable path is determined by historical data.

36. A network as claimed in claim 34, wherein the probable path is determined by its velocity.

37. A network as claimed in any of claims 31 to 36, wherein A further predetermined parameter is the number of fixed terminals to be used.