Multiplex communications – Channel assignment techniques – Combined time and frequency assignment
Reexamination Certificate
2000-04-19
2004-09-14
Olms, Douglas (Department: 2661)
Multiplex communications
Channel assignment techniques
Combined time and frequency assignment
C370S902000
Reexamination Certificate
active
06791994
ABSTRACT:
FIELD OF THE INVENTION
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.
BACKGROUND OF THE INVENTION
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 N
1
of
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 N
1
, N
3
, N
4
, N
5
, N
6
, N
7
and N
8
are members of the neighborhood surrounding node N
1
.
Nodes N
2
, N
9
, N
10
, N
11
and N
12
are each located two hops away from node N
1
and node N
13
can be said to be three hops away from node N
1
. When data transmitted from node N
1
, is to be propagated multiple hops, the data must be relayed by one or more of node N
1
's neighbors. For example, data transmitted by node N
1
, can be relayed by its neighbor node N
8
to a node such as node N
12
that is located two hops from node N
1
.
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.
SUMMARY OF THE INVENTION
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.
REFERENCES:
patent: 4763322 (1988-08-01), Eizenhofer
patent: 5117422 (1992-05-01), Hauptschein et al.
patent: 5245609 (1993-09-01), Ofek et al.
patent: 5420858 (1995-05-01), Marshall et al.
patent: 5448698 (1995-09-01), Wilkes
patent: 5450394 (1995-09-01), Gruber et al.
patent: 5457681 (1995-10-01), Gaddis et al.
patent: 5502722 (1996-03-01), Fulghum
patent: 5506848 (1996-04-01), Drakopolous et al.
patent: 5568477 (1996-10-01), Galand et al.
patent: 5581548 (1996-12-01), Ugland et al.
patent: 5594720 (1997-01-01), Papadopolous et al.
patent: 5598417 (1997-01-01), Crisler et al.
patent: 5625629 (1997-04-01), Wenk
patent: 5652751 (1997-07-01), Sharony
patent: 5696903 (1997-12-01), Mahany
patent: 5719868 (1998-02-01), Young
patent: 5742593 (1998-04-01), Sharony et al.
patent: 5748362 (1998-05-01), Delacourt et al.
patent: 5920703 (1999-07-01), Campbell et al.
patent: 5949760 (1999-09-01), Stevens et al.
patent: 5983259 (1999-11-01), Campbell et al.
patent: 6018528 (2000-01-01), Gitlin et al.
patent: 6031827 (2000-02-01), Rikkinen et al.
patent: 6084888 (2000-07-01), Watanabe et al.
patent: 6084889 (2000-07-01), Murakami
patent: 6094425 (2000-07-01), Auger et al.
patent: 6094429 (2000-07-01), Blanchette et al.
patent: 6157656 (2000-12-01), Lindgren et al.
patent: 5953344 (2001-05-01), Dail et al.
patent: 6252868 (2001-06-01), Diachina et al.
patent: 6256304 (2001-07-01), Vayrynen
patent: 6256477 (2001-07-01), Eidson et al.
patent: 6275506 (2001-08-01), Fazel et al.
patent: 6304559 (2001-10-01), Jacklin et al.
patent: 6310867 (2001-10-01), Tat et al.
patent: 6314084 (2001-11-01), Kahale et al.
patent: 6317436 (2001-11-01), Young et al.
patent: 6324184 (2001-11-01), Hou et al.
patent: 6331973 (2001-12-01), Young et al.
patent: 6353598 (2002-03-01), Baden et al.
patent: 6353605 (2002-03-01), Rautanen et al.
patent
Barton Jeffrey A.
Caples Edgar L.
Stevens James A.
Young C. David
Eppele Kyle
Jensen Nathan O.
Olms Douglas
Pizarro Ricardo M.
Rockwell Collins, Inc.
LandOfFree
Method and apparatus for assigning receive slots in a... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for assigning receive slots in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for assigning receive slots in a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3230980