VANET Bandwidth Bonding via Virtual Circuit Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Pure vehicle ad hoc networks (VANETs) face challenges such as excessive per-hop delay, large number of hops in communication, and lack of centralized infrastructure, making them inadequate for providing high-bandwidth services like HDTV streaming, and inefficient routing and MAC layer overheads lead to unsuitable performance for real-time applications.
Innovation Solution
The implementation of virtual circuit routing technology using distributed hash tables for IP address assignment and routing, combined with TDMA schemes for packet reservations, and a P2P MVNO business model to incentivize roadside merchants and residents to share bandwidth, along with orthogonal channel assignment for simultaneous V2V and V2R transmissions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Length of stationary object
If directional antennas are used to extend transmission range, then communication distance is improved, but per hop delay increases excessively
Solution Approach 1:
The patent segments the transmission range by introducing multiple relay nodes along the communication path. Instead of direct long-range transmission causing high delay, the data is transmitted through multiple shorter hops via relay nodes, reducing per-hop delay while maintaining overall transmission distance capability
Solution Approach 2:
The patent implements preliminary action through advance reservation of time slots and channels for relay nodes before actual data transmission occurs. This ensures that relay nodes are ready and channels are allocated in advance, minimizing waiting time and reducing per-hop delay when data needs to be transmitted
2Device complexity
If pure VANET architecture is used without centralized infrastructure, then network simplicity is improved, but routing efficiency and control capability deteriorate
Solution Approach 1:
The patent introduces virtual circuit identifiers as intermediaries to manage routing in pure VANET. These VCIDs act as mediators that simplify the routing process by creating virtual channels through relay nodes, enabling efficient packet forwarding without requiring complex centralized infrastructure
Solution Approach 2:
The patent implements self-service through distributed routing algorithms where each node autonomously determines the next hop based on pre-established virtual circuits and relay node information. This eliminates the need for centralized control while maintaining efficient routing through local decision-making at each node
3Reliability
If TDMA reservation scheme is implemented, then packet collision is reduced, but MAC layer overhead increases
Solution Approach 1:
The patent merges the TDMA reservation mechanism with virtual circuit establishment. The reservation process is combined with the virtual circuit setup, where time slots and channels are allocated together during VC establishment rather than separately for each packet, reducing redundant reservation overhead while maintaining collision avoidance
Solution Approach 2:
The patent ensures continuity of useful action by maintaining established virtual circuits and their associated time slot reservations across multiple packets. Once a virtual circuit is established with allocated resources, subsequent packets can continue transmission without repeating the full reservation process, reducing MAC layer overhead while maintaining reliable packet delivery
Data Source
AI summary
Peer to Peer Vehicle Ad Hoc Network is implemented with a distributed P2P model for means of a decentralized model to house data/applications and bonding technologies to reduce collisions, which is extremely high for the accepted VANET standard of 802.11p. The inventive technology provides virtualization of various heterogeneous networks into a single abstract layer of data network, fast soft and hard handoff among various data networks with different link layer characteristics within half RTT plus hardware switching time, a complete load balance of data traffics within and among data networks, optimization of data network resource such as available bandwidths (optimal distributions available resources among the users of networks) with the ability of multi-path unicast for each Internet session, utilization of shortest path algorithm for the adhoc access network routing.


