Efficient Graph-Based Resource Allocation Scheme Using Maximal Independent Set for Randomly- Deployed Small Star...

Area of Science:

• Wireless communication networks
• Graph theory applications in telecommunications

Background:

• Future dense networks rely on small star networks (SSNs).
• Inter-SSN interference limits SSN system performance.
• Existing resource allocation schemes are inefficient for dense SSN deployments.

Purpose of the Study:

• To propose an efficient graph-based resource allocation scheme for SSNs.
• To mitigate inter-SSN interference in heterogeneous and dense network scenarios.
• To enhance system capacity, utility, and fairness.

Main Methods:

• Constructing an interference graph based on a distance threshold.
• Applying the maximal independent set (MIS) concept to group SSNs.
• Utilizing empirical parameters and equations for performance optimization.

Main Results:

• The proposed MIS-based scheme effectively divides SSNs into interference-free groups.
• It significantly outperforms the max K-cut-based scheme in system capacity, utility, and time cost.
• Achieved performance closely approximates near-optimal strategies.

Conclusions:

• The graph-based MIS scheme offers an efficient solution for resource allocation in dense SSN environments.
• This approach provides a practical method for interference coordination.
• The scheme demonstrates superior performance and reduced computational complexity compared to traditional methods.