Patent Publication Number: US-6904021-B2

Title: System and method for providing adaptive control of transmit power and data rate in an ad-hoc communication network

Description:
BACKGROUND OF THE INVENTION 
   1. Field of the Invention 
   The present invention relates to a system and method for adaptively controlling the transmit power and data rate at which a communication signal is transmitted between nodes in a wireless ad-hoc communication network. More particularly, the present invention relates to a system and method for selecting an appropriate transmit power and data rate at which a communication signal is transmitted over a link between nodes in a wireless ad-hoc communication network based on factors such as variations in path loss in the link, fading conditions, noise level estimation and overall link quality. 
   2. Description of the Related Art 
   In recent years, a type of mobile communications network known as an “ad-hoc” network has been developed. In this type of network, each user terminal (hereinafter “mobile node”) is capable of operating as a base station or router for the other mobile nodes, thus eliminating the need for a fixed infrastructure of base stations. Accordingly, data packets being sent from a source mobile node to a destination mobile node are typically routed through a number of intermediate mobile nodes before reaching the destination mobile node. Details of an ad-hoc network are set forth in U.S. Pat. No. 5,943,322 to Mayor, the entire content of which is incorporated herein by reference. 
   More sophisticated ad-hoc networks are also being developed which, in addition to enabling mobile nodes to communicate with each other as in a conventional ad-hoc network, further enable the mobile nodes to access a fixed network and thus communicate with other types of user terminals, such as those on the public switched telephone network (PSTN) and on other networks such as the Internet. Details of these types of ad-hoc networks are described in U.S. patent application Ser. No. 09/897,790 entitled “Ad Hoc Peer-to-Peer Mobile Radio Access System Interfaced to the PSTN and Cellular Networks”, filed on Jun. 29, 2001, in U.S. patent application Ser. No. 09/815,157 now U.S. Pat No. 6,807,165 entitled “Time Division Protocol for an Ad-Hoc, Peer-to-Peer Radio Network Having Coordinating Channel Access to Shared Parallel Data Channels with Separate Reservation Channel”, filed on Mar. 22, 2001, and in U.S. patent application Ser. No. 09/815,164 entitled “Prioritized-Routing for an Ad-Hoc, Peer-to-Peer, Mobile Radio Access System”, filed on Mar. 22, 2001, the entire content of each of said patent applications being incorporated herein by reference. 
   As can be appreciated by one skilled in the art, when a node sends packetized data to a destination node, the node typically checks its routing table to determine whether the destination node is contained in its routing table. If the destination node is contained in the node&#39;s routing table, the data is transmitted via a path that leads to the destination node. If the destination node is not listed in the node&#39;s routing table, then the packet is sent to one or more other nodes listed in the node&#39;s routing table, and those other nodes determine if the destination table is listed in their routing tables. The process continues until the data packet eventually reaches the destination node. 
   In these types of ad-hoc networks, data transmitted from one station to another is affected by adverse conditions. These conditions may prevent the transmitted data from being correctly received by the destination station. In order to provide a high reliability of data transfer, the transmit power and data rate must be adjusted to proper levels. Although high transmit power and low data rate assure that the signals are received by the receiving station at the highest reliability, they cannot be used without having negative effect on network operation. For example, because high transmit power enables the transmitted signal to be received at distances far away from the transmitter, this prevents the same frequency channel to be used for making other connections between other stations within the range of the high power transmit signal. Furthermore, transmission at a lower data rate typically uses higher energy than at a higher data rate, while requiring a longer period of time for transmitting the same amount of data that could be transmitted quicker at a higher data rate. 
   Accordingly, a need exists for a system and method for selecting the most appropriate transmit power and data rate at which a communication signal is transmitted over a link between nodes in a wireless ad-hoc communication network. 
   SUMMARY OF THE INVENTION 
   An object of the present invention is to provide a system and method for adaptively controlling the transmit power and data rate at which a communication signal is transmitted between nodes in a wireless ad-hoc communication network. 
   Another object of the present invention is to provide a system and method for selecting an appropriate transmit power and data rate at which a communication signal is transmitted over a link between nodes in a wireless ad-hoc communication network based on factors such as variations in path loss in the link, fading conditions, noise level estimation and overall link quality. 
   These and other objects are substantially achieved by providing a system and method for determining a power level and rate at which data is transmitted over a link between source and destination nodes in a wireless ad-hoc communication network. The system and method perform the operations of computing path loss in the link based on information provided to the source node from the destination node pertaining to characteristics of a message that was transmitted by the source node and received by the destination node, determining a noise factor at the destination node, and calculating the power level and rate at which the data is transmitted over the link from the source node to the destination node based on the path loss and the noise factor. More specifically, the calculating calculates the power level based on the path loss and the noise factor, and determines the rate based on the calculated power level. Furthermore, the path loss is computed dynamically as conditions of said link change over time. 

   
     BRIEF DESCRIPTION OF THE DRAWINGS 
     These and other objects, advantages and novel features of the invention will be more readily appreciated from the following detailed description when read in conjunction with the accompanying drawings, in which: 
       FIG. 1  is a conceptual block diagram of an example of an ad-hoc wireless communications network employing a system and method for evaluating the integrity of links between nodes according to an embodiment of the present invention; 
       FIG. 2  is a block diagram illustrating an example of components of a node employed in the network shown in  FIG. 1 ; 
       FIG. 3  is a conceptual block diagram illustrating an example of the different types of interference than can affect a signal being transmitted from a source node to a destination node in the network shown in  FIG. 1 ; 
       FIG. 4  is a conceptual block diagram illustrating components of the transceiver of a destination node as shown in  FIG. 2 , which produce a Received Signal Strength Indicator (RSSI) and Post Detection Signal Quality (PDSQ); 
       FIG. 5  is a flowchart illustrating an example of operations performed by the ATP in the source node to estimate the noise level at the destination node; 
       FIG. 6  is a graph illustrating an example of estimated noise versus the number of messages transmitted from a source node to a destination node in the network shown in  FIG. 1  as calculated using noise estimation techniques according to an embodiment of the present invention as shown in the flowchart of  FIG. 5 ; and 
       FIG. 7  is a graph illustrating an example of different link quality values representing the quality of a link between a source node and destination node of the network shown in  FIG. 1  as calculated according to an embodiment of the present invention. 
   

   DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     FIG. 1  is a block diagram illustrating an example of an ad-hoc packet-switched wireless communications network  100  employing an embodiment of the present invention. Specifically, the network  100  includes a plurality of mobile wireless user terminals  102 - 1  through  102 -n (referred to generally as nodes or mobile nodes  102 ), and a fixed network  104  having a plurality of access points  106 - 1 ,  106 - 2 , . . .  106 -n (referred to generally as nodes or access points  106 ), for providing the nodes  102  with access to the fixed network  104 . The fixed network  104  includes, for example, a core local access network (LAN), and a plurality of servers and gateway routers, to thus provide the nodes  102  with access to other networks, such as other ad-hoc networks, the public switched telephone network (PSTN) and the Internet. The network  100  further includes a plurality of fixed routers  107 - 1  through  107 -n (referred to generally as nodes or fixed routers  107 ) for routing data packets between other nodes  102 ,  106  or  107 . 
   As can be appreciated by one skilled in the art, the nodes  102 ,  106  and  107  are capable of communicating with each other directly, or via one or more other nodes  102 ,  106  or  107  operating as a router or routers for data packets being sent between nodes  102 , as described in U.S. Pat. No. 5,943,322 to Mayor and in U.S. patent application Ser. Nos. 09/897,790, 09/815,157 and 09/815,164, referenced above. Specifically, as shown in  FIG. 2 , each node  102 ,  106  and  107  includes a transceiver  108  which is coupled to an antenna  110  and is capable of receiving and transmitting signals, such as packetized data signals, to and from the node  102 ,  106  or  107 , under the control of a controller  112 . The packetized data signals can include, for example, voice, data or multimedia. 
   Each node  102 ,  106  and  107  further includes a memory  114 , such as a random access memory (RAM), that is capable of storing, among other things, routing information pertaining to itself and other nodes  102 ,  106  or  107  in the network  100 . The nodes  102 ,  106  and  107  exchange their respective routing information, referred to as routing advertisements or routing table information, with each other via a broadcasting mechanism periodically, for example, when a new node  102  enters the network  100 , or when existing nodes  102  in the network  100  move. A node  102 ,  106  or  107  will broadcast its routing table updates, and nearby nodes  102 ,  106  or  107  will only receive the broadcast routing table updates if within broadcast range (e.g., radio frequency (RF) range) of the broadcasting node  102 ,  106  or  107 . For example, assuming that nodes  102 - 1 ,  102 - 2  and  102 - 7  are within the RF broadcast range of node  102 - 6 , when node  102 - 6  broadcasts its routing table information, that information is received by nodes  102 - 1 ,  102 - 2  and  102 - 7 . However, if nodes  102 - 3 ,  102 - 4  and  102 - 5  through  102 -n are out of the broadcast range, none of those nodes will receive the broadcast routing table information from node  102 - 6 . 
   The manner in which a node  102 ,  106  or  107  controls transmission of data packets to another node  102 ,  106  and  107  in accordance with an embodiment of the present invention will now be described. Specifically, when a node  102 ,  106  or  107  is to transmit data packets to another node, the controller  112  of the transmitting node  102 ,  106  or  107  will control the transceiver  108  to transmit the data packets at a particular transmit power and data rate. Adaptive Control of the Transmit Power (ATP) is the algorithm performed by the controller  112  of the transmitting node  102 ,  106  or  107  that is responsible for identifying the transmit power and data rate that can be used for assuring the most reliable reception at correspondent site while using as little energy as possible, as will now be described. 
   For example,  FIG. 3  shows a typical data transfer in ad-hoc environment between two stations (e.g., nodes  102 ,  106  or  107  shown in  FIG. 1 ) identified as the Source Terminal and the Destination Terminal. The reception at each end of the connection could be affected by adverse conditions. Between the Source Terminal and the Destination Terminal, the signal strength suffers a loss due to propagation (i.e., free space loss) and environment absorption (i.e., vegetation, buildings, fixed or moving objects). Furthermore, sources of electromagnetic radiation transmitting signals or noise on the same frequency band as the received signal can adversely affect the received signal. In addition, the received signal may also arrive following more than one route, which causes signal fading. In summary, many conditions may prevent the transmitted message from being always received correctly. 
   As can be appreciated by one skilled in the art, when the Source Terminal has some data to transmit to the Destination Terminal, the Source Terminal sends a Ready to Send (RTS) message as shown in FIG.  3 . If the Destination Terminal is ready to receive the data, it answers with the Clear To Send (CTS) message. However, the Destination Terminal may answer with a Not Clear to Send (NCTS) message if there is no data channel available at the time. Furthermore, it is possible that the Destination Terminal does not answer the RTS request because the Destination Terminal does not receive the RTS request, for example, when the Destination Terminal is busy receiving or transmitting different data, or if the interference at the Destination Terminal is too strong. In this event, the Source Terminal resends the RTS message after a random period of time. 
   If the Destination Terminal answers with a CTS message, the Source Terminal tunes on data channel and starts sending data. On the other end of the connection, the Destination Terminal tunes on the same data channel and starts receiving that transmitted data. 
   When the data transfer is completed, the Destination Terminal answers back with an Acknowledgment (ACK) message if it received the data correctly, or a Not Acknowledgment (NACK) message if any of the data was received with errors. Both messages contain information about the quality of the received message, such as a Received Signal Strength Indicator (RSSI), Post Detection Signal Quality (PDSQ), Bit Error Rate (BER) and the multipath count (MPC). If, however, after successfully exchanging RTS and CTS messages, the Destination Terminal is not able to receive any data due to, for example, strong interference from another neighbor or signal fading during the reception of the sync sequence, the Destination Terminal cannot synchronize on the transmitted signal and thus cannot answer the Source Terminal with an ACK or NACK message. After waiting for a period of time, the Source Terminal determines that there is no response from the Destination Terminal (i.e., a “NO RESPONSE” condition), and re-sends the RTS message after a random delay. 
   The role of ATP in accordance with an embodiment of the present invention is to control the data rate and the transmit power when transferring data from the Source Terminal to the Destination Terminal in such way that the highest possible data rate is used, the lowest energy is used, and the transmit power and data rate are computed to assure at least a 90% probability that the Destination Terminal will correctly receive the message. As can be appreciated by one skilled in the art, the reliability (i.e., probability of receiving data correctly) of 100% can be achieved only when using infinite energy, meaning that 100% reliability is not practical. ATP in accordance with an embodiment of the present invention uses as much energy as needed for achieving more than 90% reliability for each individual transmission. When a data packet is not received by the Destination Terminal, the same data packet is retransmitted up to five times in this example, which realizes a probability of about 99.999% that the data packet will be correctly received by the Destination Terminal. 
   In order to determine the proper transmit energy, the ATP computes or estimates several elements associated to the quality of the received signal, namely, dynamic variation of the path loss, fading span and noise level at the Destination Terminal, as will now be described. 
   Path Loss 
   In accordance with an embodiment of the present invention, path loss is computed as the difference between the power level of the received signal and the power used for transmitting the received signal. The power used for transmitting the message is known from the history associated with the Destination Terminal, and the signal strength at the Destination Terminal is characterized by the RSSI, PDSQ and MPC. The Destination Terminal includes information pertaining to the RSSI, PDSQ and MPC in the ACK and NACK messages that the Destination Terminal sends to the Source Terminal. 
   The level of the received signal is computed based on RSSI and PDSQ measurements. Both measurements are readings of A/D converters in the transceiver  108  (see  FIG. 4 ) of the Destination Terminal, and are scaled to [0:31] range in this example. That is, in this example, the ACK and NACK messages each have reserved 5 bits for RSSI and PDSQ measurements which allows the representation of 32 distinct values, namely, the values ranging from 00000 (decimal “0”) through 11111 (decimal “31”). The strength of the received signal is estimated using linear approximations, and is computed from RSSI data only when RSSI has a large value. Specifically, as can be appreciated by one skilled in the art and as shown in  FIG. 4 , the RSSI count is a measure of the Automatic Gain Control (AGC) signal that controls the radio frequency (RF) amplification of the received energy. 
   Specifically, the AGC maintains the received signal as constant as possible at detection/demodulation. A first A/D converter provides the numerical expression of the value of AGC, which is the RSSI. The level of the signal leaving the detection stage DET is also sampled with a second A/D converter to provide the PDSQ. As long as the received signal is strong enough, PDSQ is constant or relatively constant. A stronger received signal results in a higher AGC and RSSI. However, when the received signal is weak, AGC and RSSI are zero, and PDSQ becomes smaller than the constant value characterizing the reception of a strong signal. Accordingly, when RSSI has small values, PDSQ is used instead of RSSI for computing the received signal strength. 
   Dynamic Variation of the Path Loss 
   The instantaneous path loss between the Source and Destination Terminals is computed as the difference between the transmitting power at which the signal is transmitted by the Source Terminal and the signal strength at which the transmitted signal is received by the Destination Terminal. The signal strength is evaluated based on the information provided to the Source Terminal in the ACK or NACK messages sent by the Destination Terminal. Subtracting the strength of the received signal from the level of the transmit power provides the value of the path loss, which includes the free space loss as well as the absorption caused by a medium as discussed above. In a mobile environment, the distance between the Source and Destination Terminals changes continuously, meaning that the path loss also changes. ATP tries to predict the variation of the path loss in time by estimating the coefficients of the equation:
 
 pl ( t )= f   0   +f   1 ( t−t   0 )  (1)
 
