Complexity and algorithm of setting optimal location for data sink in real-time NOMA-based IIoTs

Real-time performance is one of the most vital metrics in Non-Orthogonal Multiple Access (NOMA) based Industrial Internet of Things (IIoTs) applications. Since the relative geographic relationship between data sink and wireless sensors affects the transmission parallelism and thus the real-time performance, setting a reasonable location for the data sink is thus a feasible way to high real-time performance for applications where the locations of wireless sensors are fixed. In this paper, we consider how to find an optimal location for the data sink to minimize average access delay. We first formulate the problem and prove it to be NP-Complete by presenting an original reduction proof from classic set partition problem. Second, by tightening the NOMA decoding constraint of the original problem, a heuristic algorithm, which is designed based on Apollonian Circle Theorem and Dilworth Theorem, obtains a feasible location for the data sink. Simulation results reveal that the real-time performance loss of the heuristic algorithm is no more than 50% of the best one. Compared with the classic TDMA scheme, the real-time performance increases by more than 60% for some typical settings, and it can even reach 70% for the linear network topology, owing to the full exploitation of NOMA parallelism.

Automated summary

This paper investigates how to improve real-time performance in Non-Orthogonal Multiple Access (NOMA) based Industrial Internet of Things (IIoTs) applications by setting a reasonable location for the data sink. By formulating the problem and designing a heuristic algorithm, simulation results show that this approach can enhance real-time performance with minimal loss.