Multiplex communications – Duplex – Communication over free space
Reexamination Certificate
2000-08-29
2004-10-26
Jung, Min (Department: 2663)
Multiplex communications
Duplex
Communication over free space
C370S347000, C370S436000
Reexamination Certificate
active
06810022
ABSTRACT:
FIELD OF THE INVENTION
The present invention generally relates to an improved dynamic assignment protocol for a radio network, more particularly relates to a protocol for full-duplex communication, and even more particularly relates to an extension to USAP for enabling full-duplex communication.
BACKGROUND OF THE INVENTION
Mobile multi-hop packet radio networks are known for rapid and convenient deployment, self-organization, mobility, and survivability. Many applications require self-organizing, wireless networks that can operate in dynamic environments and provide peer-to-peer, multi-hop, multi-media 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.
Receivers are generally capable of processing only one transmission at a time. When using such receivers, 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 communication slots to nodes. The approach chosen for a particular application is generally related to the type of network application (broadcast, multicast, unicast, datagrams, virtual circuits, etc.) being implemented.
The Unifying Slot Assignment Protocol (USAP), which is disclosed in U.S. Pat. No. 5,719,868, provides a protocol establishing one such contention avoidance 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. The original USAP embodiments were designed for use with half-duplex radios and therefore do not support full-duplex communication. Since a full-duplex radio can transmit and receive at the same time, the use of full-duplex radios presents the potential of doubling network throughput relative to half-duplex radios. As a result, there exists a need for a dynamic assignment protocol that can support full-duplex radios. This need is addressed and fulfilled by the detailed description provided below.
SUMMARY OF THE INVENTION
It is an object of the present invention to provide an improved dynamic assignment protocol.
It is a feature of the present invention to utilize an assignment formula particularly suited to the support of full-duplex radios.
It is an advantage of the present invention to enable a dynamic assignment protocol such as USAP to be used in a network containing full-duplex radios.
The present invention provides an improved dynamic assignment protocol suitable for use with full-duplex radios. It is carried out in a “contention-less” manner such that collisions between communications transmitted between full-duplex radios are avoided. The invention includes embodiments for determining unicast and broadcast communication slot allocations.
REFERENCES:
patent: 4504946 (1985-03-01), Raychaudhuri
patent: 4763322 (1988-08-01), Eizenhofer
patent: 5012469 (1991-04-01), Sardana
patent: 5117422 (1992-05-01), Hauptschein et al.
patent: 5245609 (1993-09-01), Ofek et al.
patent: 5295140 (1994-03-01), Crisler et al.
patent: 5396496 (1995-03-01), Ito 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), Papadopoulos et al.
patent: 5598417 (1997-01-01), Crisler et al.
patent: 5613198 (1997-03-01), Ahmadi et al.
patent: 5625629 (1997-04-01), Wenk
patent: 5644576 (1997-07-01), Bauchot et al.
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: 5953344 (1999-09-01), Dail et al.
patent: 5983259 (1999-11-01), Campbell et al.
patent: 6014089 (2000-01-01), Tracy 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: 6088659 (2000-07-01), Kelley et al.
patent: 6094425 (2000-07-01), Auger et al.
patent: 6094429 (2000-07-01), Blanchette et al.
patent: 6151319 (2000-11-01), Dommety et al.
patent: 6157656 (2000-12-01), Lindgren 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: 6369719 (2002-04-01), Tracy et al.
patent: 6384739 (2002-05-01), Roberts, Jr.
patent: 6389273 (2002-05-01), Brandenburg
patent: 6414955 (2002-07-01), Clare et al.
patent: 6442157 (2002-08-01), Carter et al.
patent: 6466793 (2002-10-01), Wallstedt et al.
patent: 6469996 (2002-10-01), Dupuy
patent: 6487186 (2002-11-01), Young et al.
patent: 6498667 (2002-12-01), Masucci et al.
patent: 6504829 (2003-01-01), Young et al.
patent: 6529443 (2003-03-01), Downey et al.
patent: 6553424 (2003-04-01), Kranz et al.
patent: 6556899 (2003-04-01), Harvey et al.
patent: 6574199 (2003-06-01), Young et al.
patent: 6574206 (2003-06-01), Young
patent: 6600754 (2003-07-01), Young et al.
patent: 6628636 (2003-09-01), Young
patent: 6631124 (2003-10-01), Koorapaty et al.
patent: 6711177 (2004-03-01), Young
patent: 2002/0001294 (2002-01-01), Amouris
patent: 2002/0046381 (2002-04-01), Morris et al.
C. David Young, “USAP: A Unifying Dynamic Distributed Multichannel TDMA Slot Assignment Protocol ,” Proc. IEEE MILCOM 1996, vol. 1, Oct. 1996.
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.
Pond et al. “A Distributed Time-Slot Assignment Protocol for Mobile Multi-Hop Broadcast Packet Radio Networks,” IEEE MILCOM, 1989. Oct. 15-18, 1989. pp. 70-74.
Arikan, E. “Some Complexity Results about Packet Radio Networks,” IEEE Transactions on Information Theory,v.IT-30, No. 4, Jul. 1984, pp. 681-685.
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.
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.
U.S. patent application Ser. No. 09/650,332, “Scheduling Techniques for Receiver Directed Broadcast Applications,” filed Aug. 29, 2000, C. David Young.
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.
L. Pond and V. Li, “Bridging the Gap Interoperability, Survivability, Security,” 1989 IEEE MILCOM, Conference Record, vol. 1 of 3.
Bittl
Eppele Kyle
Jensen Nathan O.
Jung Min
Rockwell Collins
LandOfFree
Full duplex communication slot assignment does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Full duplex communication slot assignment, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Full duplex communication slot assignment will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3268624