Multicast Mesh Scalable Routing for Wireless Mesh Networks

Solution Overview

Problem

Existing multicast routing algorithms for wireless ad-hoc networks are not suitable for large scale wireless mesh networks with high dynamics due to high latency and routing overhead, and they fail to efficiently support fast topology changes.

Innovation Solution

The Multicast Mesh Scalable Routing (MMSR) algorithm elects access points as local multicast group leaders to form a multicast group leader cloud, which reduces routing overhead and convergence time by coordinating with underlying unicast routing and utilizing fixed infrastructure nodes, enabling efficient multicast tree formation and maintenance in large, dynamic networks.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If existing multicast routing algorithms are used in large scale wireless mesh networks, then multicast routing can be established, but routing overhead and convergence time increase significantly

Engineering Contradiction:

Improvemulticast routing establishmentVSAvoidconvergence time

Core Design Contradiction:

ReliabilityVSLoss of time

Solution Approach 1:

The network is segmented into multiple regions with regional multicast group leaders elected in each region. This segmentation allows independent multicast tree formation in each region, reducing the convergence time and routing overhead compared to establishing a single global multicast tree across the entire large-scale network.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

Regional multicast group leaders act as intermediaries between source nodes and group members in their respective regions. These leaders coordinate with underlying unicast routing protocols and manage local multicast trees, reducing the direct routing overhead between all source-group member pairs in the large-scale network.

Inventive Principle:

Principle #24Intermediary (Mediator)

2Reliability

If existing multicast routing algorithms are used in large scale wireless mesh networks, then multicast routing can be established, but routing overhead increases

Engineering Contradiction:

Improvemulticast routing establishmentVSAvoidrouting overhead

Core Design Contradiction:

ReliabilityVSQuantity of substance

Solution Approach 1:

The network is segmented into multiple regions with regional multicast group leaders elected in each region. This segmentation allows independent multicast tree formation in each region, reducing the convergence time and routing overhead compared to establishing a single global multicast tree across the entire large-scale network.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

Regional multicast group leaders act as intermediaries between source nodes and group members in their respective regions. These leaders coordinate with underlying unicast routing protocols and manage local multicast trees, reducing the direct routing overhead between all source-group member pairs in the large-scale network.

Inventive Principle:

Principle #24Intermediary (Mediator)

3Reliability

If existing multicast routing algorithms are used, then multicast routing can be established, but they fail to support fast topology changes

Engineering Contradiction:

Improvemulticast routing establishmentVSAvoidtopology change support

Core Design Contradiction:

ReliabilityVSAdaptability or versatility

Solution Approach 1:

The multicast group leaders are elected dynamically on-demand based on group member requests rather than being statically assigned. This dynamic election mechanism allows the network to adapt quickly to topology changes, as new leaders can be elected when existing leaders become unavailable due to mobility or link failures.

Inventive Principle:

Principle #15Dynamics

Solution Approach 2:

The algorithm maintains proactive unicast routing tables that are updated in advance through underlying unicast routing protocols. This preliminary routing information is available when topology changes occur, enabling fast multicast tree reformation without waiting for reactive route discovery.

Inventive Principle:

Principle #10Preliminary action

Data Source

PatentUS7606187B2System and method to support multicast routing in large scale wireless mesh networks

Publication Date: 2009.10.20 ARRIS ENTERPRISES LLC

AI summary

Provided is a system and method for a multicast routing algorithm to work in infrastructure based mesh networks. It chooses access points, fixed infrastructure gateway nodes connected to each other and/or the global internet via a wired/wireless backbone, as a group of local multicast group leaders to form a multicast group leader cloud. Each local multicast group leader is elected on-demand according to the local multicast group member's request. Each local multicast group leader forms a local multicast tree rooted at this leader connecting all multicast group members associated with the AP. The processes of electing and maintaining local multicast trees rooted at APs enable efficient coordination with underlying unicast routing to exploit the advantages of fixed infrastructure nodes. Therefore, routing overhead and multicast tree convergence time are reduced. The method can support large networks with fast topology change due to fast convergence and reduced routing overhead.