Method and apparatus for creating links to extend a network

• US 7,072,977 B1
• Filed: 04/10/2001
• Issued: 07/04/2006
• Est. Priority Date: 04/10/2001
• Status: Expired due to Fees

• Current Assignee: DRS Advanced ISR, LLC (Leonardo S.p.A.)
• Original Assignee: Codem Systems, Inc.
• Inventors: Bernard, Glenn G., Gargasz, John M.
• Primary Examiner(s): Lim, Krisna
• Application Number:
  US09/828,845
• Time in Patent Office: 1,911 Days
• Field of Search: 709/238, 709/217, 455/431, 455/562.1, 455/3.01, 455/422.1, 370/316, 370/352
• US Class Current: 709/238
• CPC Class Codes: B64D 11/0015 Arrangements for entertainment or communications, e.g. radio, television
• CPC Class Codes: B64D 11/00155 Individual entertainment or communication system remote controls therefor, located in or connected to seat components, e.g. to seat back or arm rest
• CPC Class Codes: B64D 11/0624 Arrangements of electrical connectors, e.g. for earphone, internet or electric supply
• CPC Class Codes: H04B 7/18504 Aircraft used as relay or high altitude atmospheric platform
• CPC Class Codes: H04B 7/18506 Communications with or from aircraft, i.e. aeronautical mobile service
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 67/12 specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
• CPC Class Codes: H04W 40/00 Communication routing or communication path finding
• CPC Class Codes: H04W 76/10 Connection setup
• CPC Class Codes: H04W 88/04 adapted for relaying to or from another terminal or user

Abstract

High bandwidth network access is extended to vehicles and passengers on vehicles. The network is extended to a vehicle by way of one or more intermediate nodes, which may be other vehicles or signal relays. In order to acquire the vehicles to which to extend the network, route data is provided to the intermediate nodes and to the vehicles. Computers on-board the vehicles and intermediate nodes determine which pairs of vehicles and intermediate nodes should establish links to form a network based on the route data and link scoring. The vehicles and intermediate nodes then control directional antennas to point at each other based on the route data and the scoring to establish the links.

Claims

1. A method of extending the coverage area of a network that is accessible via at least one network interface node by establishing links among the at least one network interface node and a plurality of mobile nodes, wherein each mobile node includes at least three directional antennas for creating links to other nodes to, the method at a mobile node comprising:

determining possible links to other nodes based on route data for the nodes;

scoring each remaining link;

eliminating the lowest scoring links when the number of remaining links for the mobile node exceeds the maximum number of links permitted; and

aiming the directional antennas of the mobile node to create the remaining links.

2. The method according to claim 1, further comprising:

computing geometric data for each possible link; and

eliminating occluded links based on the geometric data.

3. The method according to claim 1, wherein the network interface nodes are situated at fixed, ground stations and the route data includes geographic data for each of the network interface nodes.

4. The method according to claim 1, wherein the network interface nodes are satellites and the route data further includes latitude, longitude, altitude, time, velocity and bearing data.

5. The method according to claim 1, wherein the route data includes latitude, longitude, altitude, time, velocity and bearing data for the mobile nodes.

6. The method according claim 1, wherein at least a portion of the route data is received by the mobile node via a separate antenna from nearby mobile nodes.

7. The method according to claim 1, wherein at least a portion of the route data is received by the mobile node via a link to the network.

8. The method according to claim 1, wherein the mobile node establishes at least one link to the at least one network interface node based on the scoring.

9. The method according to claim 7, wherein the mobile node maximizes the number of links to the at least one network interface node based on the scoring.

10. The method according to claim 1, further comprising scoring the links to maximize the number of mobile nodes coupled to the network.

11. The method according to claim 1, wherein the scoring is performed iteratively to minimize the number of links and maximize connectivity to the network.

12. The method according to claim 1, wherein the scoring is performed based on a Dijkstra algorithm.

13. The method according to claim 1, wherein the mobile node is a mobile platform having a plurality of terminals coupled to the network via the links.

14. The method according to claim 12, wherein the network and links provide the terminals access to a digital broadcast service.

15. The method according to claim 12, wherein the network and links provide the terminals access to the Internet.

16. The method according to claim 12, wherein the network and links provide the terminals access to a plurality of services including digital broadcast services, the Internet and electronic mail.

17. The method according to claim 1, wherein the method is periodically repeated.

18. The method according to claim 1, wherein the method is repeated every two minutes.

19. The method according to claim 1, wherein the method is repeated upon the mobile platform nearing a boundary of direct linking to a network interface node.

20. A computer program product for causing a system on a node to establish links to other nodes, including network interface nodes for accessing a network and mobile nodes, wherein each node includes at least three directional antennas for creating links to other nodes, the computer program product including a computer useable medium having computer program logic therein, the computer program logic comprising:

determining means for causing a system to determine possible links to other nodes based on route data for the nodes;

scoring means for causing the system to score each link;

eliminating means for causing the system to eliminate the lowest scoring links when the number of links for the mobile node exceeds the maximum number of links permitted; and

aiming means for causing the computer to aim the directional antennas of the mobile node to create the remaining links.

21. The computer program product according to claim 20, further comprising:

computing geometric data for each possible link; and

eliminating occluded links based on the geometric data.

22. The computer program product according to claim 20, wherein the network interface nodes are situated at fixed, ground stations and the route data includes geographic data for each of the network interface nodes.

23. The computer program product according to claim 20, wherein the network interface nodes are satellites and the route data further includes latitude, longitude, altitude, time, velocity and bearing data.

24. The computer program product according to claim 20, wherein the route data includes latitude, longitude, altitude, time, velocity and bearing data for the mobile nodes.

25. The computer program product according claim 20, further comprising receiving means for causing the system to receive at least a portion of the route data via an omni-directional antenna from nearby nodes.

26. The computer program product according to claim 20, further comprising receiving means for causing the system to receive at least a portion of the route data via a link.

27. The computer program product according to claim 20, further comprising establishing means for causing the system to establish at least one link to the at least one network interface node based on the scoring.

28. The computer program product according to claim 26, wherein the scoring means maximizes causes the system to maximize the number of links to the at least one network interface node.

29. The computer program product according to claim 20, wherein the scoring means causes the system to maximize the number of mobile nodes coupled to the network.

30. The computer program product according to claim 20, wherein the scoring means causes the system to perform scoring iteratively to minimize the number of links and maximize connectivity to the network.

31. The computer program product according to claim 20, wherein the scoring means causes the system to perform the scoring based on a Dijkstra algorithm.

32. The computer program product according to claim 20, wherein the node is a mobile platform having a plurality of terminals coupled to the network via the links.

33. The computer program product according to claim 31, wherein the network and links provide the terminals access to a digital broadcast service.

34. The computer program product according to claim 31, wherein the network and links provide the terminals access to the Internet.

35. The computer program product according to claim 31, wherein the network and links provide the terminals access to a plurality of services including digital broadcast services, the Internet and electronic mail.

36. The computer program product according to claim 20, wherein the system periodically repeats executing the computer program logic.

37. The computer program logic according to claim 20, wherein the system periodically repeats executing the computer program logic method every two minutes.

38. The computer program logic according to claim 20, wherein the system repeats executing the computer program logic when a link is close to being broken.