Multicast Routing Using Neighbor Matrices for Collision Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In shared networks, collisions occur when multiple users transmit data simultaneously, leading to data corruption, and existing methods like TDMA and NAMA may still result in collisions if nodes are unaware of the correct network topology, causing inefficiencies in scheduling and multicast message transmission.
Innovation Solution
The use of neighbor information, specifically through a neighbor matrix, to ensure consistent network topology awareness among nodes, allowing for efficient multicast message routing by selecting a subset of one-hop neighbors to relay messages, thereby reducing redundant receptions and increasing bandwidth efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If TDMA is used to divide frequency into different timeslots, then collisions are reduced, but network topology awareness may be inconsistent leading to scheduling inefficiencies
Solution Approach 1:
The patent applies preliminary action by having nodes proactively share their neighbor information matrices before multicast transmission. This allows all nodes to build consistent topology awareness in advance, ensuring that scheduling decisions are made with complete knowledge of network conditions, thereby preventing collisions while maintaining high scheduling efficiency.
Solution Approach 2:
The patent implements feedback mechanisms where nodes continuously exchange neighbor information matrices with their neighbors. This feedback loop ensures that all nodes maintain updated and consistent views of the network topology, allowing them to make informed scheduling decisions that avoid collisions while optimizing resource utilization.
2Reliability
If all one-hop neighbors relay multicast messages, then 100% coverage is achieved, but redundant receptions increase and bandwidth efficiency decreases
Solution Approach 1:
The patent applies local quality by enabling each node to make localized decisions about message relaying based on its specific neighbor information matrix. Nodes with greater coverage needs relay messages, while nodes with sufficient coverage from other relays do not, creating a non-uniform but optimized relaying pattern that achieves coverage with minimal redundancy.
Solution Approach 2:
The patent implements partial action by having only the necessary subset of one-hop neighbors relay multicast messages rather than all neighbors. The neighbor information matrix allows each node to identify precisely which neighbors are needed for coverage, transmitting only the partial set required to achieve 100% coverage without excessive redundancy.
3Reliability
If neighbor information matrices are shared among all nodes, then consistent topology awareness is achieved, but communication overhead increases
Solution Approach 1:
The patent applies segmentation by dividing the neighbor information sharing process into localized exchanges between adjacent nodes rather than global broadcasting. Each node shares its neighbor matrix only with its direct neighbors, who then independently construct their own topology views. This segmented approach achieves consistent topology awareness while minimizing communication overhead.
4Productivity
If a subset of one-hop neighbors is selected to relay messages, then bandwidth efficiency improves, but complex selection algorithms are required
Solution Approach 1:
The patent implements self-service by enabling each node to autonomously determine its relay status using its own neighbor information matrix and simple local calculations. Nodes independently assess their coverage contributions and make relay decisions without requiring complex centralized algorithms or inter-node coordination, thereby achieving efficient subset selection with minimal computational complexity.
Data Source
Figure 1~2
Figure 3
Figure 4
AI summary
In one aspect, a method to multicast in a network includes determining using a processor a least amount of relay nodes for use in multicasting a message to nodes in the network by using a neighbor matrix of a source node used in Node Activation Multiple Access (NAMA) scheduling. The method may include designating a one-hop neighbor that exclusively accesses the two-hop neighbor of the source node as a relay node. The method may also include designating a one-hop neighbor of the source node with accessibility to a maximum number of two-hop neighbors of the source node as a relay node.