Ad Hoc Network Routing via Intersection Selection

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing routing protocols in ad hoc networks, such as GSR and A-STAR, face issues with high packet loss rates and bandwidth inefficiency due to reliance on static geographical information and computation-intensive path calculations, which are not suitable for dynamic urban environments with varying traffic conditions.

Innovation Solution

A routing method that progressively selects intermediate intersections based on real-time traffic conditions, using local routing information to minimize latency and packet loss by selecting nodes that are closer to the destination and moving in the right direction, thereby optimizing bandwidth usage and adapting to changing network topologies.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If complete routing paths are calculated using geographical information before sending packets, then routing decisions can be made, but packet loss rate increases and bandwidth efficiency decreases

Engineering Contradiction:

Improverouting decision capabilityVSAvoidpacket loss rate

Core Design Contradiction:

ReliabilityVSLoss of substance

Solution Approach 1:

The routing path is divided into segments where each node independently selects the next hop based on local traffic conditions rather than calculating the complete path in advance. This segmentation allows adaptive routing decisions at each node based on real-time conditions, reducing packet loss while maintaining routing capability.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The routing protocol transitions from static pre-calculated paths to dynamic on-demand path selection. Each node dynamically determines the optimal next hop based on current traffic conditions, enabling the routing to adapt to changing network topology and traffic patterns, thereby reducing packet loss and improving bandwidth efficiency.

Inventive Principle:

Principle #15Dynamics

2Reliability

If complete routing paths are calculated using geographical information, then routing can be established, but computation resources are consumed and latency increases

Engineering Contradiction:

Improverouting path determinationVSAvoidlatency

Core Design Contradiction:

ReliabilityVSLoss of time

Solution Approach 1:

Nodes maintain preliminary routing information and traffic condition data in advance, but the actual path calculation is performed only when needed and locally at each node rather than globally in advance. This preliminary preparation reduces computation time during packet transmission while ensuring reliable routing decisions.

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

Each node performs routing calculations locally based on its own traffic conditions and nearby node information rather than requiring global geographical data processing. This local quality approach significantly reduces computation resources and latency while maintaining effective routing path determination.

Inventive Principle:

Principle #3Local quality

3Ease of operation

If routing is based on static geographical information, then routing protocols can operate, but adaptability to changing traffic conditions is poor

Engineering Contradiction:

Improverouting protocol operationVSAvoidadaptability to traffic conditions

Core Design Contradiction:

Ease of operationVSAdaptability or versatility

Solution Approach 1:

The routing protocol changes from using static geographical parameters to using dynamic traffic condition parameters. Each node monitors current traffic conditions and uses these changing parameters to determine optimal routing paths, enabling the system to adapt to varying traffic patterns while maintaining ease of operation through localized decision-making.

Inventive Principle:

Principle #35Parameter changes

Data Source

PatentUS8270347B2Process for routing data packets in a mobile node network and associated terminal

Publication Date: 2012.09.18 ORANGE SA

AI summary

A method of routing data packets (P) between a source node (S) and a target node (C) in an ad hoc network comprising mobile nodes (1-14) that can be located and moving on traffic routes (L1, L2, L3, C1, C2, C3) of a particular geographical network (10) forming between them a plurality of intersections (I1-I6). This method comprises a destination intersection selection step in which a carrier node (S) of the packets (P) selects a destination intersection (12) from neighbor intersections and according to traffic conditions; a step of seeking one or more neighbor mobile nodes (1) of the packet carrier node nearer the selected destination intersection (12) than the carrier node; and, if one or more neighbor mobile nodes (1) are found, a step of transferring the packets (P) from the packet carrier node (S) to the neighbor node (1) that has been found, so as to route the data packets to the selected destination intersection.