کنترل توپولوژی برای به حداقل رساندن تداخل با محدودیت های تاخیر در یک شبکه اختصاصی

Most of the existing work on topology control is to minimize the interference or delay separately. However, minimizing the interference and reducing the delay are two conflicting goals; therefore, considering a trade-off between them is necessary. In this paper, our goal is to minimize the interference while guaranteeing the end-to-end delay under a constraint. We take into account three optimization objectives, including the maximum interference, average interference and average path interference. We propose a centralized algorithm with a greedy strategy that can minimize the maximum interference while satisfying the delay constraint. A distributed algorithm (LDMST) is proposed to minimize the average interference. In LDMST, each node builds a delay-constrained minimum spanning tree (DMST). To minimize the path interference, a localized delay-constrained Bellman–Ford (LDBF) algorithm is proposed. LDBF employs an improved Bellman–Ford algorithm to find the optimal path, which has the minimum interference and satisfies the delay constraint. The final topology is composed of these optimal paths. The simulation results illustrate that the proposed topology control algorithms exhibit good performance in terms of the interference objectives and can also guarantee the end-to-end delay under the constraint.