where t 0  is the time when the first message was transmitted to the Destination Terminal, and t the time that the present message is being sent. The coefficients f 0  and f 1  of this function are computed using the Least Square Method (LSM) which is known in the art, but any linear or non-linear model can be used. The method has as scope to find the values of the two parameters f 0  and f 1  for which 
               σ   2     =       ∑     i   =   1     n     ⁢           ⁢       (       f   0     +       f   1     ⁡     (       t   i     -     t   0       )       -     pl   ⁡     (     t   i     )         )     2               (   2   )             
 
has the smallest value (the smallest square of sigma). The smallest value of sigma is achieved when its derivative in relation with f 0  and f 1  are zero. This condition provides a system of two equation with two unknown variables f 0  and f 1  described below. Solving the system provides the values of the two parameters f 0  and f 1 .
 
   If the connection between two neighbors (e.g., the Source and Destination Terminals) is active for long time, the elements of the LSM matrix can become very large and make it relatively impossible to consider new data. On the other hand, old data is not necessarily accurate anymore and should not be used for making current decisions. Hence, ATP employs the “forget factor” which allows the ATP algorithm to forget the information collected more than a certain length of time ago, by providing each measurement with a variable weight that decreases with time as will now be described. 
   Specifically, at time t n , the instantaneous path loss is pl n . At that moment the LSM matrix has four elements 
         a     1   ,           ⁢   1       (   n   )       ,           ⁢     a     1   ,           ⁢   2       (   n   )       ,           ⁢     a     2   ,           ⁢   1       (   n   )       ,           ⁢     a     2   ,           ⁢   2       (   n   )           
 
