Large-Scale Centralized Scheduling of Short-Range Wireless Links

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In 5G networks we expect femtocells, mmWave and D2D communications to take over the more typical long-range cellular architectures with pre-planned radio resources. However, as the connection length between the nodes become shorter, locating feasible, non-interfering combinations of the links becomes more and more difficult. In this paper a new approach to this problem is presented. In particular, through guided heuristic search, it is possible to locate non-interfering combinations of wireless connections in a highly effective manner. The approach enables operators to deploy centralized scheduling solutions for emerging technologies such as network-assisted WiFi-Direct and LTE Direct, and others, especially those which lack efficient medium arbitration mechanisms.

Cite

CITATION STYLE

APA

Pyattaev, A., & Gerasimenko, M. (2019). Large-Scale Centralized Scheduling of Short-Range Wireless Links. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11965 LNCS, pp. 607–615). Springer. https://doi.org/10.1007/978-3-030-36614-8_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free