MOBILE NETWORKING METHOD AND SYSTEM

• US 20090047948A1
• Filed: 08/13/2008
• Published: 02/19/2009
• Est. Priority Date: 08/16/2007
• Status: Abandoned Application

• Current Assignee: TCM Mobile LLC
• Original Assignee: TCM Mobile LLC
• Inventors: Turetsky, Eliyahu, Kazarnovski, Roman
• Application Number:
  US12/190,952
• Publication Number:
  US 20090047948A1
• Time in Patent Office: Days
• US Class Current: 455/432.100
• CPC Class Codes: H04W 48/20 Selecting an access point
• CPC Class Codes: H04W 64/00 Locating users or terminals or network equipment for network management purposes, e.g. mobility management

Abstract

A dynamically adapted network environment is disclosed. The dynamically adapted network environment has one or more mobile objects (MO'"'"'s) and one or more corresponding network neighborhoods. Each of the one or more MO'"'"'s is the center of a corresponding network neighborhood which is adapted locally to accommodate a movement of its corresponding MO in a manner that sustains substantially seamless communication traffic. A method of enabling seamless wireless roaming of a mobile object (MO) on a wireless network is also disclosed. A network neighborhood is defined for the MO based at least on a location of the MO. Communication traffic associated with the MO is buffered for redirection to at least one predicted future network connection point (NCP) which is part of the network neighborhood.

Claims

1. A dynamically adapted network environment, comprising:

one or more mobile objects (MO'"'"'s); and

one or more corresponding network neighborhoods wherein each of the one or more MO'"'"'s is the center of a corresponding network neighborhood which is adapted locally to accommodate a movement of its corresponding MO in a manner that sustains substantially seamless communication traffic.

2. A method of identifying a network neighborhood for a mobile object (MO), comprising:

determining a location of the MO;

predicting one or more other network connection points (NCP'"'"'s) which the MO is likely to connect-to in addition to a current NCP based on at least the location of the MO;

identifying any network objects necessary to provide communication traffic between the current NCP and the one or more other NCP'"'"'s; and

identifying the network neighborhood for the MO as including the current NCP, the one or more other NCP'"'"'s, and the one or more network objects.

3. The method of claim 2, wherein determining a location of the MO comprises inferring MO location from the location of the current NCP.

4. The method of claim 3, wherein predicting one or more other NCP'"'"'s which the MMO is likely to connect-to comprises selecting one or more other NCP'"'"'s which are adjacent to a coverage area of the current NCP.

5. The method of claim 2, wherein determining a location of the MO comprises triangulating the location of the MO.

6. The method of claim 5, wherein predicting one or more other NCP'"'"'s which the MO is likely to connect-to comprises selecting one or more other NCP'"'"'s which have coverage areas in proximity to the determined location of the MO.

7. The method of claim 2, further comprising determining a heading of the MO, and wherein predicting one or more other NCP'"'"'s which the MO is likely to connect-to comprises selecting one or more other NCP'"'"'s which substantially lie in the direction of the MO'"'"'s heading.

8. The method of claim 2, further comprising determining a velocity vector of the MO, and wherein predicting one or more other NCP'"'"'s which the MO is likely to connect-to comprises selecting one or more other NCP'"'"'s which substantially lie in the direction of the MO'"'"'s velocity vector and within a distance the MO is likely to cover based on its velocity vector.

9. The method of claim 8, further comprising determining an acceleration of the MO, and wherein predicting one or more other NCP'"'"'s which the MO is likely to connect to further comprises selecting one or more other NCP'"'"'s which substantially lie in the direction of the MO'"'"'s velocity vector and within a distance the MO is likely to cover based on its velocity vector and acceleration.

10. A method of enabling seamless wireless roaming of a mobile object (MO) on a wireless network, comprising:

defining a network neighborhood for the MO based at least on a location of the MO; and

buffering communication traffic associated with the MO for redirection to at least one predicted future network connection point (NCP) which is part of the network neighborhood.

11. The method of claim 10, further comprising:

predicting a reconnection moment for the at least one predicted future NCP; and

wherein the buffering communication traffic associated with the MO for redirection to the at least one predicted future NCP begins substantially at a changeover time before the predicted reconnection moment.

12. The method of claim 10, wherein the changeover time is less than a time between reconnections of the MO between sequential NCP'"'"'s.

13. The method of claim 10, wherein the buffering ends at a time not less than the changeover time after the reconnection moment.

14. The method of claim 10, wherein defining the network neighborhood for the MO based at least on a location of the MO further comprises:

determining the location of the MO;

predicting one or more other NCP'"'"'s which the MO is likely to connect-to in addition to a current NCP based on at least the location of the MO;

identifying any network objects necessary to provide communication traffic between the current NCP and the one or more other NCP'"'"'s;

identifying the network neighborhood for the MO as including the current NCP, the one or more other NCP'"'"'s, and the one or more network objects; and

wherein the at least one predicted future NCP is selected from the one or more other NCP'"'"'s.

15. The method of claim 14, wherein determining a location of the MO comprises inferring MO location from the location of the current NCP.

16. The method of claim 15, wherein predicting one or more other NCP'"'"'s which the MO is likely to connect-to comprises selecting one or more other NCP'"'"'s which are adjacent to a coverage area of the current NCP.

17. The method of claim 14, wherein determining a location of the MO comprises triangulating the location of the MO.

18. The method of claim 17, wherein predicting one or more other NCP'"'"'s which the MO is likely to connect-to comprises selecting one or more other NCP'"'"'s which have coverage areas in proximity to the determined location of the MO.

19. The method of claim 14, further comprising determining a heading of the MO, and wherein predicting one or more other NCP'"'"'s which the MO is likely to connect-to comprises selecting one or more other NCP'"'"'s which substantially lie in the direction of the MO'"'"'s heading.

20. The method of claim 14, further comprising determining a velocity vector of the MO, and wherein predicting one or more other NCP'"'"'s which the MO is likely to connect-to comprises selecting one or more other NCP'"'"'s which substantially lie in the direction of the MO'"'"'s velocity vector and within a distance the MO is likely to cover based on its velocity vector.

21. The method of claim 20, further comprising determining an acceleration of the MO, and wherein predicting one or more other NCP'"'"'s which the MO is likely to connect to further comprises selecting one or more other NCP'"'"'s which substantially lie in the direction of the MO'"'"'s velocity vector and within a distance the MO is likely to cover based on its velocity vector and acceleration.

22. The method of claim 14, further comprising:

assigning a constant and unique mobile object network identifier to the MO following a first connection of the MO to the wireless network; and

wherein defining the network neighborhood for the MO based at least on the location of the MO further comprises;

a) assigning neighborhood network identifiers to the current NCP, the one or more other NCP'"'"'s which the MO is likely to connect-to, and the network objects necessary to provide communication traffic between the current NCP and the one or more other NCP'"'"'s; and

b) tracking the network neighborhood by correlating the unique mobile object network identifier with the assigned neighborhood network identifiers.

23. The method of claim 22, further comprising:

updating the network neighborhood by repeating the defining of the network neighborhood, and wherein;

assigned neighborhood network identifiers are maintained for elements from the previous definition of the network neighborhood which are still in the updated network neighborhood;

new elements of the updated network neighborhood which were not present in the previous network neighborhood are assigned new neighborhood network identifiers from a pool of available network identifiers; and

neighborhood network identifiers from elements of the previous definition of the network neighborhood which are no longer in the updated network neighborhood are returned to the pool of available network identifiers.

24. A system for mobile networking, comprising:

a) a controller;

b) a plurality of network connection points (NCP'"'"'s) configured to communicate with a mobile object (MO);

c) at least one network object which couples the plurality of NCP'"'"'s to the controller; and

d) wherein one or more of the controller, the plurality of NCP'"'"'s, and the at least one network object are configured to;

1) define a network neighborhood for the MO based at least on a location of the MO; and

2) buffer communication traffic associated with the MO for redirection to at least one predicted future network connection point (NCP) which is part of the network neighborhood.

25. The system of claim 24, wherein one or more of the controller, the plurality of NCP'"'"'s, and the at least one network object are further configured to:

predict a reconnection moment for the at least one predicted future NCP;

wherein;

i) the buffered communication traffic associated with the MO for redirection to the at least one predicted future NCP begins substantially at a changeover time before the predicted reconnection moment;

ii) the changeover time is less than a time between reconnections of the MO between sequential NCP'"'"'s; and

iii) the buffering ends at a time not less than the changeover time after the reconnection moment.