Privacy-Preserving Link Scheduling for Wireless Networks

Abstract

Wireless communication is now a cornerstone of modern society, propelled by the widespread adoption of IoT devices and sophisticated wireless technologies. As wireless networks grow in complexity, there is an increasing need for efficient scheduling algorithms that can manage resources and adapt to evolving conditions effectively. Link scheduling is critical as it optimizes the use of wireless spectrum and bandwidth, prioritizing high-priority transmissions and minimizing interference. However, traditional link scheduling algorithms have primarily focused on performance, often overlooking the crucial aspect of privacy. This oversight poses significant risks in scenarios where privacy is paramount. To address this issue, we introduce PriLink, a novel link scheduling algorithm that prioritizes privacy without sacrificing performance. PriLink employs a least privilege model, sharing only essential links to protect critical topology details from potential adversaries. Our comprehensive evaluation shows that PriLink not only matches but occasionally surpasses the performance of established benchmarks like Greedy Maximal Scheduling and Local Greedy Scheduling. Moreover, it offers faster execution times and superior privacy protection. These results highlight PriLink’s effectiveness as a robust solution for efficient, real-time, and privacy-preserving link scheduling in dynamic wireless networks.

Keywords

• Link scheduling
• wireless networks
• privacy
• topology concealment