Bayesian Route Selection in Wireless Ad-Hoc Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing wireless ad-hoc networks face inefficiencies in routing due to high bandwidth consumption and excessive control message flooding, particularly in establishing routes, due to their dynamic topology and limited broadcast capabilities.
Innovation Solution
The method involves managing observation tables at each node to store information from broadcast messages, computing a maximum aposteriori probability of connectivity using a Bayesian approach, and transmitting messages based on this probability to establish routes efficiently, thereby reducing the number of control messages exchanged.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If proactive protocols (DSDV) are used to establish routes by maintaining routes to all nodes at all times, then route availability is improved, but bandwidth consumption increases due to continuous routing table updates
Solution Approach 1:
The patent applies preliminary action by pre-establishing and maintaining routes to all potential destination nodes before actual communication occurs. Nodes proactively update their routing tables with route information, ensuring that when communication is needed, routes are already available without requiring reactive route discovery. This resolves the contradiction by preparing route information in advance, making route availability high while allowing selective updates only when topology changes occur, thus managing bandwidth consumption efficiently.
2Loss of energy
If reactive protocols (AODV, DSR) are used to establish routes dynamically only when required, then bandwidth consumption is reduced, but route establishment delay increases
Solution Approach 1:
The patent combines reactive route establishment with preliminary action by maintaining observation tables that proactively collect and store route information from broadcast messages as nodes join or move in the network. When a route is needed, the system can quickly query these pre-collected observations rather than performing complete route discovery, thus reducing route establishment delay while avoiding continuous routing updates, thereby managing bandwidth consumption efficiently.
3Reliability
If routing protocols exchange large numbers of control messages to establish routes, then route establishment reliability is improved, but network flooding increases and bandwidth is consumed
Solution Approach 1:
The patent extracts and separates route information from control messages by utilizing broadcast traffic (data or other control messages) to carry additional route observations. Instead of requiring dedicated routing control messages for every route update, the system extracts route information from existing broadcast messages and stores them in observation tables. This reduces the number of explicit routing control messages needed while maintaining route establishment reliability through accumulated observational data.
4Measurement precision
If observation tables are maintained for all nodes to compute maximum a posteriori probability of connectivity, then routing accuracy is improved, but device complexity increases
Solution Approach 1:
The patent applies local quality by maintaining observation tables with differentiated levels of detail for different destination nodes. Rather than uniformly tracking all possible route parameters for all nodes, the system maintains detailed observation data for frequently accessed or critical destinations while using simplified representations for less important routes. This selective approach improves connectivity probability accuracy for important routes while reducing the overall computational and storage complexity of observation table management.
Data Source
AI summary
The invention provides a method and system for routing broadcast messages by managing a plurality of observation tables in a wireless ad-hoc network having a plurality of nodes. The method includes receiving one or more broadcast messages from one or more second nodes at a first node and stores information received from the broadcast messages pertaining to the one or more second nodes in one or more observation tables at the first node. A maximum aposteriori probability of connectivity is then computed for the one or more second nodes based on the information in the one or more observation tables maintained at the first node utilizing Bayesian approach. Thereafter, the first node transmits broadcast messages to the one or more second nodes based on the maximum aposteriori probability of connectivity computed for the one or more second nodes from the first node.


