Multiplex communications – Communication over free space
Reexamination Certificate
2005-09-27
2009-08-25
Pérez-Gutiérrez, Rafael (Department: 2617)
Multiplex communications
Communication over free space
C370S329000, C370S400000, C370S458000, C370S332000, C370S335000, C370S421000, C370S408000, C370S445000, C370S338000, C370S431000, C370S254000, C370S503000, C709S235000
Reexamination Certificate
active
07580382
ABSTRACT:
A method for forming channelized groups in a wireless communication network having a plurality of nodes. At least one node in the network is assigned to a first channel that is associated with a channelized group having a first set of nodes. The method determines whether there is contention between the at least one node and the first set of nodes. In addition, the method includes switching the at least one node from the first channel to a second channel based on the contention determination.
REFERENCES:
patent: 5343472 (1994-08-01), Michihira et al.
patent: 5949760 (1999-09-01), Stevens et al.
patent: 6275497 (2001-08-01), Varma et al.
patent: 6317436 (2001-11-01), Young et al.
patent: 6331973 (2001-12-01), Young et al.
patent: 6487186 (2002-11-01), Young et al.
patent: 6496941 (2002-12-01), Segal et al.
patent: 6504829 (2003-01-01), Young et al.
patent: 6515973 (2003-02-01), Young
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: 6711177 (2004-03-01), Young
patent: 6754176 (2004-06-01), Gubbi et al.
patent: 7158484 (2007-01-01), Ahmed et al.
patent: 2002/0027894 (2002-03-01), Arrakoski et al.
patent: 2003/0012166 (2003-01-01), Benveniste
patent: 2003/0139918 (2003-07-01), Hardwick et al.
patent: 2004/0095911 (2004-05-01), Benveniste et al.
patent: 2004/0218922 (2004-11-01), Giles et al.
patent: 2004/0240426 (2004-12-01), Wu et al.
patent: 2006/0198337 (2006-09-01), Hoang et al.
patent: 2006/0215581 (2006-09-01), Castagnoli
patent: 2006/0215582 (2006-09-01), Castagnoli et al.
patent: 2006/0215583 (2006-09-01), Castagnoli
patent: 2007/0211749 (2007-09-01), Benveniste
Amis et al., “Load-Balancing Clusters in Wireless Ad Hoc Networks”, undated (8 pgs.).
Amis et al., “Max-Min D-Cluster Hormation in Wireless Ad Hoc Netowrks”, undated (10 pgs.).
Baker et al., “The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm”,IEEE Transactions on Communications, vol. Com-29, No. 11, Nov. 1981 (pp. 1694-1701).
Baker et al., “The Design and Simulation of a Mobile Radio Network with Distributed Control”, IEEE Journal on Selected Areas in Communications, vol. SAC-2, No. 1, Jan. 1983 (pp. 226-237).
Das et al., “Routing in Ad Hoc Networks Using a Spine”,IEEE, Coordinated Sciences Laboratory, University of Illinois at Urbana-Champaign, 1997 (pp. 34-39).
Das et al., “Routign in Ad-Hoc Networks Using Minimum Connected Dominating Sets”, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, undated (pp. 1-5).
Ephremides, et al., “A Design Concept for Reliable Mobile Networks with Frequency Hopping Signaling”,Proceedings of the IEEE, vol. 75, No. 1, Jan. 1987 (pp. 56-73).
Gerla et al., “Multicluster, mobile, multimedia radio network”,Baltzer Journals, Jul. 12, 1995 (pp. 1-26).
Jia,et al., “An Efficient Distributed Algorithm for Costructing Small Dominating Sets”, College of Computer Science, Northeastern University and Department of Computer and Information Science, undated (10 pgs.).
Krishna et al., “A Cluster-based Approach for Routing in Dynamic Networks”, undated (16 pgs.).
McDonald et al., “A Mobility-Based Framework for Adaptive Clustering in Wireless Ad Hoc Networks”, IEEE Journal on Selected Areas in Communications, vol. 17, No. 8, Aug. 1999 (pp. 1466-1487).
Parekh, Abhay K., “Selecting Routers in Ad-hoc Wireless Networks”, undated (18 pgs.).
Ramanathan et al., “Hierarchically-organized, multihop mobile wireless networks for quality-of-service support”, undated (42 pgs.).
Sharony, Jacob, “An Architecture for Mobile Radio Networks with Dynamically Changing Topology Using Virtual Subnets”, undated (pp. 1-12).
Sivakumer et al., “CEDAR: a Core-Extraction Distributed Ad hoc Routing algorithm”, IEEE Journal on Selected Areas in Communication, vol. 17, No. 8, Aug. 1999 (pp. 1-12).
Internet-Draft, “Cluster Based Routing Protocol (CBRP)”, available at http://www.comp.nus.edu.sq/˜tayyc/cbrp/draft-ietf-manet-cbrp-spec-01.txt, available at least by Jul. 25, 2005 (38 pages).
Amis Alan D.
Miller Frank W.
Arevalo Joseph
Barbieri Daniel M.
Perez-Gutierrez Rafael
Rockwell Collins, Inc.
LandOfFree
System and method for distributed channelized group... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for distributed channelized group..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for distributed channelized group... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4116855