Wai O ChenCoram, NY

7720026, May 18, 2010

Jan 11, 2006

11/329527

Wai Chen - Parsippany NJ, US
Marcus Pang - Manalapan NJ, US
Toshiro Hikita - Fort Lee NJ, US
John Lee - Howell NJ, US
Shengwei Cai - Florham Park NJ, US

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

H04W 4/00

370328, 370331, 4554042, 455446

A method for organizing and maintaining an ad-hoc network for communication between a plurality of moving devices is disclosed. The method comprises the steps of grouping the plurality of moving devices into at least one local peer group (LPG), ordering the plurality of devices within each LPG based upon a relative position of each of the plurality of devices within each LPG and assigning a unique identifier for each of the plurality of moving devices, where the unique identifier is based, in part on the LPG that the corresponding moving device is located.

7764635, Jul 27, 2010

Apr 26, 2005

11/114846

Wai Chen - Parsippany NJ, US
Latha Kant - Basking Ridge NJ, US
Christopher Sadler - Princeton NJ, US

Telcordia Technologies, Inc. - Piscataway NJ

H04B 7/00

3703102, 370328, 370329, 370338, 370315, 455 412, 455445, 455450

Disclosed is a method and apparatus for improved self-healing in a mobile ad-hoc wireless network in which network communication functions are divided into a plurality of functional layers. The system utilizes cross-layer self-healing techniques. Network data from at least one of the functional layers is stored, for example in a storage unit of the network node. The stored network data is then used to modify the functioning of at least one of the other layers. In one embodiment, a management module manages the storage and use of the network data. In particular embodiments, the stored network data relates to successful transmission rates and/or clear channel rates, and this stored data is used to adjust the transmission power of the network node. In another embodiment, the stored data may be used to generate a table of interchangeable network nodes, which may then be used to reroute a data packet to a network node other than an originally specified destination node. In yet another embodiment, the stored data may be used to generate a list of recent neighbor nodes, which data may be used to reroute data packets to intermediate network nodes.

7848278, Dec 7, 2010

Oct 23, 2006

11/584979

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

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

H04B 7/00
H04W 4/00

370328, 370338, 455517, 455518, 455519

An ad-hoc wireless network with a roadside network unit (RSU) and a local peer group (LPG). The LPG is formed from a plurality of moving vehicles. The LPG includes a group header node (GH) for managing the LPG. The GH is elected from one of the moving vehicles. The LPG further includes group nodes (GN) designated from the remaining moving vehicles in a given area. Each of the moving vehicles, whether the GH or the GN, communicates with other using routing paths created based upon a first control packet broadcast from the GH and a second control packet broadcast from each of the GN. Each moving vehicle communicates with the RSU using a routing paths created based upon a beacon broadcast by the RSU and a reply signal from each of the moving vehicles. The RSU can also be a member of the LPG and act as GN or GH.

7889691, Feb 15, 2011

Nov 13, 2007

11/983829

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

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

H04J 3/08
H04L 12/56

370315, 370252, 370278, 370329, 370401

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.

8068463, Nov 29, 2011

Jul 23, 2008

12/178338

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

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

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

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

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.

8068491, Nov 29, 2011

Feb 13, 2008

12/069815

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

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

H04L 12/28
H04J 3/26

370390, 370432

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.

8106792, Jan 31, 2012

Jul 10, 2009

12/500685

Wai Chen - Parsippany NJ, US
Ryokichi Onishi - Kanagawa, JP
Rama Vuyyuru - Somerset NJ, US

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

G08G 1/09

340905, 340901, 340902

A method of controlling a wireless communication device that is installed in a moving vehicle. The method comprises receiving roadway topology information and vehicle traffic pattern information, receiving vehicle and wireless communication device performance information from a plurality of other moving vehicles, determining current position information for the moving vehicle; determining a first set of metrics for a performance of the wireless communication device installed in the moving vehicle, estimating at least one second metric related to the performance of the wireless communication device or an ad-hoc network which includes each wireless communication device and changing an operation or routing parameter for the wireless communication device based upon the estimation. The second metric is based upon at least a sub-set of the first set of metrics, the received information and the determined current position information for the moving vehicle.

8116269, Feb 14, 2012

May 8, 2007

11/800849

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
Toyota Infotechnology Center, U.S.A., Inc. - Palo Alto CA

H04W 4/00

370329, 455450

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.