Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A method for establishing and maintaining the network and a corresponding ad-hoc moving-device to moving-device network having a plurality of moving-devices grouped into a Local Peer Group (LPG) is disclosed. A group header node (GH) is selected from the plurality of moving wireless devices in the LPG. The GH controls and manages the LPG by broadcasting a plurality of control messages, including a heartbeat message at a fixed interval. The LPG also includes at least one group node (GN). The at least one GN can communicate with the GH via a network link created between the at least one GN and the GH. The GNs join the LPG via the GH. If there is more then one GH in an LPG, header resolution occurs to select only one GH.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A plurality of servers for processing client requests forward the requests among themselves to achieve a balanced load. When a server initially receives a client request, it randomly selects another of the plurality of servers, referred to as a first-chance server, and forwards the request to this server. Upon receiving the request, the first-chance server determines if it is overloaded and if not, processes the request. However, if overloaded, the first-chance server compares its load to the load of one or more predetermined next-neighbor servers. If the next-neighbor server(s) are more loaded than the first-chance server, the first-chance server processes the request. Otherwise, the first-chance server forwards the request to the least loaded next-neighbor server. The next-neighbor receiving the request either processes it directly, or alternatively, based on its current load and that of its next-neighbor server(s), forwards the request to another next-neighbor server for processing.

Abstract: 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.

Abstract: 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.