skip to main content
10.1145/3569902.3570190acmotherconferencesArticle/Chapter ViewAbstractPublication PagesladcConference Proceedingsconference-collections
research-article

Sk-Greedy: A Heuristic Scheduling Algorithm for Wireless Networks under the SINR Model

Published:17 January 2023Publication History

ABSTRACT

Recent advances in networking technologies such as massive Internet-of-Things and 6G-and-beyond cellular networks indicate a trend towards increasingly dense wireless communications. A wireless communication channel is a shared medium that demands access control, such as proper transmission scheduling. The SINR model can improve the performance of ultra-dense wireless networks by taking into consideration the effects of interference to allow multiple simultaneous transmissions in the same coverage area. However, finding the shortest schedule in wireless networks under the SINR model is an NP-hard problem. In this work, we present a greedy heuristic algorithm to solve that problem. The proposed solution, called Sk-Greedy (Stochastic k Greedy) algorithm produces a complete transmission schedule optimizing size, with the purpose of increasing the number of simultaneous transmissions (i.e., spatial reuse) thus allowing devices to communicate as frequently as possible. Simulation results are presented, including comparisons of Sk-Greedy with the optimal algorithm. Results confirm that the solution requires short execution times to produce near-optimal schedules.

References

  1. Fahad Al-dhelaan, Pengjun Wan, and Huaqiang Yuan. 2016. A New Paradigm for Shortest Link Scheduling in Wireless Networks: Theory and Applications. In Wireless Algorithms, Systems, and Applications. Spring, China, 24–36.Google ScholarGoogle Scholar
  2. Mohamed Sofiane Batta, Saad Harous, Lemia Louail, and Zibouda Aliouat. 2019. A Distributed TDMA Scheduling Algorithm for Latency Minimization in Internet of Things. In IEEE International Conference on Electro Information Technology. IEEE, 108–113.Google ScholarGoogle ScholarCross RefCross Ref
  3. Douglas M. Blough, G. Resta, and P. Santi. 2010. Approximation Algorithms for Wireless Link Scheduling With SINR-Based Interference. IEEE/ACM Transactions on Networking 18, 6 (2010), 1701–1712.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Gurashish Brar, Douglas M. Blough, and Paolo Santi. 2006. Computationally Efficient Scheduling with the Physical Interference Model for Throughput Improvement in Wireless Mesh Networks. In Annual International Conference on Mobile Computing and Networking. ACM, 2–13.Google ScholarGoogle Scholar
  5. Yuchao Chang, Xiaobing Yuan, Baoqing Li, Dusit Niyato, and Naofal Al-Dhahir. 2018. A joint unsupervised learning and genetic algorithm approach for topology control in energy-efficient ultra-dense wireless sensor networks. IEEE Communications Letters 22, 11 (2018), 2370–2373.Google ScholarGoogle ScholarCross RefCross Ref
  6. Mostafa Zaman Chowdhury, Md. Shahjalal, Shakil Ahmed, and Yeong Min Jang. 2020. 6G Wireless Communication Systems: Applications, Requirements, Technologies, Challenges, and Research Directions. IEEE Open Journal of the Communications Society 1 (2020), 957–975.Google ScholarGoogle ScholarCross RefCross Ref
  7. José Carlos da Silva and Flávio Assis. 2019. A distributed algorithm to schedule TSCH links under the SINR model. Design Automation for Embedded Systems 23, 1 (2019), 21–39.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Fábio Engel and Elias Duarte. 2021. A Down-to-Earth Scheduling Strategy for Dense SINR Wireless Networks. In Latin-American Symposium on Dependable Computing. SBC, 1–6.Google ScholarGoogle Scholar
  9. Olga Goussevskaia, Yvonne Anne Oswald, and Rogert Wattenhofer. 2007. Complexity in Geometric SINR. In ACM Int. Symp. Mobile Ad Hoc Networking and Computing. ACM, 100–109.Google ScholarGoogle Scholar
  10. Olga Goussevskaia, Yvonne-Anne Pignolet, and Roger Wattenhofer. 2010. Efficiency of Wireless Networks: Approximation Algorithms for the Physical Interference Model. Now Foundations and Trends.Google ScholarGoogle Scholar
  11. Fengxian Guo, F. Richard Yu, Heli Zhang, Xi Li, Hong Ji, and Victor C. M. Leung. 2021. Enabling Massive IoT Toward 6G: A Comprehensive Survey. IEEE Internet of Things Journal 8, 15 (2021), 11891–11915.Google ScholarGoogle ScholarCross RefCross Ref
  12. Magnús M. Halldórsson and Roger Wattenhofer. 2019. Wireless Network Algorithmics. Springer International Publishing, 141–160.Google ScholarGoogle Scholar
  13. Denis Jeanneau, Luiz A Rodrigues, Luciana Arantes, and Elias P Duarte Jr. 2017. An autonomic hierarchical reliable broadcast protocol for asynchronous distributed systems with failure detection. Journal of the Brazilian Computer Society 23, 1 (2017), 1–14.Google ScholarGoogle ScholarCross RefCross Ref
  14. Neeraj Kumar, Al-Sakib Khan Pathan, Elias P Duarte, and Riaz Ahmed Shaikh. 2015. Critical applications in vehicular ad hoc/sensor networks. Telecommunication Systems 58, 4 (2015), 275–277.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Nhat X. Lam, Tien Tran, Min Kyung An, and Dung T. Huynh. 2015. A note on the complexity of minimum latency data aggregation scheduling with uniform power in physical interference model. Theoretical Computer Science 569 (2015), 70–73.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Gyeongheon Lee and Joosang Youn. 2020. Group-based Transmission Scheduling Scheme for Building LoRa-based Massive IoT. In International Conference on Artificial Intelligence in Information and Communication. 583–586.Google ScholarGoogle Scholar
  17. A. V. Lotov and K. Miettinen. 2008. Visualizing the Pareto frontier. In Multiobjective optimization. Springer, 213–243.Google ScholarGoogle Scholar
  18. Shaohe Lv, Xiaodong Wang, and Xingming Zhou. 2010. Scheduling under SINR Model in Ad Hoc Networks with Successive Interference Cancellation. In IEEE Globecom. IEEE, 1–5.Google ScholarGoogle Scholar
  19. Ritesh Maheshwari, Shweta Jain, and Samir R. Das. 2008. A Measurement Study of Interference Modeling and Scheduling in Low-Power Wireless Networks. In ACM Conference on Embedded Network Sensor Systems. ACM, 141–154.Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Renato EN Moraes, Welber WF dos Reis, Helder RO Rocha, and Daniel JC Coura. 2020. Power-efficient and interference-free link scheduling algorithms for connected wireless sensor networks. Wireless Networks 26, 5 (2020), 3099–3118.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Thomas Moscibroda and Roger Wattenhofer. 2006. The Complexity of Connectivity in Wireless Networks. In IEEE Computer and Communications Societies, Barcelona, Spain. IEEE, 1–13.Google ScholarGoogle Scholar
  22. Mohamed Saad. 2015. Wireless capacity maximization: A constrained genetic approach. In IEEE International Conference on Communications. 3855–3860.Google ScholarGoogle ScholarCross RefCross Ref
  23. Aggeliki Sgora, Dimitrios J. Vergados, and Dimitrios D. Vergados. 2015. A Survey of TDMA Scheduling Schemes in Wireless Multihop Networks. ACM Comput. Surv. 47, 3 (2015).Google ScholarGoogle Scholar
  24. Dongjin Son, Bhaskar Krishnamachari, and John Heidemann. 2006. Experimental Study of Concurrent Transmission in Wireless Sensor Networks. In The ACM Conference on Embedded Networked Sensor Systems. ACM, 237–250.Google ScholarGoogle Scholar
  25. Yinglei Teng, Mengting Liu, F Richard Yu, Victor CM Leung, Mei Song, and Yong Zhang. 2018. Resource allocation for ultra-dense networks: A survey, some research issues and challenges. IEEE Communications Surveys & Tutorials 21, 3 (2018), 2134–2168.Google ScholarGoogle ScholarCross RefCross Ref
  26. Rogerio C Turchetti and Elias P Duarte Jr. 2017. NFV-FD: Implementation of a failure detector using network virtualization technology. International Journal of Network Management 27, 6 (2017), e1988.Google ScholarGoogle ScholarCross RefCross Ref
  27. Curt M. White. 2015. Data Communications and Computer Networks: A Business User’s Approach (8 ed.). Cengage.Google ScholarGoogle Scholar
  28. Jiguo Yu, Baogui Huang, Xiuzhen Cheng, and Mohammed Atiquzzaman. 2016. Shortest link scheduling algorithms in wireless networks under the SINR model. IEEE Transactions on Vehicular Technology 66, 3 (2016), 2643–2657.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Sk-Greedy: A Heuristic Scheduling Algorithm for Wireless Networks under the SINR Model

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        LADC '22: Proceedings of the 11th Latin-American Symposium on Dependable Computing
        November 2022
        167 pages
        ISBN:9781450397377
        DOI:10.1145/3569902

        Copyright © 2022 ACM

        © 2022 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 17 January 2023

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed limited

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      HTML Format

      View this article in HTML Format .

      View HTML Format