Ad-hoc Network Node Service Switching via Quality Classes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing routing algorithms for Vehicular Ad-hoc Networks (VANETs) are not suitable for providing satisfactory network-wide application service switching, as they do not effectively manage the dynamic nature and quality of services offered across highly mobile and changing network topographies.
Innovation Solution
A network node generates a local list of all application services offered by neighboring nodes, considering quality classes based on the number of successive nodes and connection quality, creating a recursive 'Local Available Service Table' (LAST) that provides a comprehensive overview of available services without central distribution or specific routing algorithms, and allows for automatic detection and initiation of service coverage areas.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If existing routing algorithms are used for VANETs, then network nodes can establish connections, but they cannot provide satisfactory network-wide application service switching due to the dynamic nature and quality management issues
Solution Approach 1:
The patent segments the service quality management into discrete quality classes (QEC 0-QEC 7) that can be independently evaluated and transmitted. Each network node maintains a separate LAST table that organizes service information by quality class, enabling granular service switching without managing all quality parameters centrally. This segmentation allows flexible service switching while keeping individual node complexity manageable.
Solution Approach 2:
The patent changes the parameter representation from detailed connection metrics to simplified quality class indicators. By transforming bandwidth, latency, and motion vectors into discrete quality classes (0-7), the system enables efficient service switching decisions while reducing the computational complexity of managing continuous quality parameters across the dynamic network.
2Loss of information
If a central distribution mechanism is used to manage service information, then complete service overview is achieved, but the system complexity and communication overhead increase significantly
Solution Approach 1:
Each network node autonomously generates and maintains its own LAST table by collecting service information from its immediate neighbors and recursively building the complete service overview. This self-service approach eliminates the need for central distribution mechanisms while ensuring each node has complete service information. Nodes independently perform service discovery, quality assessment, and table maintenance, reducing system complexity while preserving information completeness.
Solution Approach 2:
The LAST table construction uses a nested structure where each node's table is composed of its own service information plus the LAST tables of its neighboring nodes. This recursive nesting allows each node to build a complete network-wide service overview by combining local information with information from neighbors, achieving comprehensive service information without central coordination.
3Reliability
If detailed connection quality parameters are tracked for each service, then optimal service selection is enabled, but the data processing and storage requirements increase
Solution Approach 1:
The patent transforms multiple continuous connection quality parameters (bandwidth, latency, motion vectors) into discrete quality class values (0-7). This parameter transformation maintains the ability to assess and compare service quality accurately while dramatically reducing the data storage and processing requirements. Each service is represented by a compact quality class indicator rather than multiple detailed metrics.
Solution Approach 2:
The patent extracts the essential quality information from detailed connection parameters by identifying the dominant quality characteristics and representing them through quality classes. By taking out only the critical quality aspects needed for service selection and representing them in a compact form, the system maintains assessment accuracy while reducing data volume for storage and processing.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
The node has a set of network node units (N-0-N-9) provided with application services via wireless connections (2) e.g. wireless local area network (WLAN). The network node unit generates a list of all application services provided by other network node units. The list includes associated quality classes. The network node unit makes the list available to other network nodes units with the quality classes that are dependent on a number of consecutive network nodes with the application service. The quality class is specified by last of the network nodes. An independent claim is also included for a method for providing application services in an ad-hoc network having a set of network nodes providing one another with application services via a wireless connection.