Multiplex communications – Pathfinding or routing – Through a circuit switch
Reexamination Certificate
2006-04-13
2008-11-11
Chan, Wing F. (Department: 2619)
Multiplex communications
Pathfinding or routing
Through a circuit switch
C370S401000, C709S226000
Reexamination Certificate
active
07450577
ABSTRACT:
Systems and methods are provided for managing communications between two or more ad-hoc networks in a communication system. The systems and methods may have flexible communication time sharing of one or more nodes taking part in two or more ad-hoc networks. For example, the communication scheduling function for a node shared by two or more ad-hoc networks is provided with a generic functional architecture such that it may be located in a number of different locations. In one embodiment, a Bluetooth communication system includes an inter-piconet scheduling function having a JUMP mode introduced to distinctly identify a node to its neighbors as being shared with multiple ad-hoc networks. The jump mode may have one or more methods for managing the inter-network communications that may include: (1) predetermined fixed starting point and length communication windows, (2) time points with flexible starting points and communication window length, and/or (3) random starting time and length communication windows.
REFERENCES:
patent: 5598417 (1997-01-01), Crisler et al.
patent: 5949776 (1999-09-01), Mahany et al.
patent: 6026297 (2000-02-01), Haartsen
patent: 6480505 (2002-11-01), Johansson et al.
patent: 6590928 (2003-07-01), Haartsen
patent: 6618377 (2003-09-01), Miriyala
patent: 6718533 (2004-04-01), Schneider et al.
patent: 6735448 (2004-05-01), Krishnamurthy et al.
patent: 6751200 (2004-06-01), Larsson et al.
patent: 6850965 (2005-02-01), Allen
patent: 7024482 (2006-04-01), Hlasny
patent: 7058050 (2006-06-01), Johansson et al.
patent: 2001/0003191 (2001-06-01), Kovacs et al.
patent: 2002/0150145 (2002-10-01), Alriksson et al.
patent: 2002/0176412 (2002-11-01), Racz et al.
patent: 2003/0012173 (2003-01-01), Rune
patent: 2004/0095907 (2004-05-01), Agee et al.
patent: 2004/0196784 (2004-10-01), Larsson et al.
patent: 0999717 (2000-05-01), None
patent: WO 99/29126 (1999-06-01), None
patent: WO 00/69186 (2000-11-01), None
patent: WO 01/41348 (2001-06-01), None
European Search Report, dated Jun. 28, 2001, in connection with U.S. Appl. No. 60/250,149.
PCT International Search Report, dated Dec. 19, 2002, in connection with International Application No. PCT/SE01/02651.
Haijun Luo et al; A topology-independent fair queueing model in ad hoc wireless networks Network Protocols, 2000. Proceedings. 2000 International Conference on, Nov. 14-17, 2000 pp. 325-335.
Chang et al.; Routing in wireless/mobile ad-hoc via dynamic group construction; Mobile Networks and Application archives, vol. 5, Issue 1 (Mar. 2000) table of contents pp. 27-37.
K.Y. Eng, M.J. Karol, M. Veeraraghavan, E. Ayanoglu, C.B. Woodworth, P. Pancha, R.A. Valenzuela; A wireless broadband ad-hoc ATM local-area network; Feb. 1995. Wireless Networks, vol. 1 Issue 2 pp. 161-174.
Ayyagari, D. et al; A unified approach to scheduling, access control and routing for ad-hoc wireless networks; Vehicular Technology Conference Proceedings, 2000. VTC 2000-Spring Tokyo, 2000 IEEE 51stvol. 1. May 15-18, 2000 page(s).
Alriksson Fredrik
Johansson Niklas
Johansson Per
Jönsson Ulf
Chan Wing F.
Jones Prenell P
Potomac Patent Group PLLC
Telefonaktiebolaget L M Ericsson (publ)
LandOfFree
Flexible inter-network communication scheduling does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Flexible inter-network communication scheduling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Flexible inter-network communication scheduling will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4047522