| Patent application number | Description | Published |
|---|
| 20090122738 | Method of broadcasting packets in ad-hoc network - 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. | 05-14-2009 |
| 20090201928 | Methods for reliable multicasting in local peer group (LPG) based vehicle ad hoc networks - 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. | 08-13-2009 |
| 20090285197 | METHODS FOR EFFICIENT ORGANIZATION OF VEHICLE PEER GROUPS AND EFFICIENT V2R COMMUNICATIONS - 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. | 11-19-2009 |
| 20090310608 | Systems and Methods for Multi-Beam Optic-Wireless Vehicle Communications - 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. | 12-17-2009 |
| 20100220629 | Estimating Available Bandwidth And Enhancing Narrow Link Bandwidth Estimations In Telecommunications Networks Using Existing User Traffic - 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. | 09-02-2010 |
| 20110227757 | METHODS FOR CONTEXT DRIVEN DISRUPTION TOLERANT VEHICULAR NETWORKING IN DYNAMIC ROADWAY ENVIRONMENTS - A method and apparatus for optimizing communication of data within a disruption tolerant network. The method comprises of receiving a data packet, said data packet including a context and a state related to said context, storing the data packet to a buffer and disseminating the data packet to neighboring vehicles and RSU, and passing said state to an application, said application associated with said application context. In one embodiment, the method functions as a software protocol within a dashboard computer. The apparatus comprises a processor and a memory operable to receive a data packet, said data packet including a context and a state related to said context, store the data packet to a buffer when the context matches an application context, disseminating the data packet to neighboring vehicles and RSU, and pass said state to an application when the context matches an application context, said application associated with said application context. In one embodiment, the apparatus is presented as a dashboard computer within a vehicle. | 09-22-2011 |
| 20120039235 | METHODS FOR RELIABLE MULTICASTING IN LOCAL PEER GROUP (LPG) BASED VEHICLE AD HOC NETWORKS - 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. | 02-16-2012 |
| 20120070804 | Architecture, Method, and Program for Generating Realistic Vehicular Mobility Patterns - 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. | 03-22-2012 |
