Chaotic Routing Protocol for Wireless Mesh Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional routing protocols in wireless networks, such as wireless mesh networks, suffer from low data throughput due to link-level retransmissions, poor scalability, and inefficiency in handling small data payloads and time-sensitive data, especially in environments with highly lossy links and dynamic network sizes.
Innovation Solution
The implementation of Chaotic Routing, which uses random walk-based path metrics and opportunistic routing to schedule data transmissions based on information propagation values and wireless link qualities, allowing for efficient data forwarding through multiple paths without maintaining global information, thereby optimizing throughput and scalability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional routing protocols are used in wireless networks with highly lossy links, then routing decisions can be made using simple metrics, but data throughput is significantly reduced due to frequent link-level retransmissions
Solution Approach 1:
The patent changes the routing metric from traditional ETX (Expected Transmission Count) to a new metric that incorporates information propagation values. This parameter change allows the routing protocol to account for the probabilistic nature of opportunistic routing and the dynamic characteristics of wireless links, thereby improving data throughput in highly lossy environments without requiring excessive retransmissions
Solution Approach 2:
The patent implements feedback mechanisms where nodes continuously update their information propagation values based on observed link qualities and transmission outcomes. This feedback allows the routing protocol to adapt to changing network conditions and link reliability, optimizing throughput dynamically rather than relying on static routing tables
2Productivity
If global path information is maintained for routing decisions, then routing paths can be optimized, but scalability is reduced due to the complexity of maintaining and updating global information
Solution Approach 1:
The patent segments the global routing problem into local decision-making units. Instead of maintaining complete global path information, each node maintains local information propagation values that reflect its position and connectivity relative to destinations. This segmentation allows routing decisions to be made locally based on distributed information, improving scalability while maintaining routing efficiency
Solution Approach 2:
The patent enables nodes to make autonomous routing decisions based on locally maintained information propagation values. Each node independently calculates and updates its own routing metrics without requiring centralized control or global state maintenance, thereby reducing system complexity while preserving routing optimization capabilities
3Loss of energy
If large batch sizes are used for data transmission, then network overhead is reduced, but efficiency in handling small data payloads deteriorates
Solution Approach 1:
The patent implements dynamic batch sizing that adapts to the characteristics of the data payload and network conditions. Rather than using fixed large batch sizes, the protocol adjusts batch parameters dynamically based on payload size, link quality, and destination requirements, thereby reducing overhead for small payloads while maintaining efficiency for larger transmissions
4Device complexity
If single shortest path routing is used based on ETX metric, then routing simplicity is maintained, but adaptability to network dynamics and opportunistic routing opportunities is reduced
Solution Approach 1:
The patent transforms the static shortest-path routing approach into a dynamic opportunistic routing protocol. Nodes continuously update information propagation values based on current link qualities and network conditions, allowing routing paths to adapt dynamically to changing network states and opportunistic transmission opportunities while maintaining relatively simple protocol mechanics
Data Source
AI summary
A method includes identifying, at a first wireless node, routing costs associated with routing data to a destination through multiple paths in a wireless network. The method also includes identifying, at the first wireless node, information propagation values associated with the first wireless node and at least one second wireless node. The information propagation values are based on the routing costs and wireless link qualities associated with the wireless nodes. The method further includes scheduling transmission of the data by the first wireless node based on the information propagation values and transmitting the data based on the scheduling. The routing costs may include potential values associated with distances of the wireless nodes from the destination. Also, the information propagation values indicate which of the wireless nodes have a greater chance of propagating the data towards the destination in a single broadcast.