Method for propagating messages in a communication network to a satellite network

• US 9,300,389 B2
• Filed: 03/30/2011
• Issued: 03/29/2016
• Est. Priority Date: 04/16/2010
• Status: Active Grant

• Current Assignee: Thales SA
• Original Assignee: Thales SA
• Inventors: Calmettes, Thibaud, Monnerat, Michel, Karouby, Phillippe
• Primary Examiner(s): Aminzay, Shaima Q
• Application Number:
  US13/640,296
• Publication Number:
  US 20130029593A1
• Time in Patent Office: 1,826 Days
• Field of Search: 455/12.1, 455/414.1, 455/423, 455/428, 455/427, 455/429, 455/431, 455/456.1, 342/356, 342/357.46, 370/316
• US Class Current: 1/1
• 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: H04B 7/18508 with satellite system used as relay, i.e. aeronautical mobile satellite service

Abstract

A method is provided for propagating messages in a communication network to a satellite network, the communication network being made up of a set of users and the satellite network comprising at least one satellite, the set of users comprising a sender and a recipient, said recipient being intended to send to the satellite network an initial message originating from the sender, at least one satellite of the satellite network being visible to said recipient, in which each user determines a number of intermediaries needed to reach the recipient and periodically sends a message comprising said number of intermediaries needed to reach the recipient, and said initial message being sent by the sender to the visible user having the lowest possible number of necessary intermediaries, called optimal intermediary, said optimal intermediary becoming, in turn, sender and sending the initial message, the operation being repeated until the recipient is reached.

Claims

1. A method for propagating messages in a communication network to a satellite network, the communication network being made up of a set of users and the satellite network comprising at least one satellite, the set of users comprising a sender and a recipient, said recipient being intended to send to the satellite network an initial message originating from the sender, at least one satellite of the satellite network being visible to said recipient, said satellite being able to receive messages sent by said recipient, each user in the set of users being able to send a message with a range such that a subset of users, being visible users, can receive said messages, so that a message can be transmitted from user to user, so that, the initial message sent by the sender, can be transmitted to the recipient by passing through a number of intermediary users, the number being between:

zero, if the sender and recipient are visible users to each other, and infinite, if there is no chain of intermediate users going to the recipient,

each user determining a number of intermediaries needed to reach the recipient and periodically sending a message comprising said number of intermediaries needed to reach the recipient, and wherein said initial message is sent by the sender to a visible user having a lowest number of intermediaries to reach the recipient, being an optimal intermediary, said optimal intermediary becoming, in turn, sender and sending the initial message, the operation being repeated until the recipient is reached.

2. The method as claimed in claim 1, wherein the users are aircraft and/or ground stations.

3. The method as claimed in claim 1, in which at least some of the users have a fixed position known to the sender.

4. The method as claimed in claim 1, wherein the message sent periodically by the set of users comprises the position of the user concerned.

5. The method as claimed in claim 4, wherein the message sent periodically by the set of users also comprises the speed of the user concerned.

6. The method as claimed in claim 4, wherein the message sent periodically by the set of users also comprises the heading of the user concerned.

7. The method as claimed in claim 4, wherein the sender determines, in real time, the estimated position of the users of the communication network and dynamically determines the shortest path by which the initial message can reach the recipient by passing through the lowest number of intermediaries to reach the recipient.

8. The method as claimed in claim 1, wherein the message sent periodically by the set of users also comprises information on a duration of validity during which the number of intermediaries needed to reach the recipient contained in said message for the user concerned is valid.

9. The method as claimed in claim 8, wherein the message sent periodically by the set of users also comprises a future number of intermediaries needed to reach the recipient after said duration of validity has elapsed, said future number of intermediaries needed to reach the recipient having its own duration of validity.

10. The method as claimed in claim 7, wherein the message sent periodically by the set of users also comprises a succession of future numbers of intermediaries needed to reach the recipient after said duration of validity has elapsed, each future number of intermediaries needed to reach the recipient having its own duration of validity.