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 |
20090129323 | Method for determining transmission channels for a LPG based vehicle communication network - 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. | 05-21-2009 |
20090285213 | Inter-Local Peer Group (LPG) Routing Method - 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. | 11-19-2009 |
20110135299 | DIFFERENTIAL EYE DIAGRAMS - Changes in a signal are detected. The signal is repeatedly sampled in a synchronous manner during a predetermined interval to generate a captured eye diagram. At least one of a positive differential eye diagram or a negative differential eye diagram is generated from the captured eye diagram and a baseline eye diagram. The at least one positive or negative differential eye diagram is analyzed to determine whether a change in signal conditions is present. | 06-09-2011 |
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 |
20120197618 | ARCHITECTURE AND METHOD FOR REALISTIC VEHICULAR NETWORKING AND APPLICATIONS VISUALIZATION - A system and method for vehicular networking and applications visualization comprises selecting a simulation area, converting the selected simulation area to graph representation, eliminating streets outside the simulation area, generating, using the graph representation, vehicles and random vehicle traffic in the simulation area, calculating vehicle movement in coordinates, transforming the calculated coordinates into a format compatible with a general purpose communication networking simulation tool, simulating, using the transformed calculated coordinates and the general purpose communication networking simulation tool, an application, and performing visualization of the simulation. The application can be local traffic information, the vehicle movement and communication among the vehicles. The simulation can be at least 2000 seconds and communication can be disruption tolerant. The visualization of the simulation can comprise a global view of all vehicles and one or more local views, each local view of one vehicle. The simulation area can be selected from a geographic map. | 08-02-2012 |
20120201167 | Inter-Local Peer Group (LPG) Routing Method - 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. | 08-09-2012 |
20130011133 | DIFFERENTIAL EYE DIAGRAMS - Changes in a signal are detected. The signal is repeatedly sampled in a synchronous manner during a predetermined interval to generate a captured eye diagram. At least one of a positive differential eye diagram or a negative differential eye diagram is generated from the captured eye diagram and a baseline eye diagram. The at least one positive or negative differential eye diagram is analyzed to determine whether a change in signal conditions is present. | 01-10-2013 |