ENHANCING MOBILE MULTIPLE-ACCESS COMMUNICATION NETWORKS

• US 20120020208A1
• Filed: 01/20/2011
• Published: 01/26/2012
• Est. Priority Date: 04/28/2003
• Status: Active Grant

• Current Assignee: Elbit Systems Limited
• Original Assignee: Elbit Systems Limited
• Inventors: TZIDON, AVIV
• Granted Patent: US 9,013,988 B2
• Time in Patent Office: Days
• US Class Current: 370/230
• CPC Class Codes: G01S 19/23 Testing, monitoring, correcting or calibrating of receiver elements
• CPC Class Codes: G01S 19/42 Determining position
• CPC Class Codes: G01S 19/52 Determining velocity
• CPC Class Codes: H04B 7/2643 using time-division multiple access [TDMA] H04B7/2615, H04B7/2618 take precedence
• CPC Class Codes: H04J 3/1682 Allocation of channels according to the instantaneous demands of the users, e.g. concentrated multiplexers, statistical multiplexers
• CPC Class Codes: H04W 4/06 Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
• CPC Class Codes: H04W 84/06 Airborne or Satellite Networks space-based or airborne stations H04B7/185

Abstract

A method for estimating engine thrust values of an aircraft is disclosed, the method comprising calculating estimated thrust value of an engine based on an equation of longitudinal motion, aircraft data measured during flight and calibrated drag/lift models, and a method for determining the thrust of an aircraft engine, based on information available from tracking the aircraft air-speed, acceleration, and position, the method comprising calculating the thrust, using the following equation: Thrust=mg{dot over (H)}/V+m{dot over (V)}+Drag.

Claims

1-8. -8. (canceled)

9. A method for maintaining a desired update rate of data communication in a multiple access communications network, the method comprising:

calculating number of participants in the network which enables maintaining of a desired update rate;

determining a communication range R allowing communication between said participants; and

limiting communication to said allowed communication range R.

10. A method according to claim 9, further comprising allocating transmission time slots between said participants.

11. A method according to claim 10, further comprising increasing said allowed communication range R when at least one time slot becomes unutilized.

12. A method according to claim 9, wherein said allowed communication range R is dynamically controlled by changing the transmission bit rate.

13. A method according to claim 10, wherein said procedure of determining a communication range R is dynamic and further includes the sub procedures of:

determining whether a first message transmitted by a first participant is receivable in whole within a first time slot allocated to said first participant, based on the location of said first participant relative to said communication range R;

in case said first message is receivable in whole, listening to said first message;

in case said first message is not receivable in whole within said first time slot and a first portion of said first message is receivable within said first time slot and a second portion of said first message extends into a second time slot, deciding whether to listen during said second time slot to said second portion in a frequency associated with said first message, or to listen during said second time slot to a frequency associated with said second time slot.

14. A method according to claim 13, wherein data in at least said first message is arranged in a descending level of importance, so that more important data is transmitted first.

15. A method according to claim 13, wherein data intended to a closer target receiver is transmitted later-on during said at least first message.

16. A method according to claim 13, wherein if at least said first message is shorter than the duration of said first time slot, at least said first message is transmitted repeatedly to fill said first time slot.

17. A method according to claim 9, wherein said number of participants is dynamically changing, all of said participants being synchronized and waiting in receive mode with the first frequency of the series of a current time slot,

wherein said method further comprises the steps of:

determining, by each participant, if the number of participants has exceeded a number that renders the update rate below a preferred update rate;

calculating, by the participants, a new allowed range R defining a bubble within which the number of participants is suitable for maintaining the preferred update rate;

informing, by the participants, said new allowed range R for said participants to all other participants within said new allowed range R;

filtering out messages transmitted from a participant located outside said new allowed range R, thereby ensuring that the communication is limited to the participants within said bubble and carried out at least at the desired update rate.

18. A method according to claim 17, wherein said participants are synchronized,

wherein said method further comprises dynamically filtering communication between said participants, for each participant said procedure of dynamically filtering further includes the sub procedures of:

starting to receive a message;

determining whether the sender is within said allowed communication range R;

if yes, listening to said message during a first time slot;

if not, checking whether the sender of said message is more important than a sender of a next message in a subsequent time slot;

if said sender is more important, continuing to listen, during said subsequent time slot, to said message on the frequency associated with said message;

otherwise, during said subsequent time slot, receiving data in a frequency series associated with said next time slot.

19. The method of claim 18, wherein said message is organized in data bits relating to information details in descending order of importance.

20. The method of claim 18, wherein said message is organized in data bits relating to information details in an inverse ordered with respect to the distance of the participants from the sender of said message.

21. The method of claim 18, wherein said message or a portion of said message is transmitted repeatedly during said first time slot.

22. A method according to claim 12, wherein said participants are synchronized, each of said participants can transmit and receive data over a respective said allowed range R, and may receive only one data communication at any given time,

wherein said dynamic control of said allowed communication range R is achieved by the sub procedures of:

determining by a participant if it is necessary to increase the allowed range R, in order to reach at least one distant participant;

calculating a new bit rate at which a larger allowed range R is achieved;

informing all other participants of said new bit rate; and

applying said new bit rate by all participants.