and two right terms 
         b   1     (   n   )       ,           ⁢       b   2     (   n   )       .         
 
After receiving n measurements, the associated matrix for LSM while using the forget factor w with the property 0&lt;w&lt;1 for weighting each measurement, is: 
                     a     1   ,           ⁢   1       (   n   )       =       ⁢       ∑     i   =   0     n     ⁢           ⁢     w     n   -   i                         a     1   ,           ⁢   2       (   n   )       =       ⁢       a     2   ,           ⁢   1       (   n   )       =       ∑     i   =   0     n     ⁢       (       t   i     -     t   0       )     ⁢     w     n   -   i               ⁢                         a     2   ,           ⁢   2       (   n   )       =       ⁢       ∑     i   =   0     n     ⁢           ⁢         (       t   i     -     t   0       )     2     ⁢     w     n   -   i                         b   1     (   n   )       =       ⁢       ∑     i   =   0     n     ⁢           ⁢       pl   i     ⁢     w     n   -   i                         b   2     (   n   )       =       ⁢       ∑     i   =   0     n     ⁢           ⁢         pl   i     ⁡     (       t   i     -     t   0       )       ⁢     w     n   -   i                         (   3   )             
 
   The process is continuous and the matrix should be updated when receiving any new set of data. Also, the recursive form of previous equations is: 
                     a       1   ⁢     ,           ⁢   1       ⁢               (   n   )       =       ⁢         a     1   ,           ⁢   1       (     n   -   1     )       ⁢   w     +   1                   a     1   ,           ⁢   2       (   n   )       =       ⁢       a     2   ,           ⁢   1       (   n   )       =         a     1   ,           ⁢   2       (     n   -   1     )       ⁢   w     +     (       t   i     -     t   0       )                       a     2   ,           ⁢   2       (   n   )       =       ⁢         a     2   ,           ⁢   2       (     n   -   1     )       ⁢   w     +       (       t   i     -     t   0       )     2                     b   1     (   n   )       =       ⁢         b   1     (     n   -   1     )       ⁢   w     +     pl   i                     b   2     (   n   )       =       ⁢         b   2     (     n   -   1     )       ⁢   w     +       pl   i     ⁡     (       t   i     -     t   0       )                       (   4   )             
 
   In the general case, the α 1,1  element of the LSM matrix is equal to the number of measurements considered in computation. However, in the present embodiment, the value of α 1,1  at step n is equal to 
         a     1   ,           ⁢   1       (   n   )       =         ∑     i   =   0       n   -   1       ⁢           ⁢     w   i       =         1   -     w   n         1   -   w       .           
 
