Telcordia Technologies, Inc.

Toyota Infotechnology Center, U.s.a., Inc.

Toyota Motor Corporation

Tti Inventions D LLC

Telcordia Licensing Company, LLC

Toyota Infotechnology Center Co. Ltd.

Wai Chen

John Lee

Ryokichi Onishi

Ratul Kumar Guha

Rama K Vuyyuru

Toshiro Hikita

Marcus Pang

Jasmine Chennikara-Varghese

Yibei Ling

Onur Altintas

Taek-Jin Kwon

Shengwei Cai

Junichiro Fukuyama

Yoshihisa Suwa

Ashutosh Dutta

Stephanie Demers

Taek Jin Kwon

Sunil H Madhani

Chung-Min Chen

Jasmine Chennikara

Rama Vuyyuru

Hanan Luss

Harshad Tanna

Latha Kant

Chiao-Wei Lee

Toshiro Hikito

Russell Hsing

Paul Li-Ching Yu

Toshiro Hikin

Christopher Sadler

Toshihiro Hikita

Seii Sai

An open communication method between at least two sub-networks using a broker node. Each of the sub-networks has a different routable network addressing scheme. The method comprises receiving a packet for a specific application, the packet includes an application identifier, determining if the packet is to be relayed to another of the at least two sub-network based upon the application identifier, determining if a node receiving the packet is a broker node, relaying the packet to a broker node if not a broker node and forwarding, by the broker node, the packet to at least one node in another of the at least two sub-network. The node generating the packet is configured to communicate using a first of the at least two sub-networks. A broker node is configured for communicating using at least two of the at least two sub-network via a corresponding routable network addressing schemes for each of the sub-networks.

Open communication method in a heterogeneous network

A multiple hop communications method among a plurality of moving vehicles. Each moving vehicles has a plurality of unidirectional radio. The method comprises receiving an incoming packet at one of the plurality of unidirectional radios, determining if there is an active link between each of the plurality of unidirectional radios and an unidirectional radio of a neighbor vehicle, relaying the incoming packet to the plurality of unidirectional radios having an active link and transmitting the incoming packet as an outgoing packet from at least one of the plurality of unidirectional radios. If more than one packet is received, the packets can be encoded using group coding before send the packets out as an outgoing packet.

Switched link-based vehicular network architecture and method

Network architecture configured for open communication between a plurality of sub-networks. Each of the plurality of sub-networks has a different routable network addressing scheme. The architecture includes at least one broker node adapted to communicate using at least two different routable network addressing schemes. The broker node comprises an identification management module configured to collect peer-application addresses for nodes currently accessing a specific application, the peer-application addresses being associated with a specific application, an address resolution module configured to map each of the peer-application addresses to a sub-network specific routable network address and a network coordination module configured to monitor and coordinate sub-network communication capabilities between the broker node and at least one other broker node and elect a primary broker node for each sub-network which the broker node and at least one other broker node is capable of communication.

Architecture for open communication in a heterogeneous network

An on-demand method of routing data between a plurality of local peer groups (LPG) of plural moving nodes 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.

Inter-local peer group (LPG) routing method

A method, simulator and program for simulating vehicular movement based upon user input parameters related to simulation topology and simulation vehicles including, but not limited to linear vehicular density. The simulator generates the simulation topology having a simulation area using the user input parameters, places a plurality of simulation vehicles within the simulation area at an initial placement using at least two input parameters related to simulation vehicle and the generated simulation topology; and determines movement of the plurality of simulation vehicles starting with the initial placement using a plurality of movement models. Each of the plurality of simulation vehicles has mobility characteristics generated using the plurality of movement models. When vehicle moves outside the simulation area, the vehicle re-emerges at a location within the simulation area. The vehicle re-emerges with new movement characteristics.

Architecture, method, and program for generating realistic vehicular mobility patterns

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.

Methods for reliable multicasting in local peer group (LPG) based vehicle ad hoc networks

An open communication method between at least two sub-networks using a broker node. Each of the sub-networks has a different routable network addressing scheme. The method comprises receiving a packet for a specific application, the packet includes an application identifier, determining if the packet is to be relayed to another of the at least two sub-networks based upon the application identifier, determining if a node receiving the packet is a broker node, relaying the packet to a broker node if not a broker node and forwarding, by the broker node, the packet to at least one node in another of the at least two sub-networks. The node generating the packet communicates using a first of the at least two sub-networks. A broker node communicates using at least two of the at least two sub-networks via a corresponding routable network addressing schemes for each of the sub-networks.

