Abstract
Over the past few decades, the world has witnessed a rapid growth in mobile and wireless networks (MWNs) which significantly change human life. However, proliferating mobile demands lead to several intractable challenges that MWN has to face. Software-defined network is expected as a promising way for future network and has captured growing attention. Network virtualization is an essential feature in software-defined wireless network (SDWN), and it brings two new entities, physical networks and virtual networks. Accordingly, efficiently assigning spectrum resource to virtual networks is one of the fundamental problems in SDWN. Directly orienting towards the spectrum resource allocation problem, firstly, the fluctuation features of virtual network requirements in SDWN are researched, and the opportunistic spectrum sharing method is introduced to SDWN. Then, the problem is proved as NP-hardness. After that, a dynamic programming and graph theory based spectrum sharing algorithm is proposed. Simulations demonstrate that the opportunistic spectrum sharing method conspicuously improves the system performance up to around 20%–30% in SDWN, and the proposed algorithm achieves more efficient performance.
The Spectrum Utilization Challenge
We are currently facing a perceived "spectrum crisis," yet research suggests the issue is not a lack of raw frequencies but rather poor utilization. Traditional Mobile Wireless Networks (MWNs) are typically constructed in "vertical silos" (e.g., UMTS, LTE, WLAN), where resources are isolated and cannot be easily shared across different standards or providers.
Software Defined Wireless Networks (SDWN) address this by virtualizing resources, allowing Virtual Networks (VNs) to lease spectrum from Physical Networks (PNs). Historically, VNs have been allocated fixed spectrum based on peak demand to ensure reliability. However, because network traffic is naturally "spiky," these peak-reserved resources often sit idle. The challenge lies in allowing multiple VNs to share the same spectrum "opportunistically" without causing service conflicts or catastrophic interference.
The Opportunistic Sharing Framework
To solve this, the researchers propose a framework that moves away from rigid, overbooked resource allocation. The core innovation is the division of VN requirements into two distinct categories:
- Benchmark Part: Persistent and monopolized requirements that must be guaranteed.
- Fluctuant Part: Requirements that occur with a certain probability and can be shared among multiple VNs.
By introducing a "conflict factor" ($o^{th}$), which acts as a threshold for the probability of simultaneous active demand, the system can manage the risk of service interference. The authors prove that finding the optimal allocation in this environment is an NP-hard problem, a complex variation of the Multiple Knapsack Problem. To address this, they developed a multi-step algorithm using Dynamic Programming (DP) to maximize revenue within a virtualized "Big-PN" resource pool, followed by graph theory to map these results back to actual heterogeneous physical networks.
Key Insights: Over-Subscription and Utility
A significant finding of this research is the "Utility > 1" phenomenon. By allowing a calculated risk of conflict, the resource utility ratio can actually exceed 1.0. This is achieved by "over-subscribing" the spectrum; since VNs rarely hit their peak fluctuant demand simultaneously, the system can effectively sell the same slice of spectrum multiple times while maintaining acceptable service levels.
Experimental Results and Performance
The proposed framework was tested using simulated datasets where VN requirements and PN capacities followed uniform distributions. The results consistently showed that the opportunistic approach significantly outperforms traditional non-sharing methods across all primary metrics.
As shown in the experimental data, the opportunistic method improved system revenue by 30.7%, 24.3%, and 19.3% for conflict factors of 0.3, 0.2, and 0.1, respectively. Furthermore, the DP and graph-based algorithm maintained high acceptance rates for new virtual networks even as the total number of VNs increased, demonstrating superior scalability compared to standard heuristic benchmarks like "First-Fit" or Genetic Algorithms.
Conclusion and Future Directions
This research demonstrates that opportunistic spectrum sharing can provide a 20%–30% boost in SDWN performance. While the current model uses static conflict thresholds and uniform traffic distributions, future work will focus on dynamically adjusting these thresholds based on real-time Quality of Service (QoS) requirements and applying the framework to more complex, bursty traffic models found in real-world mobile environments.
Summary updated