For very large values of n and because w&lt;1, the value of α 1,1  element becomes almost equal to 
         a     1   ,           ⁢   1       (   n   )       =       1     1   -   w       .         
 
This means that the “forgetting” procedure presented here has almost the same effect as applying the LSM to data associated to a sliding window of size s=1/(1−w). In other words, if a sliding window of size s is used for computing the path loss, the value of the “forget factor” must be equal to a window having the size w=(s−1)/s. Nevertheless, the technique according to the embodiment of the present invention provides almost the same result as the sliding window, and the processing is faster and does not require to store old data. More than that, the most recent collected data has higher weight in computing the values of the two parameters f 0  and f 1  than old data. As mentioned before, the “forget factor” is a positive number smaller than one and very close to one. For a window of 1000 measurements, the size of the “forget factor” is w=(1000−1)/1000=0.999.
 
   The Span of Short Term Fading 
   From one measurement to another, the path loss presents significant variations. Specifically, as can be appreciated by one skilled in the art, these variations are caused by multiple factors that include the speed of change of the distance between the Source and Destination Terminals, the speed of various objects moving between Source and Destination Terminals, and so on. The variation has a random character, but its standard deviation is relatively constant for long time. 
   After computing the f 0  and f 1  coefficients in the manner described above, ATP identifies the error of the last measurement, which is represented by the difference between the path loss computed by equation (1) above and the path loss computed from the feedback (i.e., RSSI and PDSQ) provided by the Destination Terminal, and then computes the standard deviation of errors. The size of the signal span is computed from the standard deviation of individual measurements that is filtered with Infinite Input Filter (IIF) for preventing sudden jumps. 
   Noise Level Estimation 
   If the Destination Terminal is close to a noise source, the received signal may be affected in two ways: (a) not all bits of the message are received correctly, and (b) the value of RSSI is larger than normal due to the high level of electromagnetic radiation. As will now be described with regard to the flowchart shown in FIG.  5  and the graph shown in  FIG. 6 , ATP attempts to estimate of the noise level at the Destination Terminal based on frequency of “NAK” and “NO RESPONSE” cases in opposition to “ACK” cases as discussed above. 
   As shown in step  1000  in the flowchart, the noise is estimated using three variables that change value every time a new data is received. These variables are the noise level, the upward correction and the downward correction. The noise level variable shows the currently estimated level of noise. The estimated noise could be smaller than the real level, larger than the real level, or almost correct. The upward and downward corrections are limited by bottom limits which, in this example, are 0.1 dB for the upward correction and 0.0001 dB for the downward correction. The noise level variable in this example begins at zero. The values of these variables are indications of the relation between the estimated level of noise and the real noise level. No more than one of these variables is larger than its bottom limit at any time. When the upward correction is larger than its bottom limit, the estimated noise is probably smaller than the real noise level. However, when the downward correction is larger than its bottom limit, the estimated noise is probably larger than the real noise level. When both variables are at bottom limit, there is no significant noise at correspondent site. The values of these corrections are continuously changing according with the type of occurring situation (favorable or not favorable) as explained below. 
   When a favorable situation occurs (e.g., the Source Terminal receives an ACK message) in step  1010 , the action that the controller  112  of the Source Terminal takes depends on the value of upward correction. If it is determined in step  1020  that the upward correction is higher than its bottom limit (i.e., 0.1), the upward correction is reduced to half (or by any other suitable factor) and is subtracted from the noise level in step  1030 . In step  1040 , the noise level is then determined to be either zero if the noise level calculated in step  1030  is negative, or the noise level calculated in step  1030  if it is a positive value. However, the noise level cannot be negative and can never exceed the maximum noise level MAX_NOISE, which can be any suitable value such as 50 dB. These conditions are represented by the function max(0, min(noise, MAX_NOISE)) in step  1040 . If is determined in step  1020  that the upward correction is smaller or at the bottom limit, in step  1050 , the upward correction is reset to 0.1, the noise level is decreased by the downward correction and the downward correction is increased by 10%, or by any other suitable factor. The noise value is then selected in step  1040 , and the ATP waits for another message in step  1060 . The process returns to step  1010  and repeats when another message is received. 
   On the contrary, when an unfavorable situation occurs (e.g., the Source Terminal receives an NAK message or NO RESPONSE is detected) in step  1010 , the process proceeds to step  1070  where the value of the upward correction is doubled (or increased by any other suitable factor) and is added to the noise level while the downward correction is reset to its bottom limit of 0.0001. The process then proceeds to step  1040  where the noise level is determined as discussed above, and then to step  1060  to await receipt of another message. 
   As can be appreciated from this description, the algorithm searches for the estimation of the noise level with steps increasing exponentially with the power of two (or any other suitable factor). Hence, the noise level can be identified quickly when a sequence of unfavorable situations occur. Once the noise level is identified, the algorithm maintains the noise level estimate almost constant for some time. Afterward, the algorithm begins attempting to determine if the noise source is still active or not by slowly reducing the estimated noise level. If the attempt is successful, the speed of reduction increases until the new noise level is found or until the estimated noise level becomes zero. 
   Apparently, the estimation of the noise level value is continuously changed, because at every step, one of the two corrections is either added or subtracted to the previous noise level value. In fact, the two corrections have exponential variations and, when the noise level is correctly identified, they have very small values. Accordingly, when the noise level is correctly identified, the corrections that are applied to the noise level are so small that they have no practical significance. 
     FIG. 6  is a graph illustrating an example of the manner in which the noise detection process described above with regard to the flowchart in  FIG. 5  is used to dynamically estimate the noise level. For example, for the first message, the actual noise at the Destination Terminal causes the Destination Terminal to send a NACK message to the Source Terminal. The upward correction is then set to (0.1*2) or 0.2 in step  1070  and, when added to the initial estimated noise value of zero, the noise value becomes 0.2. The Source Terminal then adjusts the transmission power as discussed in the “Power Computation” section below when sending the second message. However, the actual noise still causes the Destination Terminal to send a NACK message to the Source Terminal. The upward correction is then set to (0.2*2) or 0.4 in step  1070  and, when added to the noise value of 0.2 calculated for the previous message, the new noise value becomes 0.6. 
   This process repeats as indicated, until the power level is adjusted to such a level (i.e., to compensate for an actual noise level of +12 dB in this example) which results in the Destination Terminal sending an ACK message to the Source Terminal. In this example, this occurs by the time the sixth message is sent, which results in an estimated noise value of 12.6 dB according to the calculations discussed above. Hence, when the seventh message is sent, the power level is sufficient to result in the Destination Terminal sending an ACK message. The process shown in  FIG. 5  thus proceeds from step  1010  to step  1020  and, because the upward correction value has risen to 6.4 which is over 0.1, the process proceeds from step  1020  to step  1030 . The upward correction value is then halved to 3.2 and subtracted from the noise value, to result in a noise value of (12.6−3.2) or 9.4. The power level is then decreased accordingly for sending the eighth message. However, because the power level has been lowered too much, a NACK message will be sent by the Destination Terminal. This results in the process proceeding to step  1070  where the upward correction value is doubled to 6.4 and added to the noise level of 9.4 to result in a noise level of 15.8. 
   When the power is thus increased for sending the ninth message, the power level will be sufficient to result in the Destination Terminal receiving the message and sending an ACK message to the Source Terminal. Hence, the process proceeds from step  1010  to step  1020 , to step  1030  where the upward correction value of 6.4 is halved to 3.2 and subtracted from the noise value of 15.8, resulting in a noise value of 12.6. It is noted that the power level for the next message will still result in an ACK message being received. Hence, for that message, the process will proceed from step  1010  to step  1020 , to step  1030  where the upward correction value will be halved again to 1.6 and subtracted from the noise value. The noise value will thus be reduced to 11.0. However, as can be appreciated from the graph shown in FIG.  6  and the flowchart of  FIG. 5 , the estimated noise value will stabilize at the actual noise value, which in this example is +12 dB. When the upward correction value is halved enough times to be below the bottom limit of 0.1, when the process reaches step  1020 , it will proceed to step  1050  where the downward correction will be used to reduce the noise value by a much smaller amount. 
   As can be appreciated from the above, the sudden activation of noise source prevented seven of the first ten messages from being received by the Destination Terminal. From that moment, the reliability increased to more then 90%. As indicated in  FIG. 6 , noise of +12 dB over the receiver sensitivity is received at the Destination Terminal during the first 50 messages. For the rest of the time, no noise is present. That is, in this example, the noise at the Destination Terminal disappears by the time the 50 th  message has been sent. Although the noise stopped when message  50  was transmitted, the nature of the noise evaluator as shown in the flowchart of  FIG. 5  begins to lower the estimated noise level significantly only after receiving 30 successive unaffected messages, that is, beginning at message  80 , due to the small size of the downward correction value and the small amount (i.e., 10%) by which it is increased for every message. 
   Power Computation 
   The ATP computes the theoretical transmit power as a summation of the estimated noise level (increased by 10%), the path loss at the specified time, the receiver sensitivity at maximum data rate (i.e., the noise floor) and two times the fading span. Since the fading span is the same or substantially the same as the standard deviation of the path loss, using two times its value gives the certainty that 95.4% of messages are received at a level higher than the receiver sensitivity, as indicated by the following equation:
 
 TT×P ( t )=noise*1.1+ pl ( t )+NoiseFloor (6)+2*Span  (5)
 
   The theoretical transmit power could be larger or smaller than the maximum power that the transmitter can provide. The computed transmit power T×P(t) is equal to the theoretical transmit power if it is within the power range the transmitter can provide, as indicated by the following equations: 
                     TxP   ⁡     (   t   )       =       ⁢     min   ⁡     (     MAX_POWER   ,           ⁢     max   ⁡     (     MIN_POWER   ,           ⁢   TTxP     )         )                     FTxP   ⁡     (   t   )       =       ⁢     {               TxP   ⁡     (   t   )       &gt;   pFTxP     ⇒     TxP   ⁡     (   t   )                       TxP   ⁡     (   t   )       ≤   pFTxP     ⇒           TxP   ⁡     (   t   )       *   α     +   pFTxP       1   +   α                             α   =       ⁢     {           highSpeed   ⇒   0.1               slowSpeed   ⇒   0.007                           (   6   )             
 
   Depending on relationship between the computed transmit power T×P and the filtered transmit power used in previous transmission pFT×P, the filtered transmit power FT×P is either computed from the transmit power using the IIF associated to the speed of path loss variation, or is considered as it is. This asymmetric filter allows maintaining high reliability when sudden adverse events happen. 
   Data Rate Computation 
   If the theoretical transmit power is smaller than the maximum transmit power, the maximum data rate is used and the theoretical power is equal to the filtered FT×P transmit power. However, if the theoretical transmit power TT×P is larger than the highest power the transmitter can provide, the excess of power is compensated by lowering the data rate DR, as indicated by the following equation: 
                   DR   =       ⁢     {             TTxP   &gt;   MAX_POWER     ⇒     RateIndex   ⁡     (     TTxP   -   MAX_POWER     )                     TTxP   ≤   MAX_POWER     ⇒   6                           RateIndex   ⁡     (   p   )       =       ⁢     {             p   ≥   6.021     ⇒   3                 p   ≥     3.01   ⋀   p     &lt;   6.021     ⇒   4                 p   ≥     1.76   ⋀   p     &lt;   3.01     ⇒   5                 p   &lt;   1.76     ⇒   6                           (   7   )             
 
   The return values of the RateIndex function are resulting from the conversion of the transmit energy per bit for each data rate. The data transfer rate for a rate index of 6 is 6 MBPS and is used as a reference. The data rate for a rate index of 5 is associated with a data transfer rate of 4 MBPS. The relative energy at 4 MBPS is 10*log 10 (6/4)=1.760913 dB. The other values correspond to 3 MBPS for a rate index of 4, and 1.5 MBPS for a rate index of 3. Lower data rates are used only for control messages, and not for data transfer. 
   It is noted that the data rate computed in accordance with Equation (7) is filtered using IIF with parameters specific with the speed of path loss change, as indicated by the following equation: 
                   FDR   =       ⁢       pFDR   +     DR   *   β         1   +   β                   β   =       ⁢     {           slowSpeed   ⇒   .1               fastSpeed   ⇒   .05                         TxDR   =       ⁢     ⌈   FDR   ⌉                   (   8   )             
 
where the transmitted data rate T×DR is the ceiling of filtered data rate FDR. It is noted that although only cases for slow and fast speeds are shown as an example, the computation of the parameters can have any number of discrete steps, or can be continuously adaptable.
 
   Power and Data Rate Filtering 
   The computed power and data rate are filtered using IIF for assuring a smooth change of values. The data rate filter is symmetrical, but the power filter is asymmetrical, assuring fast reaction to sudden adverse changes in environment with slow recovery, thus maintaining the reliability of connection to at least 90%. 
   Fast and Slow Movement 
   As indicated above, the ATP uses two sets of parameters for filtering the transmit power and data rate. The selection of the proper set of parameters depends on the value of f 1 , which represents the variation of the path loss as indicated above. If |f 1 |&gt;=0.0015 dB/ms, it is considered that the path loss variation is caused by a fast moving vehicle. The differentiation between “fast” and “slow” movement improves the overall quality of the control. 
   Link Quality 
   In addition to determining the transmit power level and data transmit rate as discussed above, the ATP further provides information about the quality of the link between Source and Destination Terminals. This information can be used for predicting the behavior of an active the link in next few seconds or when considering the link for participating in a communication route. 
   The index of link quality ILQ is defined as:
 
 ILQ ( t )=MAX_POWER− FT×P ( t )+6.02−Gain ( T×DR )
 
   As indicated in the graph of  FIG. 5 , the ILQ is equal with the maximum power increased with 6.02 (the gain for using the lowest data rate) minus the actual used transmit power and the actual gain converted to dB. The ILQ indicates the amount of unused theoretical power for the link. This measure is complementary to the link resistance that measures the currently used energy. 
   One second predicted link quality PLQ 1 , which is also shown graphically in  FIG. 5 , is computed as:
 
 PLQ 1 =ILQ− 1,000 f   1 
 
with the f 1  factor representing the variation of the path loss measured in dB/ms.
 
   The five second predicted link quality PLQ 5  shown in the graph of  FIG. 5  is computed as follows:
 
 PLQ 5 =ILQ− 5,000 f   1 
 
with the variation of link quality being presented in  FIG. 5  at a scale that allows representation as 8 bits numbers, instead of dB.
 
   The Index of Link Quality is useful for judging the current resistance of the link. Small values of ILQ indicate that the link has substantial resistance and may break at any time. The one-second prediction of link quality provides more information in such case. Specifically, smaller than ILQ values of PRQ 1  indicate that the link has the tendency to become weaker in time. A negative value of PRQ 1  indicates that the link may not be available after one second, and that the route using the link, if any, must be rerouted. On the contrary, values of PRQ 1  larger than ILQ indicate that the link quality is improving and, despite the fact it is weak now, it will become better after one second. 
   The five-second prediction of link quality is useful when a link is considered for being selected as participant in a route. Large values of PLQ 5  indicate that the route will be healthy for at least five seconds from now, and can thus be selected for participating in a route. Smaller or negative values of the PLQ 5  indicate that the link will become weak or unavailable in less than five seconds and should not be considered as a hop in a new route. 
   It is further noted that the ATP controls the transmission between the Source Terminal and the Destination Terminal, which is only one link in the chain that is the route between the initial source of data and the final destination. The link quality is the set of information that ATP provides to other software components of the terminal for assuring a high reliability of the network as a system of terminals. 
   Although only a few exemplary embodiments of the present invention have been described in detail above, those skilled in the art will readily appreciate that many modifications are possible in the exemplary embodiments without materially departing from the novel teachings and advantages of this invention. Accordingly, all such modifications are intended to be included within the scope of this invention as defined in the following claims.