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

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 of tailoring data streams transmitted to networked user devices is disclosed in which environment information associated with each device is stored at an agent located on those devices. This environment information may include information related to the hardware, interface and application capabilities of the particular device. In another embodiment, this environment information is transmitted and stored at an agent at a local network gateway. And in another embodiment, the environment information is then stored at a mirror agent located in a backbone network of a service provider. By referring to this environment information, a service provider can tailor the transmission of data streams, such as multimedia streams, to a device based on the capabilities of the device and the associated network.

Abstract: A method for transmitting data in vehicular network comprising determining a communication window between at least two nodes, grouping a plurality of fragments of content together into an aggregate fragment block, forwarding the aggregate fragment block to a target node and assembling the plurality of fragments into the content. The content is divided into the plurality of fragments. A fragment signature is generated for the fragments that contain fragment index information regarding each fragment. Each fragment is unambiguously identified by its signature. A number of fragments grouped into the aggregate fragment block is dependent on the communication window.

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: 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: A method for high rate data delivery in a multi-hop vehicular network comprises at each source vehicle, initiating a packet having a flow tag, assigning an identifier of the content and the current location to the flow tag, and forwarding the packet; at each destination vehicle, setting a flow request and broadcasting at the current intersection; further on movement, setting the flow request at the new intersection, and at each intersection, selecting a header vehicle at the intersection, computing backlog and congestion indicators and listening for broadcasts with a matrix and the flow requests at the header vehicle, determining if the matrix is present, updating the matrix in accordance with the backlog and congestion indicators if the matrix is present, initializing the matrix and estimating the delay on the outgoing road segments if the matrix is not present, forwarding the packet flow, and broadcasting the matrix from the header vehicle.

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 of controlling a wireless communication device that is installed in a moving vehicle. The method comprises receiving roadway topology information and vehicle traffic pattern information, receiving vehicle and wireless communication device performance information from a plurality of other moving vehicles, determining current position information for the moving vehicle; determining a first set of metrics for a performance of the wireless communication device installed in the moving vehicle, estimating at least one second metric related to the performance of the wireless communication device or an ad-hoc network which includes each wireless communication device and changing an operation or routing parameter for the wireless communication device based upon the estimation. The second metric is based upon at least a sub-set of the first set of metrics, the received information and the determined current position information for the moving vehicle.

Abstract: A method of controlling a wireless communication device that is installed in a moving vehicle. The method comprises receiving roadway topology information and vehicle traffic pattern information, receiving vehicle and wireless communication device performance information from a plurality of other moving vehicles, determining current position information for the moving vehicle; determining a first set of metrics for a performance of the wireless communication device installed in the moving vehicle, estimating at least one second metric related to the performance of the wireless communication device or an ad-hoc network which includes each wireless communication device and changing an operation or routing parameter for the wireless communication device based upon the estimation. The second metric is based upon at least a sub-set of the first set of metrics, the received information and the determined current position information for the moving vehicle.

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 transmitting data in vehicular network comprising determining a communication window between at least two nodes, grouping a plurality of fragments of content together into an aggregate fragment block, forwarding the aggregate fragment block to a target node and assembling the plurality of fragments into the content. The content is divided into the plurality of fragments. A fragment signature is generated for the fragments that contain fragment index information regarding each fragment. Each fragment is unambiguously identified by its signature. A number of fragments grouped into the aggregate fragment block is dependent on the communication window.

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: A method for high rate data delivery in a multi-hop vehicular network comprises at each source vehicle, initiating a packet having a flow tag, assigning an identifier of the content and the current location to the flow tag, and forwarding the packet; at each destination vehicle, setting a flow request and broadcasting at the current intersection; further on movement, setting the flow request at the new intersection, and at each intersection, selecting a header vehicle at the intersection, computing backlog and congestion indicators and listening for broadcasts with a matrix and the flow requests at the header vehicle, determining if the matrix is present, updating the matrix in accordance with the backlog and congestion indicators if the matrix is present, initializing the matrix and estimating the delay on the outgoing road segments if the matrix is not present, forwarding the packet flow, and broadcasting the matrix from the header vehicle.

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

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