Ryokichi Onishi

US Patent:

7889691, Feb 15, 2011

Filed:

Nov 13, 2007

Appl. No.:

11/983829

Inventors:

Wai Chen - Parsippany NJ, US
Stephanie Demers - Westfield NJ, US
John Lee - Howell NJ, US
Marcus Pang - Manalapan NJ, US
Ryokichi Onishi - Jersey City NJ, US
Toshiro Hikita - Tama, JP

Assignee:

Telcordia Technologies, Inc. - Piscataway NJ
Toyota Infotechnology Center, U.S.A., Inc. - Palo Alto CA

International Classification:

H04J 3/08
H04L 12/56

US Classification:

370315, 370252, 370278, 370329, 370401

Abstract:

A method for distributing a packet to a plurality of moving nodes comprising receiving a packet containing at least a message, a sender identifier, a location of a sender, an identifier for a relay node and distance from the sender and the relay node, determining if a node receiving the packet is the relay node and immediately distributing the packet to a plurality of moving nodes if the receiving node is the relay node. If the receiving node is not the relay node, the method further comprises steps of waiting a set period of time, determining if a packet is received from a different sender containing the same message, within the period of time and distributing the packet to a plurality of moving nodes if a packet containing the same message is not received within the period of time. The distributed packet includes an identifier for a successive relay node.

US Patent:

8068463, Nov 29, 2011

Filed:

Jul 23, 2008

Appl. No.:

12/178338

Inventors:

Wai Chen - Parsippany NJ, US
John Lee - Howell NJ, US
Ratul K. Guha - Princeton NJ, US
Ryokichi Onishi - Jersey City NJ, US
Rama Vuyyuru - Somerset NJ, US

Assignee:

Telcordia Technologies, Inc. - Piscataway NJ
Toyota Infotechnology Center, U.S.A., Inc. - Palo Alto CA

International Classification:

H04W 4/00
H04L 12/28
H04L 12/56
H04B 7/00
G06F 15/16

US Classification:

370334, 370338, 370394, 455 412, 709228, 709236

Abstract:

The present invention offers systems and methods for effective multiple-hop routing, multicasting and media access control for vehicle group communications that employ directional wireless radio technology. Multi-beam optic-wireless media and streamlined operations provide low-overhead communications among vehicles. Systems and methods are provided to maintain a quasi-stationary group of neighboring vehicles, enable high-throughput on-demand switching among multiple vehicles, enable group coding in the vehicle group to achieve higher throughput, and enable dynamic adjustment of link to maintain desirable vehicle group. The proposed solution builds upon the conception of a MAC-free wireless operation and quasi-stationary vehicular switched network to achieve ultra-low-overhead and high-throughput vehicle communications.

US Patent:

8068491, Nov 29, 2011

Filed:

Feb 13, 2008

Appl. No.:

12/069815

Inventors:

Wai Chen - Parsippany NJ, US
John Lee - Howell NJ, US
Ryokichi Onishi - Jersey City NJ, US
Toshiro Hikin - Tama, JP

Assignee:

Telcordia Technologies, Inc. - Piscataway NJ
Toyota Infotechnology Center, U.S.A., Inc. - Palo Alto CA

International Classification:

H04L 12/28
H04J 3/26

US Classification:

370390, 370432

Abstract:

A method for routing a multicast message comprising the steps of receiving a multicast message including at least a message, a source identifier, a sequence number, a time-to-live value and a multicast group destination, determining if the multicast group destination is in a multicast forwarding table, determining if the message has been previously received, adding the multicast message to the multicast forwarding table if it is determined that the multicast message has not been previously received, determining if a node that received the multicast message is a forwarding node; randomly setting a wait time for forwarding the multicast message; and forwarding the multicast message at the expiration of the wait time.

US Patent:

8116269, Feb 14, 2012

Filed:

May 8, 2007

Appl. No.:

11/800849

Inventors:

Hanan Luss - Marlboro NJ, US
Wai Chen - Parsippany NJ, US
Toshiro Hikita - Yokohama, JP
Ryokichi Onishi - Jersey City NJ, US

Assignee:

Telcordia Technologies, Inc. - Piscataway NJ
Toyota Infotechnology Center, U.S.A., Inc. - Palo Alto CA

International Classification:

H04W 4/00

US Classification:

370329, 455450

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.

US Patent:

8160078, Apr 17, 2012

Filed:

May 15, 2008

Appl. No.:

12/120690

Inventors:

