Abstract:
Systems and methods are presented for conducting a relayed communication involving a source node, a plurality of intermediate nodes, and at least one destination node, involving at the source node transmitting a signal associated with the relayed communication on a first medium allocation, at each one of the plurality of intermediate nodes relaying the signal onto a next medium allocation in response to receiving the signal as transmitted on at least one medium allocation up to a current medium allocation, and at the at least one destination node receiving the signal as transmitted on at least one medium allocation up to a last medium allocation, wherein at least one node among the plurality of intermediate nodes and the at least one destination node receives signals associated with the relayed communication from multiple intermediate nodes as transmitted on at least one medium allocation.

Description:
CROSS-REFERENCES TO RELATED APPLICATIONS 
       [0001]    This is a nonprovisional application claiming priority to U.S. Provisional Application No. 60/864,927, filed Nov. 8, 2006 and titled “Information Relating to Orthogonal Dimension Barrage Relay”. This application is related to U.S. Pat. No. 7,092,457, issued Aug. 15, 2006 and titled “Adaptive Iterative Detection.” The contents of the above U.S. provisional patent application and U.S. patent are hereby incorporated by reference for all purposes. 
     
    
     FIELD OF THE INVENTION 
       [0002]    The present invention relates to systems and methods for enhancing robustness and efficiency and reducing latency within communication networks and, more specifically, within wireless ad hoc networks. 
       BACKGROUND OF THE INVENTION 
       [0003]    Ad hoc networks are the focus of considerable research and development. A key characteristic of these networks is that they do not rely on fixed infrastructure to the extent that other networks such as satellite, cellular, and Wireless Local Area Networks (WLAN) do. Nodes beyond the communication reach of a transmitting node may be reached through intervening nodes providing a relay function. This feature is clearly attractive for tactical (military and police) and first responder (police and fire) applications. This feature is also seen as a method of increasing the coverage of more traditional infrastructure-based networks. When we refer to ad hoc networks in the description of this invention we also refer to ad hoc components of larger communication networks. 
         [0004]    Significant standardization efforts are in progress in the area of Mobile Ad Hoc Networks (MANETs) for IP traffic. A MANET is a wireless ad hoc network formed in an arbitrary network topology. Nodes within this network may move arbitrarily causing the network topology to change rapidly. The network does not, in general, depend on any particular node and dynamically adjusts as some nodes join or others leave the network. Although the MANET element of a network is not dependent on fixed infrastructure, elements such as access points (providing access to the Internet) are a key component of many systems that employ MANET protocols. 
         [0005]    MANET networks allow quick deployment and adjust as nodes join and leave the network and thus are an obvious candidate for tactical and first responder networks. MANETs are also employed to extend the coverage of more traditional networks, such as WLANs. 
         [0006]    Nodes within a MANET are often powered by batteries. Battery run time, regulatory considerations, and detectability considerations limit a node&#39;s radiated power. The intended communication range between two nodes often exceeds the radio transmission range, and a transmission has to be relayed by other nodes to reach its destination(s). Consequently, the network has a multi-hop topology, and this topology changes as the nodes move. 
         [0007]    The MANET working group of the Internet Engineering Task Force has been actively evaluating and standardizing routing protocols. Because the network topology changes arbitrarily as the nodes move, it is important for a protocol to be adaptive. The Ad Hoc on Demand Distance Vector (AODV) protocol is representative of on-demand routing protocols presented at the MANET working group. 
         [0008]    Performance of protocols developed within the MANET working group is severely impacted by the decision to limit “MANET modifications” to elements at the network layer and above. As a result of the Carrier Sense Multiple Access (CSMA) protocols assumed at the Media Access Control (MAC) and Physical (PHY) layers, nodes with a message to relay need to take turns with other nearby nodes attempting to relay the same information. This factor results in dramatic loss of network capacity while increasing transmission latency. 
         [0009]    Capacity, latency, and robustness issues of ad hoc networking protocols are key considerations for all ad hoc networks, regardless of whether nodes are mobile or not, and independently of the type of network traffic (IP, Voice, Video, Streaming, etc.). An additional key consideration for mobile ad hoc networks is how the networking protocol accommodates network topology dynamics. 
       BRIEF SUMMARY OF THE INVENTION 
       [0010]    In view of the forgoing background, it is therefore an object of the present invention to eliminate the need for nodes to take turns (via CSMA or other protocol) sending a message to one node at a time when relaying information. This process of taking turns increases latency for destination nodes on routes that have been impacted by one or more of these scheduling delays. 
         [0011]    Another object of the present invention is to increase network capacity. In conventional ad hoc protocols, nodes take turns relaying the same information, using up channel resources (timeline, frequency, etc.) that could be used to transmit other messages. This factor directly reduces network capacity. 
         [0012]    Yet another object of the present invention is rapid adaptation to network topology dynamics. 
         [0013]    A further object of the present invention is to improve performance by coherently combing the energy from multiple intermediate nodes relaying on the same medium allocation as well as over prior independent medium allocations. The network thus becomes more robust and allows message flow to nodes that may be unreachable with traditional approaches. 
         [0014]    Yet a further object of the present invention is to exploit the spatial diversity provided by the varying positions of intermediate nodes transmitting a common message on a common medium allocation to a single receive node or a series of receive nodes. 
         [0015]    A still further object of the present invention is to take advantage of the varying positions of nodes within the ad hoc network for simultaneous route diversity. Since multiple routes exist simultaneously and by default, a blockage on one link or one route does not interrupt the message transfer. 
         [0016]    Yet another object of the present invention is to provide efficient multi-cast and broadcast implementation. 
         [0017]    Other objects and advantages of the present invention will be set forth in the description and in the drawings which follow as would be understood by one of ordinary skill in the art. 
         [0018]    To achieve the foregoing objects, and in accordance with the purpose of the invention as broadly described herein, embodiments of the present invention utilize a relay approach leveraging advanced PHY processing. 
         [0019]    The present invention thus relates to a system and a method for robust, efficient, low-latency transmission of message data from a source node to a destination node (or nodes in the case of multicast and broadcast messages) within an ad hoc network. The network includes a plurality of intermediate nodes between the source node and the destination node(s), and a plurality of communication links interconnecting the nodes. 
         [0020]    According to various embodiments of the invention, nodes will attempt to receive a message on each of a sequence of independent medium allocations. Once a node has received sufficient information to successfully decode the message (or segment of the message) the node will relay the message (or segment) on the next independent medium allocation. Each node may combine energy from a plurality of intermediate nodes relaying the message (or segment) on the current and/or prior allocations. 
         [0021]    For the purposes of this patent description, the term independent medium allocation is intended to represent both completely independent and nearly (sufficiently) independent medium allocations. A first allocation is viewed as nearly (or sufficiently) independent if there is sufficient isolation between that first allocation and a second allocation such that activity in the second allocation does not significantly affect the reception of signals in the first allocation (and vice versa). Typical methods of providing independent allocations include, but are not limited to, non-overlapping time slots, different frequency channels, different antenna radiation patterns, low cross-correlation spreading sequences, as well as any combination of these and other techniques. The detailed description of the present invention refers to the drawings described below. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0022]      FIG. 1  presents an example of network topology to explain the relay protocol according to one embodiment of the present invention. 
           [0023]      FIG. 2  repeats the example of  FIG. 1  but with an obstruction that modifies the network topology. 
           [0024]      FIG. 3  is an illustrative block diagram of PHY layer processing according to one embodiment of the present invention. 
           [0025]      FIG. 4  is a flowchart showing an example of operations performed by an intermediate node in the network according to one embodiment of the present invention. 
           [0026]      FIG. 5  is a timeline showing transmissions within a particular network and the associated allocations those transmissions can occur on. This focuses on the ability to re-use allocations after enough distinct allocations have been utilized. 
           [0027]      FIG. 6-A  is the first of a series of four diagrams ( 6 -A,B,C,D) depicting the propagation of messages across a very simple network. It is intended to show how a particular allocation can be re-used after it has traveled a sufficient number of hops. This figure shows the first transmission of the first message. 
           [0028]      FIG. 6-B  is the second of a series of four diagrams ( 6 -A,B,C,D) depicting the propagation of messages across a very simple network. It is intended to show how a particular allocation can be re-used after it has traveled a sufficient number of hops. This figure shows the second transmission of the first message. 
           [0029]      FIG. 6-C  is the third of a series of four diagrams ( 6 -A,B,C,D) depicting the propagation of messages across a very simple network. It is intended to show how a particular allocation can be re-used after it has traveled a sufficient number of hops. This figure shows the third transmission of the first message. 
           [0030]      FIG. 6-D  is the fourth of a series of four diagrams ( 6 -A,B,C,D) depicting the propagation of messages across a very simple network. It is intended to show how a particular allocation can be re-used after it has traveled a sufficient number of hops. This figure shows the fourth transmission of the first message and the first transmission of the second message. 
       
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
       [0031]      FIG. 1  depicts a small ad hoc network according to one embodiment of the present invention. In this embodiment node  101  is attempting to send a message to one or more other nodes in the network. Note that the diagram has been simplified for clarity. Lines interconnecting nodes in the figure are only shown if the connection resulted in (or contributed substantially to) a successful reception at the end node. Also, for simplicity, connections that contributed to successful reception at a node and were transmitted on an allocation prior to the allocation in which reception was successful are not shown. Here a node is deemed to have received the message successfully if it is able to decode the message without error. In other embodiments of the invention, successful reception may be defined differently, such as decoding the message with an acceptable number of bit errors. 
         [0032]      FIG. 1  does not limit itself to the use of any specific category of independent medium allocations. For clarity we will discuss the example in the context of an embodiment that utilizes a Time-Division Multiple-Access (TDMA) network protocol. On a time slot, referred to as Allocation  1  in  FIG. 1 , the transmission is initiated by node  101  and a subset of nodes are able to complete successful reception. In this embodiment, all nodes except the node transmitting are attempting to receive the transmitted message but only nodes  111 ,  112 ,  113 ,  114 ,  115 , and  116  are successful based on the transmission in Allocation  1 . The transmission was too distorted and/or attenuated (through path loss, interference, jamming, or other means of distortion imposed by the channel) to be correctly decoded at all other nodes ( 121 ,  122 ,  123 ,  124  and  131 ). 
         [0033]    These nodes (nodes  111 ,  112 ,  113 ,  114 ,  115 , and  116 ) now relay the information onto the next allocation in the sequence, Allocation  2 . In the case of this TDMA example, this refers to a timeslot occurring after the Allocation 1 slot. According to one embodiment of the invention, the signal is relayed onto the next medium allocation by sending an identical version of the signal onto the next medium allocation. Here, nodes relaying onto different allocation mediums may receive and relay the identical information. 
         [0034]    According to another embodiment of the invention, the signal is relayed onto the next medium allocation by sending a modified version of the signal onto the next medium allocation. Here, each node relaying onto a particular allocation medium may modify the received information in a common manner that is predictable at receive nodes based on knowledge of the allocation sequence. For example, the message may comprise a header portion that is modified plus a body portion that remains the same as the message is relayed. The header portion may include an “allocation ID” field indicating the allocation used to transmit the message. A simple allocation sequence may be adopted as follows: Allocation  1 , Allocation  2 , Allocation  3 , and so on. Thus, a node receiving a message containing an “allocation ID” having a value of N may modify the “allocation ID” to the value N+1 before transmitting the message onto the next allocation. 
         [0035]    Nodes  121 ,  122 ,  123 , and  124  are able to successfully receive the message based on the Allocation 2 transmissions (or Allocation 2 transmissions combined with prior Allocation 1 transmissions). Referring to the reception at node  123 , we see that the Allocation 2 transmissions from nodes  113 ,  114 , and  115  all contributed to the successful reception. As, described below, the Adaptive Iterative Detection (AID) receiver of the present embodiment coherently combines energy from these three common received signals. These redundant (common) transmissions improve the likelihood of successful decoding of the message at node  123 . 
         [0036]    All nodes that have a successful reception of the transmission through Allocation  2  ( 121 ,  122 ,  123 , and  124 ) modify the message in a common way (or not at all) and transmit the message on Allocation  3  (a later time-slot than the Allocation 2 time-slot). 
         [0037]    Node  131  is able to successfully receive the message based on the Allocation 3 transmissions (or Allocation 3 transmissions combined with transmissions on prior allocations). At this point all nodes in the network have successfully received the broadcast message originating at node  101 . 
         [0038]    Note that, in the embodiment described above and illustrated in  FIG. 1 , all nodes currently transmitting a message (original transmission or relay) and all nodes that have successfully received the message plus the node that originated the message do not attempt to transmit the same message in future allocations. In accordance with the present embodiment, this is necessary to avoid loops. 
         [0039]    According to an embodiment of the invention, a message ID is embedded within each message in order to facilitate a node&#39;s recognition of whether it has received the message before. 
         [0040]    In this example, it took three hops (original transmission and two relay hops) for the message originating at node  101  to be successfully broadcast to all participants in the network shown in  FIG. 1 . 
         [0041]      FIG. 2  shows an ad hoc network laid out with exactly the same node positions as the network shown in  FIG. 1 . However, this network now has a blockage that prevents node  215  from successful reception based solely on the Allocation 1 transmission. This example illustrates how this embodiment of the invention adapts to changes in network topology. The network adaptation is completed without knowledge of the network configuration and without any additional exchange of connectivity information between nodes. The routing around a blockage occurs in a fashion that is generally transparent to any user at any node. 
         [0042]    This invention allows the re-routing to occur for blockages that may just effect one transmission or blockages that effect multiple transmissions without any new rules or passage of connectivity information between nodes. Note that although the blockage depicted here is represented as a wall, the blockage could be any effect that prevents a signal from being decoded at a particular node. As such, this concept of blockage also covers any link between nodes whereby successful decoding is intermittent. In this case, the blockage would be momentary, interfering with some transmissions and not with others. 
         [0043]      FIG. 2  shows the initial transmission from node  201  with the blockage in place. Notice that the connections occur exactly as they did in  FIG. 1 , except that the link between  201  and  215  is blocked (whereas the equivalent link between  101  and  115  in  FIG. 1  was successfully completed). 
         [0044]    As per the discussion above, all nodes that successfully receive the message based on the Allocation 1 transmission ( 211 ,  212 ,  213 ,  214 , and  216  in this case) modify the message in a common fashion (or not at all) and transmit it in a common allocation (Allocation  2  in  FIG. 2 ). All nodes that did not have successful reception based on the initial transmission listen for the Allocation 2 transmissions and some of them ( 221 ,  222 ,  223 , and  215 ) are able to successfully receive the message based on Allocation 2 (or Allocation 2 combined with Allocation 1) transmissions. Notice that although node  215  was blocked from the Allocation 1 transmission, it is able to receive the relay of the message from the relays in Allocation  2  (from nodes  214  and  216 ). Also notice that although in  FIG. 1  node  124  was able to receive based on transmissions through Allocation  2 , its equivalent node ( 224 ) in  FIG. 2  was not, since the blockage prevented the initial Allocation 1 transmission from reaching node  215  so that node was not able to participate in the Allocation 2 relay transmissions. 
         [0045]    The nodes that completed successful reception based on the transmission through Allocation  2  ( 221 ,  222 ,  223 , and  215 ) then modify the message in a common fashion (or not at all) and transmit it in a common allocation (Allocation  3  in  FIG. 2 ). 
         [0046]    Notice that at this point, all nodes in the network have successfully received the message, although the message received at node  231  was received from only one path (from  223 ), whereas its equivalent node in  FIG. 1  ( 131 ) was able to combine the energy from two paths (from  123  and  124 ) to assist in decoding the signal. 
         [0047]    Also notice that in  FIG. 2 , node  224  received the message in three hops, whereas its equivalent node ( 124 ) in  FIG. 1  was able to successfully receive the message one hop sooner. 
         [0048]    Finally, notice that if the path between node  223  and  231  in  FIG. 2  had been blocked, or the message signal from  223  could not have been decoded at node  231  without the added energy from node  223 , then there would be a second chance for node  231  to receive that message when node  224  relayed the message in Allocation  4  (not shown). As such, this invention allows diversity in terms of redundant transmissions in separate allocations as well as diversity in terms of redundant transmissions in a common allocation. 
         [0049]    As discussed earlier, a key element in accordance with the present embodiment of the invention is PHY layer processing that allows energy from multiple transmissions on the same allocation to be combined constructively and also be combined constructively with multiple transmissions that may have occurred on a prior allocation(s). 
         [0050]    In  FIG. 1 , notice that there are multiple significant unique channels between (a) a subset of the nodes relaying on Allocation  2  ( 113 ,  114 , and  115 ) and (b) node  123 . Recall that, in this Figure, transmissions from nodes  113 ,  114 , and  115  are identified as significantly contributing to the successful reception of the message at node  123 . Of particular interest here are all the unique channels between these nodes relaying on Allocation  2  and the next receiving node ( 123 ). Since all of the relaying nodes transmit the same signal onto the same allocation, the received signal may be written as follows: 
         [0000]    
       
         
           
             
               
                 
                   
                     r 
                      
                     
                       ( 
                       t 
                       ) 
                     
                   
                   = 
                   
                     
                       
                         ∑ 
                         
                           n 
                           = 
                           1 
                         
                         N 
                       
                        
                       
                         
                           s 
                            
                           
                             ( 
                             t 
                             ) 
                           
                         
                         * 
                         
                           
                             h 
                             n 
                           
                            
                           
                             ( 
                             t 
                             ) 
                           
                         
                       
                     
                     + 
                     
                       η 
                        
                       
                         ( 
                         t 
                         ) 
                       
                     
                   
                 
               
             
             
               
                 
                   = 
                   
                     
                       
                         s 
                          
                         
                           ( 
                           t 
                           ) 
                         
                       
                       * 
                       
                         ( 
                         
                           
                             ∑ 
                             
                               n 
                               = 
                               1 
                             
                             N 
                           
                            
                           
                             
                               h 
                               n 
                             
                              
                             
                               ( 
                               t 
                               ) 
                             
                           
                         
                         ) 
                       
                     
                     + 
                     
                       η 
                        
                       
                         ( 
                         t 
                         ) 
                       
                     
                   
                 
               
             
             
               
                 
                   = 
                   
                     
                       
                         s 
                          
                         
                           ( 
                           t 
                           ) 
                         
                       
                       * 
                       
                         h 
                          
                         
                           ( 
                           t 
                           ) 
                         
                       
                     
                     + 
                     
                       η 
                        
                       
                         ( 
                         t 
                         ) 
                       
                     
                   
                 
               
             
           
         
       
     
         [0051]    Where s(t) is the common signal transmitted by each of the N relaying nodes and h n (t) is the channel for the path from the nth relaying node. Here h(t) is the composite sum of all of these channels and η(t) is additive white Gaussian noise. Note that ‘*’ is used here to explicitly indicate convolution. In the example of the Allocation  2  with relays combining at node  123 , there are 3 significant interconnects (N=3). These equations highlight the fact that the signal at the receiver can be processed in the same manner as if all the individual relay transmissions came from a single source with higher power and additional multi-path components. 
         [0052]    As such, in order to enhance reception performance (instead of having degraded performance due to multipath interference), the receiver at node  123  may combine the energy from each of the three receptions on Allocation  2  constructively. In this case, the overall effect is that of increased diversity and increased received power. The AID receiver of this embodiment coherently combines energy from the three common received signals in the current allocation as well as the energy from multiple significant transmissions in prior allocations. 
         [0053]    An illustrative block diagram of the receive processing utilized in this embodiment of the present invention is provided in FIG.  3 .  301 - 1  to  301 -N represent the N significant (from the viewpoint of the receiving node) transmissions that occur in the current allocation, K. Each of these transmissions propagates through a unique channel ( 303 - 1  to  303 -N) and the transmissions are combined ( 305 -K) to present a composite signal at the receiver.  302 - 1  to  302 -M represent the M significant transmissions that occurred on the prior allocation, K−1. Each of these transmissions propagates through a unique channel ( 304 - 1  to  304 -M), and, the transmissions are combined ( 305 -K−1) to present a composite signal at the receiver. This is an example of receiving multiple instances of the signal from a plurality of multipath channels on different medium allocations. 
         [0054]    Conventional receiver front end processing  306 -K amplifies using a low noise amplifier (LNA) and filters (FILTER) the incoming composite Radio Frequency (RF) signal in Allocation K. The signal is then converted to an Intermediate Frequency (IF) and digitized (DIGITIZATION). Digital signal processing is responsible for conversion of the signal to Base Band (BB) where acquisition (ACQUISITION) is performed for timing alignment by correlation to a known data pattern within the transmission. Similar processing  306 -K−1 has been performed on the composite signal arriving on Allocation K−1. 
         [0055]    Energy from the N sources on allocation K are combined ( 307 -K) and then combined ( 308 ) with energy from the M sources on allocation K−1 ( 307 -K−1). The resulting output is decoded ( 309 ) and error detection is performed to assure reliability of the resulting data ( 310 ). According to the invention, various techniques can be employed for combining energies from different signals. In the present embodiment, significant energy from Allocations K and K−1 are combined in an AID processing architecture. An AID processing architecture is one that employs forward and backward recursion elements, channel estimators and a combiner, passing soft (probabilistic) information between the processing units in order to adaptively track the channel and exploit multiple replicas of the same signal (both through multi-path and redundant relaying nodes) to improve the likelihood of successful decode. Further details on such an AID architecture are disclosed in U.S. Pat. No. 7,092,457, which is incorporated by reference as discussed previously. 
         [0056]    An AID receiver architecture may contain Forward Error Correction (FEC) components that perform various FEC operations. According to one embodiment of the invention, the AID receiver architecture combines energy from multiple transmissions on multiple medium allocations prior to performing such an FEC operation. According to another embodiment of the invention, the AID receiver architecture combines energy from multiple transmissions on multiple medium allocations after such an FEC operation is performed for each individual medium allocation. 
         [0057]    Note that in a related embodiment of the invention the receiver may incorporate a lower complexity non-iterative approach. For example, a receiver structure may receive the signal as transmitted on one or more medium allocations, by using a non-iterative decoding process to combine various versions and instances of the received signal prior to performing an FEC operation. 
         [0058]    The combining function  308  combines the soft outputs from allocations K and K−1. This combining function accounts for modifications made to the message when it was transmitted in the different independent medium allocations. This is an example of receiving multiple versions of the signal each transmitted on a different medium allocation. 
         [0059]    It should also be noted that combining function  308  may choose to not utilize data from prior allocations if it is not deemed significant or if it is not available. In this embodiment of the invention, the significance of the energy from an allocation is determined through a combination of metrics from the acquisition processing and error metrics from the AID techniques such as those mentioned previously. The present embodiment is configured as to ignore data from prior allocations (conserve processing power) or combine energy from up to one prior allocation. In other embodiments, the approach is extended to combine energy from all significant prior allocations. 
         [0060]    In a related embodiment, energy from additional prior allocations (allocations K−2 and earlier) are combined with energy from allocations K and K−1. 
         [0061]      FIG. 4  depicts an example of the finite state machine common to each potential relay node in the network. In general, all nodes in the network can be viewed as relaying nodes. The key element that this diagram highlights is that the decision-making process occurring at each node can be independent of any other node and of the overall network configuration and can happen in real time. According to the present embodiment of the invention, there is no requirement for passage of network state information, building of network connectivity tables or any similar processing that is common to many modern network routing approaches. 
         [0062]    In attempting to receive a message, the node first sets the Allocation to  1  ( 401 ) and searches for a signal on this allocation ( 402 ). If the receiver senses a potential signal of interest, decoding is attempted ( 403 ). If either the search or the decode fail then, providing the allocation limit has not been reached ( 407 ), the receiver will attempt to receive on the next allocation ( 408 - 402 ). If the allocation limit has been reached, then the receive process for this message information is terminated ( 406 ). Here, the allocation limit may be defined in different ways, such as the total number of allocations utilized by the system. Once the message is successfully received (in the case of the present embodiment a Cyclic Redundancy Code (CRC) is used to confirm successful reception), the node must make a decision ( 404 ) whether to relay the information or not. If the decision is to relay information then it is relayed ( 405 ) on Allocation N+1. 
         [0063]    In the case of the present embodiment of the invention, the decision whether to relay or not ( 404 ) has several key input parameters. Relay is inhibited if the node is configured for radio silence or the allocation limit has been reached. Relay may also be inhibited based on information regarding unit battery status. Additionally, information regarding local node density may be utilized to inhibit or randomly inhibit relay. Relay may also be inhibited by a node that is the intended recipient of an addressed message. 
         [0064]    According to an embodiment of the invention, independent medium allocations are re-used after sufficient relays have occurred to ensure that the spatial separation of nodes will support use of the same allocation by multiple nodes.  FIG. 5  presents a timing diagram showing this concept. In this example, a message is initially transmitted at time t 1  on Allocation  1  ( 501 ). This message is then relayed by all nodes that successfully decode it and are not inhibited from relaying at time t 2  on Allocation  2  ( 502 ). This continues for N transmissions. Beyond N transmissions, the message is sufficiently far away in space that the relaying nodes can again relay on Allocation  1  ( 504 ). Note that this may occur at the same time as a new message is transmitted from the original node on Allocation  1 . 
         [0065]      FIG. 6-A ,  FIG. 6-B ,  FIG. 6-C , and  FIG. 6-D  are provided for further clarification of the re-use of independent medium allocations with sufficient spatial separation, according to an embodiment of the present invention. This simple network consists of 5 users spaced in a line with the node furthest to the left ( 601 ) initiating a transmission intended for the node furthest to the right ( 605 ).  607  shows the area around node  601  that can decode the transmission. Since  602  is in this area, it decodes the message and relays it on. 
         [0066]      FIG. 6-B  shows this second relay stage. Here  602  is relaying the message on Allocation  2 . Both  601  and  603  can decode the message, since they are in the region  608 . Since  601  has already received the message (by default as original transmitter)  601  does not re-transmit the message. Since  603  has not received the message,  603  does re-transmit the message (on Allocation  3 ). 
         [0067]    In  FIG. 6-C ,  603  re-transmits and  602  and  604  decode the message successfully since they are in the region  609 . Since  604  has not received the message before,  604  re-transmits on Allocation  1 . 
         [0068]    This is shown in  FIG. 6-D  where  604  is transmitting. Notice here that node  601  can transmit on Allocation  1  again without fear of collision; the region impacted by the transmission from node  601  ( 610 ) and the region impacted by the transmission from node  604  ( 611 ) do not both impact the same node It is the spatial separation ensured by the relaying approach discussed herein that allows this to occur. 
         [0069]    While not shown in these figures, node  605  would be able to re-use Allocation  2  in a similar manner, without impacting the transmission from node  602  (and vice versa). This illustrates that transmission of signals at intermediate nodes belonging to two non-adjacent “layers” of intermediate nodes can take place over a common medium allocation. That is, intermediate node  602  belongs to a layer of intermediate nodes receiving the signal after one hop from the initial node  601 . Intermediate node  605  belongs to a different layer of intermediate nodes receiving the signal after four hops from the initial node  601 . Yet, nodes  602  and  605  can relay the signal using a common medium allocation, Allocation  2 . Here, nodes  602  and  605  are separated by two intervening layers of intermediate nodes. One intervening layer includes node  603 , and the other intervening layer includes node  604 . 
         [0070]    In this manner, Allocations  1 ,  2 , and  3  can be re-used repeatedly by subsequent nodes. It is important to note that although the example shown in  FIGS. 6-A  through  6 -D involves a network existing on a line, the approach discussed here extends automatically in any network employing the relaying approach of this invention regardless of topology; the allocation re-use is guaranteed to not collide with any other allocation, so long as the re-use occurs after a sufficient number of hops (with a minimum of three in the example discussed above). 
         [0071]    In one embodiment of this invention, energy is combined from all prior allocations (with significant contribution) to produce an ideal solution. 
         [0072]    In yet another embodiment of this invention, only reception on the current allocation is utilized in the demodulation/decoding process. 
         [0073]    In a further embodiment of the invention, nodes may transmit a single message (either relay or initial transmission) into multiple allocations. In doing so, the transmitter appears as multiple nodes and a receiver can benefit from the additional diversity gains that would arise from having additional nodes in the network. For example, in a TDMA network, the transmitter may transmit the same message on two time slots and the receiver would benefit from the additional time diversity while demodulating and decoding the received signal. 
         [0074]    In one embodiment, relaying is performed in a common allocation, rather than an independent medium allocation. In such an embodiment, nodes employ cancellation techniques (e.g. excision of known transit signal from received waveform) to allow full duplex operation in the common allocation. 
         [0075]    Related embodiments of this invention differ in the method of combining energy from the multiple relays on a common Allocation. The preferred embodiment provides adaptive multipath combining for non-spread signals. Related embodiments could utilize a rake receiver to combine the multipath components of direct sequence spread signals or frequency coding for orthogonal frequency division multiplexing (OFDM) signal types. 
         [0076]    Related embodiments of this invention differ in approach to providing independent (or nearly independent) allocations. The preferred embodiment uses time as the independent medium allocation (non-overlapping slots). Differing frequencies may also be utilized to provide the independent medium allocations. Code can be utilized to provide sufficiently independent medium allocations in some conditions. In this case code refers to spreading (either direct sequence or low-rate FEC). Finally directional processing may be utilized to provide the independent medium allocations. In this case we are referring to differing antenna patterns (physical or synthetic). 
         [0077]    In the preferred embodiment Time, Frequency, Code, and Directional resources may be reused to enhance capacity, based on spatial separation that is provided naturally by the network. For example, nodes that were able to successfully receive information based on the relay transmissions through Allocation N were not able to successfully receive information based on allocations through Allocation N−1 and in this case we can consider reusing Allocation  1  for the Nth relay transmission (provided N is at least greater than three, since it is likely to be sufficiently independent and not effect units receiving information directly from the first transmission). 
         [0078]    We note that combinations of the above allocations may be utilized to further enhance network efficiency. 
         [0079]    While the present invention has been described in terms of specific embodiments, it should be apparent to those skilled in the art that the scope of the present invention is not limited to the described specific embodiments. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense. It will, however, be evident that additions, subtractions, substitutions, and other modifications may be made without departing from the broader spirit and scope of the invention as set forth in the claims.