Telcordia Technologies, Inc.

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

Other

Kddi Corporation

John Lee

Wai Chen

Ratul Kumar Guha

Rama K Vuyyuru

Ryokichi Onishi

Toshiro Hikita

Junichiro Fukuyama

Marcus Pang

Taek-Jin Kwon

Jasmine Chennikara-Varghese

Kirk K Chang

Yibei Ling

Sunil Samtani

Shengwei Cai

Harshad Tanna

John Sucec

Tsunehiko Chiba

Ashutosh Dutta

Subir Das

Joe Lin

Akira Idoue

Abhrajit Ghosh

Stephanie Demers

Hidetoshi Yokota

Kyriakos Manousakis

Taek Jin Kwon

Toshiro Hikito

Toshiro Hikin

Rama Vuyyuru

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

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.

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.

Systems and methods for multi-beam optic-wireless vehicle communications

The present invention advantageously provides several systems and methods for solving the trombone routing issues within an IMS/MMD network. These approaches avoid trombone routing, speed up handoff, and increase the efficiency of signaling and overall performance of an IMS/MMD network. These solutions can broadly be divided into the following categories. Piggy-backing SIP registration over MIP (Split at FA); Selective Reverse Tunneling and Tunneling between FA and P-CSCF; the SIP-based mobility protocol; use of CoA during SIP registration and call up in MIPv6; Piggy-backing SIP registration when HA and S-CSCF Co-exist; Using Dynamic Home Agents in MIPv4 FA-CoA; and the Interceptor-Caching Approach.

Methods of mitigation of trombone routing in an IMS/MMD network

Establishing and maintaining a moving ad-hoc network is provided. The ad-hoc network includes a plurality of equivalent cells communicationally linked together to form a linked equivalent cell network. An equivalent cell header manages each equivalent cell. Additionally, regular nodes, scattered throughout the equivalent cell network, may be provided. Regular nodes have restricted communication privileges compared to the equivalent cell headers. However, equivalent cell headers can be demoted to regular nodes and regular nodes can be promoted to equivalent cell headers as required by equivalent cell network.

Linked equivalent cell header-based approach and protocol for organizing an ad-hoc network

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.

Method and communication device for routing unicast and multicast messages in an ad-hoc wireless network

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.

Methods for efficient organization of vehicle peer groups and efficient V2R communications

Without using additional probing packets, estimates of the narrow link bandwidth and available bandwidth of a network path are computed based on existing traffic. The network can be of different types such as a wireless battlefield network context or a wired or wireless commercial network environment. 'Fast packets', i.e. those packets which do not experience any queuing delay in the network, are identified. Fast packets are identified to resolve end-to-end packet delay into its constituent components (deterministic, transmission and queuing delays), estimate path utilization and eliminate the uncertainty (false alarms) that causes the prior art method to lose its effectiveness. An estimation algorithm computes end-to-end transmission delay and end-to-end deterministic delay of fast packets traveling along a path in a network. Examples of deterministic delay include satellite propagation delays and clock effects. Then, based on the results of the fast packet identifying algorithm, two logic branches are followed. A first branch calculates utilization and a second branch calculates narrow link bandwidth. The narrow link bandwidth is determined from the packet pair dispersion. The available bandwidth is obtained from the narrow link bandwidth and the utilization. Estimation of available bandwidth for an end-to-end network path allows traffic sources to judiciously regulate the volume of application traffic injected into the network.

Growing community of inventors

Howell, NJ, United States of America

John Lee