The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Feb. 14, 2012
Filed:
May. 08, 2007
Hanan Luss, Marlboro, NJ (US);
Wai Chen, Parsippany, NJ (US);
Toshiro Hikita, Yokohama, JP;
Ryokichi Onishi, Jersey City, NJ (US);
Hanan Luss, Marlboro, NJ (US);
Wai Chen, Parsippany, NJ (US);
Toshiro Hikita, Yokohama, JP;
Ryokichi Onishi, Jersey City, NJ (US);
Telcordia Technologies, Inc., Piscataway, NJ (US);
Toyota Infotechnology Center, U.S.A., Inc., Palo Alto, CA (US);
Abstract
A communications path is established among an ordered sequence of moving nodes, representing vehicles. Available channels may differ from one node to the next node and a node cannot use the same channel for both receiving and transmitting information. Three methods are described that provide an optimal sequence of channel assignments between the nodes. A sequence of channel assignments is called optimal if it establishes a communications path from the first node in the sequence to the last node in the sequence, or, if such a path does not exist, from the first node to the farthest node possible in the sequence. The first method uses a depth-first search starting from the first node in the sequence. The second method uses a 'look ahead' scheme in the depth-first search method. The third method requires only a single pass through the sequence of nodes by identifying optimal channel assignments in subsequences of nodes without a need for backtracking.