An inventive method for data delivery in a multi-hop vehicular network with multiple vehicles and intersections is presented. The method comprises, at each source vehicle, initiating packet flow, labeling packets with destination coordinates and a current location, and forwarding the packet flow, and at each intersection, selecting a header vehicle, computing a backlog indicator and listening for broadcasts with a matrix and delay information, updating the matrix in accordance with the backlog indicator if the matrix is present, otherwise initializing the matrix, forwarding the packet flow, and broadcasting the matrix from the header vehicle. In one embodiment, selection of the header vehicle is performed based on random countdown and vehicle ID. The method converges to the optimal (lowest latency) state irrespective of the initial starting point of the network and continues to tend towards the optimal state even as the network conditions alter.

Distributed method for minimum delay multi-hop data delivery in vehicular networks

A method for maintaining a local peer group (LPG) for supporting communications among vehicles. The LPG is formed from a plurality of vehicles. Each vehicle is equipped with a wireless communications device. One of the vehicles is selected as a group header node (GH). The method comprises receiving periodically a heartbeat packet from the GH, the heartbeat packet including a maximum hop count, and a heartbeat cycle, forwarding the heartbeat packet until the maximum hop count is reached after waiting for a first random relay delay, which is less than a maximum allowable adjustable value, replying to the heartbeat packet with a membership report packet, forwarding a membership report packet towards the GH, and adding a vehicle that submitted the membership report packet to a LPG membership as a member node of the LPG if the membership report packet is new or updating information for a member node.

Program and method for adaptively maintaining a local peer group in a dynamic environment

The present invention relates to the reduction of handoff delays for mobile telematics applications. In particular, the present invention provides a method employing GPS technology to define IP addresses in a mobile environment in order to reduce delays and transient data loss caused by handoff from one network to another.

Fast handoff using GPS technology for mobile telematics

A method for determining a transmission channel for multi-hop transmission of a data packet from a plurality of data channels in an ad-hoc network. The network includes at least one local peer group. Each local peer group has a plurality of moving vehicles as nodes. The method comprises steps of determining available channels for data packet transmission at each node, transmitting a first list of available channels to at least one other node, receiving, from the at least one other node, a second list of available channel for the at least one other node, creating an available channel table including the first and second lists of available channels, selecting a transmitting channel for a data packet based upon information in the available channel table, and advertising the selected channel to the at least one other node.

Method for determining transmission channels for a LPG based vehicle communication network

Disclosed is an improved proactive location based routing protocol for ad-hoc wireless networks. When a source node has a data packet to send to a destination node, the source node calculates an estimated future location of the destination node prior to forwarding a data packet to the destination node. The estimated future location may be based on the last known location, velocity and bearing of the destination node, as well as upon the estimated propagation delay (i.e., the estimated time it will take the data packet to reach the destination node after being transmitted by the source node). The source node routes the data packet by identifying which one of a plurality of its neighbor nodes is closest to the estimated future location of the destination node, and routes the data packet the identified neighbor node as an intermediate node along the route from the source node to the destination node. Further, the frequency of flooding broadcasts is based on the velocity of the network nodes. As the velocity of a network node increases, the rate at which the node broadcasts its location and mobility data also increases. The broadcast frequency of a network node may be dynamically adjusted as its velocity changes.

Proactive location based routing in a wireless ad-hoc network

A method for distributed traffic navigation in a vehicular network is presented. At each vehicle entering the network, information associated with the vehicular network is acquired and stored, and destination addresses are broadcasted as route requests. At each vehicle in the network, the stored information is updated through vehicle to vehicle communication. At each junction, a header vehicle is selected for listening for broadcasts to determine the presence of a matrix. If the matrix is not present, the matrix is initialized based on the stored information of the header vehicle. The header vehicle further estimates travel time on the road segments based on the matrix, calculates a backlog indicator based on the segment travel time and the route requests. The header vehicle further updates the matrix and generates a route based on the matrix. The matrix is broadcasted from the header vehicle.

Distributed traffic navigation using vehicular communication

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.

Growing community of inventors

Parsippany, NJ, United States of America

Wai Chen