Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2005-08-01
2010-02-09
Ton, Dang T (Department: 2419)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S254000, C370S503000
Reexamination Certificate
active
07660315
ABSTRACT:
A method of routing data in a multi-hop network. In one embodiment, the method includes: determining that a link-flow vector representing a set of flows to be routed from a source to a destination node satisfies necessary scheduling conditions for achievability; generating a scheduling multi-graph having at least one pair of nodes with multiple edges therebetween; deriving one or more sufficient scheduling conditions for achievability of the vector; solving a linear optimization problem over the necessary scheduling conditions to obtain an upper bound on achievability of the vector; and generating, based on the scheduling multi-graph, a routing solution that is a lower bound on the achievability of the vector and has a set of routes and associated schedule for achieving the vector. At least one node v receives transmissions from a specified plurality Ω(v) of other nodes. At least one of the scheduling conditions depends on Ω(v).
REFERENCES:
patent: 7184413 (2007-02-01), Beyer et al.
patent: 7286489 (2007-10-01), Ades
patent: 2003/0087674 (2003-05-01), Li et al.
patent: 2005/0039132 (2005-02-01), Germain et al.
patent: 2006/0215583 (2006-09-01), Castagnoli
Rhee et al “Distributed Scalable TDMA Scheduling Algorithm” Apr. 26, 2004.
Zhu et al. “A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks” Mar. 29, 1998.
“Characterizing Achievable Rates in Multi-hop Wireless Mesh Networks with Orthogonal Channels,” by Muralidharan S. Kodialam and Thyaga Nandagopal, IEEE/ACM Transactions on Networking, Aug. 2005, vol. 13, Issue 4, pp. 868-880.
“Characterizing Achievable Rates in Multi-hop Wireless Networks: The Joint Routing and Scheduling Problem,” by Muralidharan S. Kodialam and Thyaga Nandagopal, International Conference on Mobile Computing and Networking Proceedings of the 9thAnnual International Conference on Mobile Computing And Networking, Sep. 14-19, 2003, San Diego, CA, USA, ISBN: 1-58113-753-2, pp. 42-54.
Kodialam Muralidharan S.
Nandagopal Thyagarajan
Alcatel-Lucent USA Inc.
Mendelsohn, Drucker & Associates P.C.
Morlan Robert M
Ton Dang T
LandOfFree
Characterizing achievable flow rates in multi-hop mesh... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Characterizing achievable flow rates in multi-hop mesh..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Characterizing achievable flow rates in multi-hop mesh... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4227358