Multiplex communications – Channel assignment techniques – Using time slots
Reexamination Certificate
2008-06-03
2008-06-03
Backer, Firmin (Department: 2616)
Multiplex communications
Channel assignment techniques
Using time slots
C370S230000, C370S280000, C370S376000, C370S468000, C370S437000
Reexamination Certificate
active
07382799
ABSTRACT:
A method of communicating over a network of nodes using a plurality of time slots is disclosed. According to the method, at least one of the plurality of time slots are assigned to a first node. The first node communicates, to neighboring nodes within one hop of the first node, which time slots assigned to the first node are scheduled to be used by the first node. Each neighboring node determines whether it has a need to use more time slots than it has been assigned. Each neighboring node communicates its respective need to the first node. At least one of the neighboring nodes is permitted to use one of the unscheduled time slots.
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), Drakopoulos 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: 6140184 (2000-10-01), Dupuy
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. et al.
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: 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: 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 et al.
patent: 6788702 (2004-09-01), Garcia-Luna-Aceves et al.
patent: 7082111 (2006-07-01), Amouris
patent: 2002/0001294 (2002-01-01), Amouris
patent: 2002/0046381 (2002-04-01), Morris et al.
patent: 2004/0028018 (2004-02-01), Cain
patent: 2004/0100929 (2004-05-01), Garcia-Luna-Aceves
U.S. Appl. No. 09/422,498, “Method and Apparatus for Managing Communication Resources Using Dynamic and Static Assignment of Communication Slots,” filed Oct. 21, 1999, C. David Young.
U.S. Appl. No. 09/649,802, “Maintaining an Adaptive Broadcast Channel Using Both Transmitter Directed and Receiver Directed Broadcast,” filed Aug. 29, 2000, C. David Young.
U.S. Appl. No. 09/649,665, “Data Communication Techniques for Real Time Data Transmission,” Aug. 29, 2000, T. Golubiewski et al.
I. Chlamtac and A. Farago, “An Optimal Channel Access Protocol with Multiple Reception Capacity,” Dept. of Telecommunications & Telematics, Technical University of Budapest, Budapest, Hungary. Publication date unknown; believed to be 1993.
U.S. Appl. No. 09/649,666, “Full Duplex Communication Slot Assignment,” filed Aug. 29, 2000, C. David Young.
U.S. Appl. No. 10/689,448, “Heuristics for Combining Inter-Channel and Intra-Channel Communications in a Wireless Environment,” filed Oct. 20, 2003, C. David Young et al.
Young, “USAP: A Unifying Dynamic Distributed Multichannel TDMA Slot Assignment Protocol,” Proc. IEEE MILCOM 1996, vol. 1, Oct. 1996.
L. Pond and V. Li, “Bridging the Gap Interoperability, Survivability, Security,” 1989 IEEE MILCOM, Conference Record, vol. 1 of 3.
Bittle, Caples, Young, “Soldier Phone: An Innovative Approach to Wireless Multimedia Communications,” 1998 IEEE MILCOM, vol. 3.
Sunlin, “A Hybrid Distributed Slot Assignment TDMA Channel Access Protocol,” IEEE Military Communications Conference, 1990, vol. 3 of 3.
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.
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. Appl. No. 09/650,332, “Scheduling Techniques for Receiver Directed Broadcast Applications,” filed Aug. 29, 2000, C. David Young.
U.S. Appl. No. 09/562,549, “Efficient Grouping of Control and User Data,” filed May 2, 2000, J.A. Stevens et al. U.S. Appl. No. 09/303,802, “Clique Activation Multiple Access,” filed Apr. 30, 1999, C. D. Young et al.
Stevens James A.
Young C. David
Backer Firmin
Eppele Kyle
Jensen Nathan O.
Ngo Nguyen
Rockwell Collins, Inc.
LandOfFree
On-demand broadcast protocol does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with On-demand broadcast protocol, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On-demand broadcast protocol will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2806824