Connected Dominating Set Formation via Localized Two-Hop Information
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The computation complexity of finding a minimum connected dominating set (MCDS) in graphs is NP-complete, making it challenging to efficiently identify a connected dominating set with a minimum number of elements in communications and information technology systems, particularly in mobile ad-hoc networks.
Innovation Solution
A distributed, localized method that involves each node broadcasting its dominating factor and neighboring information, using specific rules to identify a dominating set and a connecting set, and forming a connected dominating set as their union, with optional exception and not-CS rules to optimize the process, allowing for flexible dominating factors and reduced message overhead.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a minimum connected dominating set (MCDS) is sought in graphs, then the solution optimality is improved, but the computation complexity becomes NP-complete
Solution Approach 1:
The patent segments the graph problem into localized 2-hop neighborhoods, where each node independently processes information from its immediate and second-degree neighbors. This segmentation transforms the global NP-complete MCDS problem into multiple local polynomial-time subproblems, achieving near-optimal solutions without exponential complexity
Solution Approach 2:
The patent applies local quality by using 2-hop localized information rather than global graph information. Each node makes CDS decisions based on local dominating factors and neighbor relationships within 2 hops, creating a distributed algorithm that avoids global computation while maintaining solution quality through localized optimization
2Ease of operation
If a connected dominating set is formed using traditional methods, then the routing functionality is achieved, but the message overhead increases
Solution Approach 1:
The patent performs preliminary action by pre-computing the connected dominating set using 2-hop localized information before actual routing operations. Nodes exchange dominating factor and neighbor information in advance, establish the CDS structure upfront, and then use this pre-established structure for efficient routing without continuous communication overhead
Solution Approach 2:
The patent extracts only the essential 2-hop neighborhood information (dominating factor and neighbor lists) needed for CDS formation, discarding unnecessary global graph data. This extraction minimizes message overhead by transmitting only the critical subset of information required for localized CDS computation while maintaining routing functionality
Data Source
AI summary
The present disclosure is directed to a method for forming a connected dominating set (CDS) for a graph. The method may include directing each node of the graph to broadcast a dominating factor and neighboring node information; identifying a dominating set based on the dominating factor of each node in comparison with dominating factors of neighboring nodes according to a dominating set rule definition; identifying a connecting set for connecting nodes according to a connecting set rule definition; and forming the CDS as a union of the dominating set and the connecting set.