|Publication number||US6791994 B1|
|Application number||US 09/552,144|
|Publication date||14 Sep 2004|
|Filing date||19 Apr 2000|
|Priority date||19 Apr 2000|
|Publication number||09552144, 552144, US 6791994 B1, US 6791994B1, US-B1-6791994, US6791994 B1, US6791994B1|
|Inventors||C. David Young, Edgar L. Caples, Jeffrey A. Barton, James A. Stevens|
|Original Assignee||Rockwell Collins, Inc.|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (56), Non-Patent Citations (12), Referenced by (38), Classifications (7), Legal Events (4)|
|External Links: USPTO, USPTO Assignment, Espacenet|
The present invention generally relates to a method for managing communication resources between nodes of a network, and more particularly relates to a dynamic, time multiplex slot assignment method and apparatus, and even more particularly relates to methods and apparatus for assigning receive slots in a dynamic, time multiplex slot assignment communication system.
Mobile multi-hop packet radio networks are known for rapid and convenient deployment, self organization, mobility, and survivability. Such a network is illustrated in FIG. 1. A transmission from one node, from node N1of FIG. 1 for example, can be broadcast to all nodes in its “neighborhood”. Ultra-high frequency (UHF) systems generally have a neighborhood defined by nodes located within line of sight of the transmitting node. The nodes of such a neighborhood are said to be located within one “hop” of the transmitting node. In FIG. 1, for example, nodes N1, N3, N4, N5, N6, N7 and N8 are members of the neighborhood surrounding node N1.
Nodes N2, N9, N10, N11 and N12 are each located two hops away from node N1 and node N13 can be said to be three hops away from node N1. When data transmitted from node N1, is to be propagated multiple hops, the data must be relayed by one or more of node N1's neighbors. For example, data transmitted by node N1, can be relayed by its neighbor node N8 to a node such as node N12 that is located two hops from node N1.
Receivers are generally capable of processing only one transmission at a time. Simultaneous transmissions, also known as collisions, contentions or conflicts, can be avoided by assigning a specific transmission time slot to each communicating node. Several approaches have been developed for assigning slots to nodes. The approach chosen for a particular application is generally a consequence of the type of network application (broadcast, multicast, unicast, datagrams, virtual circuits, etc.) at issue. Since the problem of optimally assigning slots is mathematically intractable, a heuristic approach has been applied. This approach resulted in the development of an integrated protocol that both chooses the number of slots to assign to each neighboring node and coordinates their activation in the network.
Many applications require self-organizing, wireless networks that can operate in dynamic environments and provide peer-to-peer, multi-hop, multimedia communications. Key to this technology is the ability of neighboring nodes to transmit without interference. Neighboring nodes transmit without interference by choosing time slots and channels that do not cause collisions at the intended unicast or multicast receivers. The Unifying Slot Assignment Protocol (USAP), which is disclosed in U.S. Pat. No. 5,719,868, provides a protocol establishing such a communication system. USAP is a dynamic assignment protocol that monitors the RF environment and allocates channel resources on demand. It automatically detects and resolves contention between nodes for time slots, such contention arising for example from changes in connectivity. U.S. Pat. No. 5,719,868, issued Feb. 17, 1998, is hereby incorporated herein by reference in its entirety, including all drawings and appendices.
USAP permits a node to assign itself transmit slots based on information it has regarding when it is assigned to transmit and receive and when a neighboring node is scheduled to transmit. In certain applications, however, it is desirable or necessary to have a node assign itself a receive slot instead of a transmit slot. For example, a node may need to assign itself a communication slot wherein it can receive from one, some or even all of its neighbors.
Consequently, there exists a need for a dynamic assignment communication system capable of accommodating nodes that assign themselves a receive slot. The present invention provides a method and apparatus that enables a node to assign itself a receive slot.
It is an object of the present invention to provide an enhanced dynamic assignment communication system wherein a node can assign itself a receive slot.
It is a feature of the present invention to enable a node to assign itself a receive slot by utilizing information identifying the slots in which that node's neighbors' neighbors are receiving.
It is an advantage of the present invention to enable a node to assign itself a receive slot in which it can receive from one, some or all of its neighbors.
It is another object of the present invention to provide an enhanced dynamic assignment communication system wherein a node can assign itself a broadcast receive slot.
It is another feature of the present invention to permit a node to receive in a broadcast receive slot by utilizing a code division multiple access protocol.
It is an another advantage of the present invention to enable a node to assign itself a broadcast receive slot in which it can receive from some or all of its neighbors simultaneously.
The present invention is an apparatus and method for assigning communication receive slots in a dynamic assignment protocol. For example, in a network having a plurality of nodes, communication can be accomplished via assignment of specific time slots of a time multiplex structure. The time multiplex structure is analyzed and a set of available time slots is determined. The dynamic assignment protocol permits the node to assign itself a time slot from the set of available time slots.
Further, the broadcast reception feature of the present invention is carried out in a “contention-less” manner such that collisions between communications transmitted during the receive slot are avoided. Broadcast reception can be accomplished in a variety of ways. For example, a broadcast receive slot can be shared via a scheduling scheme. Alternatively, a random access reservation method can be employed. Further, a code division multiple access technique can be used to allow neighbor nodes to simultaneously transmit during the broadcast receive slot.
Accordingly, the present invention is a heuristic enabling receiver directed assignment of receive slots in a dynamic slot assignment environment.
The invention may be more fully understood by reading the following description of the preferred embodiments of the invention, in conjunction with the appended drawings wherein:
FIG. 1 is a diagram of a network of nodes, the diagram also illustrating the neighborhood associated with three of the nodes.
FIG. 2 is a block diagram illustrating the general structure of the system of the present invention.
FIG. 3 is a diagram illustrating a node activation form of communication.
FIG. 4 is a diagram illustrating a link activation form of communication.
FIG. 5 is a diagram illustrating a receiver directed form of communication.
FIG. 6 is a diagram of a time division multiple access structure suitable for use with the present invention.
FIG. 7 is a diagram of a time division multiple access structure including a plurality of code division multiple access channels suitable for use with the present invention.
The hardware of the nodes described throughout this specification includes a computerized processor for carrying out the processes described herein, a memory device for storing the shared communication assignment information, a simplex transceiver and an omnidirectional antenna. Thus, a node cannot transmit and receive at the same time, and a node generally cannot receive from more than one node at a time. In fact, two nodes transmitting at the same time, both being within transmission range of an intended receiver, can prevent the receiver from receiving any packet successfully. The data structures and rules can be modified, however, to enable the system to include full duplex radios or radios with multiple transmitters and receivers.
FIG. 2 depicts the general relationships between the various components of the system 200 of the present invention. The system 200 comprises a dynamic assignment protocol, a receive slot allocation heuristic and the channel resources. Additional heuristics can also be included with the present invention. At the lowest level are the channel resources 202. As described below and in the incorporated patent, the channel resources 202 can include the time slots of a time multiplex structure. The channel resources 202 can also include a plurality of different communication channels, a plurality of different frequency channels for example, associated with each time slot. In addition, the channel resources 202 can include a plurality of code division multiple access (CDMA) channels.
The dynamic assignment protocol 204 occupies the next level. The dynamic assignment protocol 204 can be the USAP approach or some other suitable dynamic assignment protocol. The receive slot allocation heuristic 206 is integrated into the system 200 by the dynamic assignment protocol 204. The dynamic assignment protocol 204 can also integrate other higher-level heuristics (not shown) into the system 200. The higher-level heuristics are designed and chosen to meet the requirements of the application being served.
Prior to the development of USAP, a heuristic approach was typically taken to design an application specific protocol that both chose the number of time slots to assign to each neighboring node and coordinated their activation. The USAP approach separates the slot assignment mechanism from the heuristic and creates a single generalized protocol for reliably choosing the slots and coordinating their activation. A dynamic assignment protocol such as USAP can be used to support higher level heuristics.
A node can transmit to its neighbors via essentially one of two different methods. One method, node activation, allows only one active transmitter in a neighborhood in a given time slot. The other method, link activation, can permit more than one simultaneous transmission in the same time slot.
In the node activation technique, a single transmitting node communicates data to all of its neighbors simultaneously rather than on an individual basis. Node activation, also known as multicast or broadcast communication, is especially well suited for applications like address resolution and conferencing. The node activation technique is illustrated in FIG. 3. In FIG. 3, a transmitting node N15 is simultaneously sending 300, 302, 304, 306, 308 the same broadcast communication to each of its neighbor nodes N14, N16, N17, N18 and N19.
In the link activation technique, the transmitting node has only one intended receiver. Link activation, also known as unicast communication, better serves high volume point-to-point traffic. The link activation technique is illustrated in FIG. 4. In FIG. 4, three unicast transmissions are occurring simultaneously. Node N15 is transmitting a unicast message 400 to node N14, node N17 is transmitting a unicast message 402 to node N16 and node N19 is transmitting a unicast message 404 to node N18.
FIG. 5 illustrates a receiver directed assignment of a receive slot. In FIG. 5, node N15 has five neighbor nodes N14, N16, N17, N18, N19. Using a technique such as that described below, node N15 has assigned itself a receive slot. In one embodiment, a node such as node N15 may assign to itself a receive slot that is designated for reception of a transmission from one neighbor node. In this embodiment, only the communication 500 from node N14 to node N15, for example, would take place during the receiver assigned receive slot.
In other embodiments, a node assigns itself a receive slot designated for use by two, three, four or more of its neighbors. Referring to FIG. 5, for example, such embodiments would involve receive slot transmissions 500, 502, 504, 506, 508 from various combinations of two, three or four of node N15's neighboring nodes. In yet another embodiment, a node assigns itself a broadcast receive slot in which all of its neighbors can transmit to it. FIG. 5 provides an example of a receiver directed broadcast slot wherein all five of node N15's neighbors are transmitting 500, 502, 504, 506, 508. It need not be required, however, that all neighbor nodes transmit during a receiver directed broadcast slot. In many applications, only a subset of the neighbors will transmit during the designated broadcast slot.
FIG. 5 is representative of just one of the network configurations that may use the present invention. It will be appreciated that many different network configurations of various sizes, shapes, proportions and connectivity can use the present invention. Further, nodes having a greater or a fewer number of neighboring nodes, for example any of the nodes of FIG. 5, can use the present invention.
Referring to FIG. 6, a time multiplex structure 600 suitable for use with the present invention is depicted. The time multiplex structure 600 of FIG. 6 is a time division multiple access structure. One cycle 602 of the structure 600 includes “N” frames 604. The number of frames 604 required for a particular embodiment is determined by the specifics of the underlying application.
FIG. 6 also illustrates the structure of a representative frame of the cycle. The time allocated to the representative frame is shown divided into “M” distinct time slots 606. It will be appreciated that different numbers of time slots can be used in the various embodiments of the invention. The first slot of each frame 604 of the cycle 602 is a broadcast slot 608 for network management control packets. One of the N broadcast slots 608 is assigned to each node in the network. Therefore, for a network having N nodes, each node will transmit its control packet once during each cycle 602. More than one broadcast slot per frame can be used if it is desired that each node transmit multiple control packets per cycle 602. Further, the broadcast slots can be dynamically assigned using the USAP approach described herein.
Each frame 604 can also include multiple frequency channels 610. In FIG. 6, “F” different frequency channels are illustrated in the representative frame. Different embodiments of the invention include different numbers of time slots 606, channels 610 and/or frames 604.
To determine whether a slot and a channel are available for allocation to a broadcast or a unicast transmission, the USAP methodology of incorporated U.S. Pat. No. 5,719,868 may be applied. Other alternative methodologies exist, however, and can be used in lieu of the USAP methodology.
In the USAP approach, specific constraints on communication slot allocation are included to avoid interference at any node located within two hops of the transmitting node. For a system, such as USAP, including multiple frequency channels, an allocation involves specification of both a time slot and a frequency channel. For a USAP unicast transmission from a node i to a neighboring node j, the transmit slot allocation is a slot:
that has not already been assigned to node i or node j;
in which node i's neighboring nodes are not receiving; and
in which node j's neighboring nodes are not transmitting.
For a multicast communication originating from a node i, the transmit slot. allocation by node i must be one:
that has not already been assigned to node i or any of node i's neighboring nodes; and
in which none of node i's neighbors' neighbors are transmitting.
For a node i to assign itself a receive slot, the receive slot allocation made by node i must be one:
that has not already been assigned to node i or node j;
in which node i's neighboring nodes are transmitting; and
in which node j's neighboring nodes are receiving.
For a node i to assign itself a broadcast receive slot, the allocation by node i must be one:
that has not already been assigned to node i or any of node i's neighboring nodes; and
in which none of node i's neighbors' neighbors are receiving.
A node such as node i insures that its allocations satisfy the above constraints by sharing the following USAP slot sets with its neighboring nodes:
STi—allocations in which node i is transmitting;
SRi—allocations in which node i is receiving; and
NTi—allocations in which node i's neighbors are transmitting.
In addition, to enable a node such as node i to assign itself a receive slot, the following USAP slot set also must be shared:
NRi—allocations in which node i's neighbors are receiving.
In a system where member nodes assign themselves only receive slots, and not transmit slots, the USAP approach as further described in incorporated U.S. Pat. No. 5,719,868 can be modified. In such a system, a node would need to share only the STi(s,f), SRi(s,f) and NRi(s,f) slot sets in its control packet. In a system where transmit slots are also being assigned, the composite task would include sharing of the STi(s,f), SRi(s,f,) and NTi(s,f) slot sets in addition to the NRi(s,f) slot set.
The size of the above-defined slot sets will vary according to network density and the number of slots and channels being managed. To minimize the size of the control packet, the slot set information can be encoded, for example, as bit maps or as lists. Sharing of the slot set information via the control packets enables USAP to 1) select non-conflicting allocations consistent with the most recent topology measurements, and 2) detect and report conflicts caused by topology changes.
After a transmit allocation is selected, a node has the option of transmitting immediately or waiting until a confirmation is received from each neighbor. The unconfirmed mode is appropriate when it is acceptable to have momentary conflicts due to coincident changes in connectivity or conflicting allocations. The confirmed mode verifies that all neighbors are aware of the allocation and that nothing has occurred to make the allocation inconsistent with the current topology or the other nodes' allocations.
When a broadcast receive allocation has been selected, there will usually be no need to utilize a confirmation system. Neighboring nodes will be free to transmit as soon as they have been notified of the allocation. In some circumstances, however, a confirmation process will be included wherein the neighboring node or nodes confirm the allocation.
To allocate a receive slot, a node first generates the set of slots that are not available because they are already in use locally. In the description that follows, the subscript “i” denotes information about the node performing the allocation and “j” denotes the corresponding information reported by a neighboring node.
The assignments are represented by:
S=set of M time slots
F=set of F frequency channels.
For a given channel and time slot pair (s,f), the allocating node's transmit/receive sets are:
STNi(s, f)=set of neighbors to which node i transmits on (s, f)
SRNi(s, f)=set of neighbors from which node i receives on (s, f).
The following sets are then derived:
STi(s, f)=1 if STNi(s, f) not empty, else 0
SRi(s, f)=1 if SRNi(s, f) not empty, else 0.
The neighbor node transmit/receive sets are:
STj(s, f)=the STi(s, f) reported by a neighbor node j
SRj(s, f)=the SRi(s, f) reported by a neighbor node j.
Next, the following sets can be derived:
NTi(s, f)=USTj(s, f) over all neighbors j of node i
NRi(s, f)=USRj(s, f) over all neighbors j of node i
NTj(s, f)=the NTi(s, f) reported by a neighbor node j.
In addition, since NRi(s,f) is being shared in the control packets, the following slot set can also be determined:
NRj(s, f)=the NRi(s, f) reported by a neighbor node j.
If a node i or a neighbor node j is transmitting or receiving (on any channel) in slot s, it is blocked from performing any other communication during slot s. To this end, the following derived sets are useful:
Bi(s)=STi(s, f) U SRi(s, f) for any f
Bj(s)=STj(s, f) U SRj(s, f) for any f.
To decide which slots and channels are available for unicast receive allocation, a node i constructs the blocked allocations for receiving from a given neighbor node j by excluding allocations:
that have been already assigned to node i or node j: Bi(s)UBj(s)
in which node i's neighbors are transmitting: NTi(s,f)
in which node j's neighbors are receiving: NRj(s,f).
This information is combined as follows:
Blocked(i,j, s, f)=Bi(s) U Bj(s) U NTi(s, f) U NRj(s, f)
Blocked(i,j, s, f)=1 if node i cannot receive from node j in (s, f), else
Blocked(i, j, s, f)=0.
To decide which slots and channels are available for broadcast receive allocation, a node i constructs the blocked allocations for receiving from all of its neighbors by excluding allocations:
that have been already assigned to node i: Bi(s)
that have been already assigned to any of node i's neighbors: UBj(s)
in which any of node i's neighbors' neighbors are receiving: UNRj(s,f).
This information is combined as follows:
Blocked(i, s, f)=Bi(s) U Bj(s) U NRj(s, f)
Blocked(i, s, f )=1 if i cannot receive from any of its neighbors in (s, f), else
The slots not contained in Blocked(i,s,f) are available to node i for assignment as a broadcast receive slot. When node i allocates one of the available slots for such a purpose, it can receive therein a transmission from any of its neighbor nodes j, without creating conflicts for any other potential receivers in its neighborhood.
In some networks it may be desirable to reduce the noise floor at the receivers by adding an additional hop of isolation before an allocation is reassigned. This can be accomplished by defining the set of nodes that are receiving within three hops of node i on an location as:
NNRi(s,f)=UNRj(s, f) over all neighbor nodes of node i.
If this is also included in the control packet and stored at the neighbor of node i as NNRj(s,f), and if Blocked (i,j,s,f) is generated as follows, conflicting receptions within three hops of a receiving node will be prevented:
Blocked(i,j,s,f)=Bi(s) U Bj(s) U NTi(s, ) U NRj(s,f) U NNRj(s,f)
Blocked(i, j, s, f)=1 if node i cannot receive from a neighbor node j in (s, f), else
The USAP approach provides contention-less slot assignment with respect to all nodes except the receiving node itself. When a node has assigned itself a broadcast receive slot, any of its neighbors can transmit to it without conflict. If more than one neighbor node attempts to transmit in the same broadcast receive slot, however, their transmissions can collide at the receiving node.
The contention described in the preceding paragraph can be avoided by implementing any of several different techniques. One technique can be characterized as a scheduling technique. One scheduling technique, for example, involves establishment of a round robin sharing of the broadcast receive slot. In implementing this technique, a portion of the allocated broadcast receive slot is assigned to each neighboring node. Each node then transmits to the receiving node only during its portion of the receive slot. For example, referring to FIG. 5, node N14 would communicate 500 its data during the first fifth of the broadcast receive slot, node N16 would communicate 502 its data during the second fifth of the broadcast receive slot, and so forth for each of the remaining neighbor nodes N17, N18 and N19.
Alternatively, the round robin technique can be implemented by requiring that each neighboring node transmit only during a broadcast receive slot of a designated frame. For example, referring to FIG. 5, node N14 would communicate 500 its data during the broadcast receive slot of a first frame of the cycle, node N16 would communicate 502 its data during the broadcast receive slot of a second frame of the cycle, and so forth for each of the remaining neighbor nodes N17, N18 and N19. Many different variations and arrangements are possible.
A scheduled technique such as the round robin technique can be used in several applications. It is best implemented in networks where it is anticipated that a significant number of neighboring nodes will transmit to the receiving node during each broadcast receive slot. In situations involving a bursty communication traffic environment, the technique becomes less efficient since many slots or portions of slots would remain idle. In addition, in dynamic environments where the number of neighbors often changes, the scheduled technique becomes more difficult to manage.
A second technique for avoiding the contention described above, involves implementing a random access technique. For example, one random access technique involves establishment of a request-to-send/clear-to-send (RTS/CTS) reservation of the broadcast receive slot. With this technique, a node with information to transmit during the broadcast receive slot first sends a request-to-send packet to the receiving node. If the broadcast receive slot is still available, the receiving node will reply with a clear-to-send packet and the broadcast receive slot will be reserved for use by the requesting node. The second technique can be employed in applications where it is acceptable 1) to use a portion of the broadcast receive slot for broadcast transmission of the clear-to-send packet by the receiving node, and 2) to sacrifice the overhead required at the beginning of the broadcast receive slot for the RTS/CTS transmissions. In certain applications, however, this type of spatial reuse and burdening of the broadcast receive slot is overly constraining and inefficient.
Implementation of a CDMA protocol provides yet another available technique for avoiding contention during the broadcast receive slot. Use of CDMA permits multiple neighbors to transmit simultaneously on orthogonal spreading codes. Implementation of a CDMA technique can be accomplished in those environments and applications where the added hardware cost is acceptable. Further, CDMA also avoids the overhead, management, spatial reuse and efficiency factors noted with respect to the previously described techniques. Further still, implementation of CDMA brings the added benefit of potentially multiplying network throughput since multiple simultaneous transmissions to a single receiving node are permitted.
Referring now to FIG. 7, an embodiment, suitable for use with the present invention, of a time multiplex structure 700 including a CDMA protocol is illustrated. The time multiplex structure 700 includes a time division multiple access structure. One cycle 702 of the structure 700 includes “N” frames 704. As noted above, the number of frames 704 required for a particular embodiment is determined by the specifics of the underlying application.
FIG. 7 also illustrates the structure of a representative frame of the cycle. The time allocated to the representative frame is shown divided into “M” distinct time slots 706. It will be appreciated that different numbers of time slots can be used in the various embodiments of the invention. Although not specifically depicted in FIG. 7, the first slot of each frame 704 of the cycle 702 can be a broadcast slot for network management control packets. The description and depiction regarding the broadcast slots 608 of FIG. 6 is also applicable to the structure depicted in FIG. 7.
Each frame 704 can also include multiple frequency channels 708. In FIG. 7, “F” different frequency channels are illustrated in the representative frame. Different embodiments of the invention include different numbers of time slots 706, frequency channels 708 and/or frames 704.
In addition, FIG. 7 depicts a plurality of CDMA channels 710. The CDMA approach is used commercially with orthogonal spreading codes to permit the stacking of multiple users on a single frequency channel. Inclusion of this feature permits a receiving node to receive simultaneous transmissions from its neighboring nodes without conflict at the receiving node or at the other receivers of the neighborhood. The embodiment of FIG. 7 includes several different CDMA channels 710, three of which are depicted. Different embodiments of the invention include different numbers of CDMA channels 710.
In certain applications, it is desirable for security purposes to use random spreading codes. Unfortunately, the use of random codes results both in a loss of favorable cross correlation properties and in an increase in the number of communication errors. These problems can be mitigated, however, by giving the receiving node knowledge of the possible spreading codes that its neighboring nodes will use during the receive slots for their receiver directed transmissions.
Provided that the system employs a suitably robust preamble and uses multiple correlators, the receiving node will be able to simultaneously synchronize itself with multiple transmitters. For example, one embodiment uses a receiving node having a programmable preamble-matched filter, a transec decoder and a CDMA code correlator tailored to each transmitter from which it expects to receive a transmission. Maximal length sequence codes having good correlation properties can be used for the preamble codes.
In one embodiment, for example, the preamble code can be an orthogonal code. In an additional embodiment, the preamble code can be a Gold code, which is a maximal length sequence generated by linear feedback shift registers. While Gold codes typically have a cross-correlation value of “1” and are not considered orthogonal, they can be made orthogonal by adding a “0” to the end of the sequence.
Each preamble-matched filter is programmed with the same preamble code used by the intended transmitter. Thus, each preamble-matched filter is tailored to receive transmissions from a particular transmitting node. When a preamble code is received, it will be detected by the appropriate preamble-matched filter. After detecting a matching preamble code, sufficient receiver timing is acquired to remove the random transec code. At this point, the CDMA code correlator despreads the signal by removing the orthogonal CDMA spreading codes and the transmitted data is obtained.
The number of simultaneous transmissions that a receiving node can successfully acquire is limited. The application will dictate the level of performance demanded of the system. For example, in a voice conferencing application, where one or more other speakers may occasionally interrupt a first speaker, thereby creating simultaneous transmissions at the receiving node, the receiving node may be required to handle no more than three or four simultaneous transmissions. Other applications will place greater or lesser such demands on the system. These demands should be taken into account when determining which contention avoidance technique to implement for a given application.
As noted with regard to FIG. 6, the USAP methodology of incorporated U.S. Pat. No. 5,719,868 also may be applied to the embodiments related to FIG. 7. The USAP approach, as described herein and in the incorporated patent, can be applied to determine whether a slot and a channel are available for allocation to a broadcast or a unicast transmission or reception. Other alternative methodologies, however, can be used in lieu of the USAP methodology.
It is thought that the method and apparatus of the present invention will be understood from the descriptions and depictions provided throughout this specification and the appended claims, and that it will be apparent that various changes may be made in the form, construct steps and arrangement of the parts and steps thereof, without departing from the spirit and scope of the invention or sacrificing all of their material advantages. The form herein described is merely an exemplary embodiment thereof.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4763322||30 Jul 1986||9 Aug 1988||U.S. Philips Corp.||Digital radio transmission system with variable duration of the time slots in the time-division multiplex frame|
|US5117422||9 Jul 1990||26 May 1992||Itt Corporation||Method for providing an efficient and adaptive management of message routing in a multi-platform and apparatus communication system|
|US5245609||30 Jan 1991||14 Sep 1993||International Business Machines Corporation||Communication network and a method of regulating the transmission of data packets in a communication network|
|US5420858||5 May 1993||30 May 1995||Synoptics Communications, Inc.||Method and apparatus for communications from a non-ATM communication medium to an ATM communication medium|
|US5448698||5 Apr 1993||5 Sep 1995||Hewlett-Packard Company||Inter-processor communication system in which messages are stored at locations specified by the sender|
|US5450394||10 Mar 1994||12 Sep 1995||Northern Telecom Limited||Delay monitoring of telecommunication networks|
|US5457681||5 Jun 1992||10 Oct 1995||Washington University||ATM-Ethernet portal/concentrator|
|US5502722||1 Aug 1994||26 Mar 1996||Motorola, Inc.||Method and apparatus for a radio system using variable transmission reservation|
|US5506848||22 Jun 1994||9 Apr 1996||At&T Corp.||Demand assignment system and method for mobile users in a community of interest|
|US5568477||27 Jun 1995||22 Oct 1996||International Business Machines Corporation||Multipurpose packet switching node for a data communication network|
|US5581548||19 Dec 1994||3 Dec 1996||Telefonaktiebolaget Lm Ericsson||Frequency and channel hopping communication in a TDMA cellular mobile radio system|
|US5594720||27 Dec 1994||14 Jan 1997||Lucent Technologies Inc.||Multiple access cellular communication with dynamic slot allocation and reduced co-channel interferences|
|US5598417||13 May 1996||28 Jan 1997||Motorola, Inc.||Dynamic control of a data channel in a TDM wireless communication system|
|US5625629||7 Aug 1995||29 Apr 1997||Hughes Electronics||Method of ensuring bandwidth availability for non-page traffic in a communications systems|
|US5652751||26 Mar 1996||29 Jul 1997||Hazeltine Corporation||Architecture for mobile radio networks with dynamically changing topology using virtual subnets|
|US5696903||29 Apr 1994||9 Dec 1997||Norand Corporation||Hierarchical communications system using microlink, data rate switching, frequency hopping and vehicular local area networking|
|US5719868 *||5 Oct 1995||17 Feb 1998||Rockwell International||Dynamic distributed, multi-channel time division multiple access slot assignment method for a network of nodes|
|US5742593||29 Aug 1995||21 Apr 1998||Hazeltine Corporation||On-line distributed TDMA/FDMA/CDMA link assignment in mobile radio networks with flexible directivity|
|US5748362||15 Dec 1995||5 May 1998||Thomson-Csf||Frequency converter, with very high efficiency, in guided optics|
|US5920703||19 Feb 1997||6 Jul 1999||International Business Machines Corp.||Systems and methods for managing the processing of relatively large data objects in a communications stack|
|US5949760 *||21 Mar 1997||7 Sep 1999||Rockwell International Corporation||Simultaneous channel access transmission method for a multi-hop communications radio network|
|US5953344||10 Dec 1996||14 Sep 1999||Lucent Technologies Inc.||Method and apparatus enabling enhanced throughput efficiency by use of dynamically adjustable mini-slots in access protocols for shared transmission media|
|US5983259||19 Feb 1997||9 Nov 1999||International Business Machines Corp.||Systems and methods for transmitting and receiving data in connection with a communications stack in a communications system|
|US6018528||28 Apr 1994||25 Jan 2000||At&T Corp||System and method for optimizing spectral efficiency using time-frequency-code slicing|
|US6031827||19 Feb 1997||29 Feb 2000||Nokia Mobile Phones Limited||Method for radio resource control|
|US6084888||2 Mar 1998||4 Jul 2000||Hitachi, Ltd.||Communication method and communication equipment|
|US6084889||12 Feb 1997||4 Jul 2000||Hitachi, Ltd.||ATM multiplexing apparatus, ATM demultiplexing apparatus, and communication network with the apparatus|
|US6094425||21 Jan 1998||25 Jul 2000||Thomson-Csf||Self-adaptive method for the transmission of data, and implementation device|
|US6094429 *||2 Mar 1998||25 Jul 2000||Motorola, Inc.||Method for accessing and providing access to a packet channel|
|US6157656||25 Mar 1997||5 Dec 2000||Net Insight Ab||Method and arrangement for dynamic signalling|
|US6252868||11 Jan 2000||26 Jun 2001||Telefonaktiebolaget Lm Ericsson (Publ)||Digital control channels having logical channels supporting broadcast SMS|
|US6256304 *||31 Mar 1998||3 Jul 2001||Nokia Mobile Phones, Limited||Mobile station using synchronization word order information for improved channel acquisition|
|US6256477 *||30 Sep 1998||3 Jul 2001||Conexant Systems, Inc.||Avoiding interference from a potentially interfering transmitter in a wireless communication system|
|US6275506||7 Jan 1998||14 Aug 2001||Thomson Licensing S.A.||Radio transmission method for digital multimedia data signals between subscriber stations in a local network|
|US6304559||11 May 2000||16 Oct 2001||Northrop Grumman Corporation||Wireless communications protocol|
|US6310867||19 Jan 1999||30 Oct 2001||Nokia Mobile Phones Limited||Portable radio telephone and methods of operation|
|US6314084||5 Dec 1997||6 Nov 2001||At&T Corp.||Transmission system, method and apparatus for scheduling transmission links and determining system stability based on dynamic characteristics of a transmission medium|
|US6317436 *||28 Jun 1999||13 Nov 2001||Rockwell Collins||Method and apparatus for managing communication resources using an adaptive broadcast cycle (ABC)|
|US6324184||4 Sep 1998||27 Nov 2001||General Instrument Corporation||Dynamic bandwidth allocation for a communication network|
|US6331973 *||30 Apr 1999||18 Dec 2001||Rockwell Collins, Inc.||Unifying slot assignment protocol multiple access system|
|US6353598||30 Oct 1998||5 Mar 2002||Lucent Technologies Inc.||Asymmetric multiple access protocol for a communication system|
|US6353605||15 Oct 1999||5 Mar 2002||Nokia Telecommunications Oy||Data transmission in a mobile network|
|US6389273 *||23 Aug 1999||14 May 2002||Delphi Technologies, Inc.||Adjacent channel interference reduction in a FM receiver|
|US6414955 *||23 Mar 1999||2 Jul 2002||Innovative Technology Licensing, Llc||Distributed topology learning method and apparatus for wireless networks|
|US6466793 *||28 May 1999||15 Oct 2002||Ericsson Inc.||Automatic frequency allocation (AFA) for wireless office systems sharing the spectrum with public systems|
|US6469996||9 Jun 1998||22 Oct 2002||Alcatel||Method of allocating transmission channels to a mobile station, in particular in duplex mode, in a mobile packet-mode telecommunications network|
|US6487186 *||28 Jun 1999||26 Nov 2002||Rockwell Collins, Inc.||Method and apparatus for managing communication resources using bootstrap slots|
|US6504829 *||28 Jun 1999||7 Jan 2003||Rockwell Collins, Inc.||Method and apparatus for managing communication resources using channelized neighborhoods|
|US6553424 *||25 Sep 1998||22 Apr 2003||Infineon Technologies Ag||Circular buffer for a TDMA data transmission station and corresponding data transmission station|
|US6574199 *||30 Apr 1999||3 Jun 2003||Rockwell Collins, Inc.||Unifying slot assignment protocol logical neighborhooding|
|US6574206 *||28 Jun 1999||3 Jun 2003||Rockwell Collins||Method and apparatus for managing communication resources upon speculation slots|
|US6600754 *||28 Jun 1999||29 Jul 2003||Rockwell Collins, Inc.||Method and apparatus for managing communication resources using standby slots|
|US6628636 *||28 Jun 1999||30 Sep 2003||Rockwell Collins||Method and apparatus for managing communication resources using neighbor segregation|
|US6631124||3 Nov 1999||7 Oct 2003||Ericsson Inc.||Methods and apparatus for allocating resources in hybrid TDMA communication systems|
|US20020001294||15 May 2001||3 Jan 2002||Konstantinos Amouris||Method for dynamically allocating time slots of a common TDMA broadcast channel to a network of transceiver nodes|
|US20020046381||1 Nov 2001||18 Apr 2002||Xircom Wireless, Inc.||Out-of-band forward error correction|
|1||Bittle, Caples, Young, "Soldier Phone: An Innovative Approach to Wireless Multimedia Communications," 1998 IEEE MILCOM, vol. 3.|
|2||Chakraborty et al. "Generic Algorithm for Broadcast Scheduling in Packet Radio Networks," Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence. May 4-9, 1998. pp. 183-188.|
|3||Chou et al. "Slot Allocation Strategies for TDMA Protocols in Multihop Packet Radio Network." Eleventh Annual Joint Conference of the IEEE Computer and Communications Societies. May 4-8, 1992. pp. 710-716.|
|4||IEEE Transaction on Information Theory, vol. IT-30, No. 4, Jul. 1984.|
|5||L. Pond and V. Li, "Bridging the Gap Interoperability, Survivability, Security," 1989 IEEE MILCOM, Conference Record, vol. 1 of 3.|
|6||Oono et al. "Dynamic Slot Allocation Technology for Mobile Multi-Media TDMA Systems Using Distributed Control Scheme," IEEE. Oct. 12-16, 1997. pp. 74-78.|
|7||Pond et al., "Distributed Time-Slot Assignment Protocol for Mobile Multi-Hop Broadcast Packet Radio Networks," IEEE MILCOM, 1969. Oct. 15-18, 1989. pp. 70-74.|
|8||Sunlin, "A Hybrid Distributed Slot Assignment TDMA Channel Access Protocol," IEEE Communications Conference, 1990, vol. 3 of 3.|
|9||U.S patent application Ser. No. 09/650,332, "Scheduling Techniques for Receiver Directed Broadcast Applications," filed Aug. 29, 2000, C. David Young.|
|10||U.S. patent application Ser. No. 09/562,549, "Efficient Grouping of Control and User Data," filed May 2, 2000, J.A. Stevens et al. U.S. patent application Ser. No. 09/303,802, "Clique Activation Multiple Access," filed Apr. 30, 1999, C. D. Young et al.|
|11||Young and Stevens, "Clique Activation Multiple Access (CAMA): A Distributed Heuristic for Building Wireless Datagram Networks," IEEE Military Communications Conference 1998, vol. 1 Ju et al. "An Optimal Topology-Transport Scheduling Method in Multihop Packet Radio Networks." IEEE/ACM Transactions on Networking. Jun. 1998. pp. 298-306.|
|12||Young, "USAP: A Unifying Dynamic Distributed Multichannel TDMA Slot Assignment Protocol," Proc. IEEE MILSOM 1996, vol. 1, Oct. 1996.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7251224 *||9 Oct 2001||31 Jul 2007||Intel Corporation||Communications meshes|
|US7260100||8 Aug 2005||21 Aug 2007||Rockwell Collins, Inc.||System and method for net formation and merging in ad hoc networks|
|US7298721 *||2 Feb 2001||20 Nov 2007||Ntt Docomo, Inc.||Single-carrier/DS-CDMA packet transmitting method, uplink packet transmitting method in multi carrier/DS-CDMA mobile communication system, and structure of downlink channel in multi carrier/DS-CDMA mobile communication system|
|US7342913 *||23 Nov 2004||11 Mar 2008||The Boeing Company||Method for assigning slots in a mobile network|
|US7403780||19 Feb 2004||22 Jul 2008||Rockwell Collins, Inc.||Hybrid open/closed loop filtering for link quality estimation|
|US7430192||8 Aug 2005||30 Sep 2008||Rockwell Collins, Inc.||Net formation-merging system and method|
|US7606171||28 Jul 2005||20 Oct 2009||Rockwell Collins, Inc.||Skeletal node rules for connected dominating set in ad-hoc networks|
|US7826372||2 Nov 2010||Rockwell Collins, Inc.||Network routing process for regulating traffic through advantaged and disadvantaged nodes|
|US7969919||8 Aug 2005||28 Jun 2011||Rockwell Collins, Inc.||System and method for thermal load sharing between nodes in a communications network|
|US8005110||13 Aug 2007||23 Aug 2011||Ntt Docomo, Inc.||Single carrier/DS-CDMA packet transmission method, an uplink packet transmission method in a multi-carrier/DS-CDMA mobile communications system, and a structure of a downlink channel in a multi-carrier/DS-CDMA mobile communications system|
|US8009605||8 Aug 2005||30 Aug 2011||Rockwell Collins, Inc.||Low power, programmable modem for software defined radio applications|
|US8126488 *||21 Apr 2006||28 Feb 2012||Axiometric Llc||Wireless communication system and related methods|
|US8139624||25 Aug 2005||20 Mar 2012||Rockwell Collins, Inc.||System and method for providing multiple ad hoc communication networks on a hardware channel|
|US8289933 *||16 Oct 2012||Alcatel Lucent||Hybrid transmission method for wireless communications|
|US8351409||17 Apr 2010||8 Jan 2013||Axiometric, Llc||Timing synchronization in wireless mesh networks|
|US8385189||26 Feb 2013||Research In Motion Limited||Multi-hop wireless backhaul network and method|
|US8428558||4 Nov 2010||23 Apr 2013||Axiometric, Llc||System and method for routing in a wireless mesh network|
|US8428630||10 Jan 2012||23 Apr 2013||Axiometric, Llc||Wireless communication system and related methods|
|US8687562 *||12 Jul 2007||1 Apr 2014||Lockheed Martin Corporation||Wireless network enhancements|
|US9072093 *||19 Dec 2007||30 Jun 2015||Qualcomm Incorporated||Flexible control channels for unplanned wireless networks|
|US9084257||25 Feb 2013||14 Jul 2015||The Boeing Company||Methods and systems for allocating resources in a wireless network|
|US20020044537 *||9 Oct 2001||18 Apr 2002||Radiant Networks Plc||Communications meshes|
|US20020159470 *||2 Feb 2001||31 Oct 2002||Hiroyuki Atarashi||Single-carrier/ds-cdma packet transmitting method, uplink packet transmitting method in multi carrier/ds-cdma mobile communication system, and structure of downlink channel in multi carrier/ds-cdma mobile comunication system|
|US20030096613 *||18 Oct 2001||22 May 2003||Arnab Das||Hybrid transmission method for wireless communications|
|US20040110508 *||17 Sep 2003||10 Jun 2004||Jacobus Haartsen||Methods and electronic devices for wireless ad-hoc network communications using receiver determined channels and transmitted reference signals|
|US20060109831 *||23 Nov 2004||25 May 2006||The Boeing Company||Method for assigning slots in a mobile network|
|US20060234717 *||6 Mar 2006||19 Oct 2006||Ngan-Cheung Pun||Listening frequency and resource planning for cdma based ad-hoc networks|
|US20060239333 *||21 Apr 2006||26 Oct 2006||David Albert||Wireless communication system and related methods|
|US20070274288 *||1 Mar 2007||29 Nov 2007||Motorola, Inc.||Sharing resources in a wireless communication system|
|US20070286129 *||31 Jul 2007||13 Dec 2007||Ntt Docomo, Inc||Single carrier/ds-cdma packet transmission method, an uplink packet transmission method in a multi-carrier/ds-cdma mobile communications system, and a structure of a downlink channel in a multi-carrier/ds-cdma mobile communications system|
|US20070291701 *||13 Aug 2007||20 Dec 2007||Ntt Docomo, Inc||Single carrier/ds-cdma packet transmission method, an uplink packet transmission method in a multi-carrier/ds-cdma mobile communications system, and a structure of a downlink channel in a multi-carrier/ds-cdma mobile communications system|
|US20090016280 *||12 Jul 2007||15 Jan 2009||Lockheed Martin Corporation||Wireless network enhancements|
|US20090122775 *||13 Jan 2009||14 May 2009||Jacobus Haartsen||Methods and electronic devices for wireless ad-hoc network communications using receiver determined channels and transmitted reference signals|
|US20090161636 *||19 Dec 2007||25 Jun 2009||Qualcomm Incorporated||Flexible control channels for unplanned wireless networks|
|US20100067476 *||24 Nov 2009||18 Mar 2010||Nortel Networks Limited||Multi-hop wireless backhaul network and method|
|US20100074105 *||24 Nov 2009||25 Mar 2010||Nortel Networks Limited||Multi-hop wireless backhaul network and method|
|US20100202436 *||17 Apr 2010||12 Aug 2010||Axiometric, Llc||Timing Synchronization in Wireless Mesh Networks|
|US20110044276 *||4 Nov 2010||24 Feb 2011||Axiometric, Llc||System and Method for Routing in a Wireless Mesh Network|
|International Classification||H04J4/00, H04J3/16|
|Cooperative Classification||H04J3/16, H04J4/00|
|European Classification||H04J3/16, H04J4/00|
|19 Apr 2000||AS||Assignment|
Owner name: ROCKWELL COLLINS, INC., IOWA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:YOUNG, C. DAVID;CAPLES, EDGAR L.;BARTON, JEFFREY A.;AND OTHERS;REEL/FRAME:010757/0937
Effective date: 20000314
|10 Mar 2008||FPAY||Fee payment|
Year of fee payment: 4
|21 Sep 2011||FPAY||Fee payment|
Year of fee payment: 8
|14 Mar 2016||FPAY||Fee payment|
Year of fee payment: 12