Wai Chen - Parsippany NJ, US
Marcus Pang - Manalapan NJ, US
Taek Jin Kwon - Morganville NJ, US
Ryokichi Onishi - Jersey City NJ, US
Toshiro Hikita - Tama, JP

Assignee:

Telcordia Technologies, Inc. - Piscataway NJ
Toyota Infotechnology Center, U.S.A., Inc. - Palo Alto CA

International Classification:

H04L 12/28
H04L 12/50

US Classification:

370400, 370351, 370367, 370401

Abstract:

An on-demand method of routing data between a plurality of local peer groups (LPG). Each LPG includes a plurality of moving nodes. The method comprises transmitting a route request message from a source node, relaying the route request message to a native boundary node; forwarding the route request message to a foreign boundary node, determining if the destination node is within an LPG for the foreign boundary node; relaying the route request message to another boundary node if the destination node is not within the LPG, relaying the route request message to the destination node if the destination node is within the LPG, receiving the routing request message at the destination node, transmitting a routing response to the source node, relaying the routing response to the source node through a path discovered by the route request, receiving the routing response at the source node, and transmitting the data, upon receipt of the routing response.

US Patent:

8295257, Oct 23, 2012

Filed:

Mar 13, 2009

Appl. No.:

12/403571

Inventors:

Wai Chen - Parsippany NJ, US
Rama Vuyyuru - Somerset NJ, US
Ryokichi Onishi - Jersey City NJ, US

Assignee:

Telcordia Technologies, Inc. - Piscataway NJ
Toyota Infotechnology Center, U.S.A, Inc. - Palo Alto CA

International Classification:

H04J 3/16

US Classification:

370338

Abstract:

A method for transmitting data in vehicular network comprising determining a communication window between at least two nodes, grouping a plurality of fragments of content together into an aggregate fragment block, forwarding the aggregate fragment block to a target node and assembling the plurality of fragments into the content. The content is divided into the plurality of fragments. A fragment signature is generated for the fragments that contain fragment index information regarding each fragment. Each fragment is unambiguously identified by its signature. A number of fragments grouped into the aggregate fragment block is dependent on the communication window.

US Patent:

8351417, Jan 8, 2013

Filed:

May 14, 2008

Appl. No.:

12/120330

Inventors:

Wai Chen - Parsippany NJ, US
Taek Jin Kwon - Morganville NJ, US
John Lee - Howell NJ, US
Ryokichi Onishi - Jersey City NJ, US
Toshiro Hikita - Tama, JP

Assignee:

Telcordia Technologies, Inc. - Piscataway NJ
Toyota InfoTechnology Center, U.S.A., Inc. - Palo Alto CA

International Classification:

H04L 12/28

US Classification:

370351, 370217, 370389, 370474, 455 16

Abstract:

The present invention provides methods for efficient control message distribution in a VANET. Efficient flooding mechanisms are provided to fulfill the objective of flooding (delivering a message to every connected node) with a limited number of re-broadcasting by selected key nodes. A suppression-based efficient flooding mechanism utilizes a Light Suppression (LS) technique to reduce the number of flooding relays by giving up the broadcasting of a flooding message when a node observes downstream relay of the same flooding message. Additionally, a relay-node based efficient flooding mechanism selects Relay Nodes (RN) to form an efficient flooding tree for control message delivery. RNs are nodes that relay at least one control message, for instance a Membership Report (MR) to the upstream node in “k” previous control message cycles The upstream node may be the group header (GH) for the LPG.

US Patent:

8520673, Aug 27, 2013

Filed:

Oct 23, 2006

Appl. No.:

11/585047

Inventors:

Wai Chen - Parsippany NJ, US
Toshiro Hikita - Fort Lee NJ, US
Ryokichi Onishi - Jersey City NJ, US
John Lee - Howell NJ, US

Assignee:

Telcordia Technologies, Inc. - Piscataway NJ
Toyota Infotechnology Center, U.S.A., Inc. - Palo Alto CA

International Classification:

H04L 12/28

US Classification:

370390, 370312

Abstract:

A method and communication device for routing unicast and multicast messages. The method for routing a unicast message includes receiving a first control packet including routing parameters from a group header node, updating a routing table based upon the routing parameters, receiving a second control packet including additional routing parameters from a group node, updating the routing table based upon the additional routing parameters and generating a forwarding table from the routing table when both of the updated steps are completed. The unicast message is routed based upon the forwarding table. A method for routing a multicast message comprises receiving the multicast message, determining if a multicast group destination for the multicast message is in a multicast forwarding table (MFT), determining if the multicast message has been previously forwarded and forwarding the multicast message if the message was not previously forwarded and the multicast group destination is in the MFT.