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

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

Abstract: A method for maintaining a local peer group (LPG) for supporting communications among vehicles. The LPG is formed from a plurality of vehicles. Each vehicle is equipped with a wireless communications device. One of the vehicles is selected as a group header node (GH). The method comprises receiving periodically a heartbeat packet from the GH, the heartbeat packet including a maximum hop count, and a heartbeat cycle, forwarding the heartbeat packet until the maximum hop count is reached after waiting for a first random relay delay, which is less than a maximum allowable adjustable value, replying to the heartbeat packet with a membership report packet, forwarding a membership report packet towards the GH, and adding a vehicle that submitted the membership report packet to a LPG membership as a member node of the LPG if the membership report packet is new or updating information for a member node.

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

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

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

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

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

Abstract: A method and system for determining a size of a local peer group (LPG) network in a dynamic roadway (mobile) environment is provided. In one embodiment, the method comprises measuring a roundtrip time between a first node and a second node, and utilizing the measured roundtrip time to select the size of the local peer group network from a lookup table. In another embodiment, the method comprises determining when the roundtrip time exceeds a time interval of the heartbeat signal, and when the roundtrip time exceeds the time interval of the heartbeat signal adjusting the size of the local peer group network.

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: 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: A communications path is established among an ordered sequence of moving nodes, representing vehicles. Available channels may differ from one node to the next node and a node cannot use the same channel for both receiving and transmitting information. Three methods are described that provide an optimal sequence of channel assignments between the nodes. A sequence of channel assignments is called optimal if it establishes a communications path from the first node in the sequence to the last node in the sequence, or, if such a path does not exist, from the first node to the farthest node possible in the sequence. The first method uses a depth-first search starting from the first node in the sequence. The second method uses a “look ahead” scheme in the depth-first search method. The third method requires only a single pass through the sequence of nodes by identifying optimal channel assignments in subsequences of nodes without a need for backtracking.

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