ABSTRACT:

We analyze the delay performance of a multihop wireless network with a fastened route between each supply-destination pair. We tend to develop a new queue grouping technique to handle the complex correlations of the service method resulting from the multihop nature of the flows. A general set-primarily based interference model is assumed that imposes constraints on links which will be served simultaneously at any given time. These interference constraints are used to obtain a basic lower sure on the delay performance of any scheduling policy for the system. We gift a systematic methodology to derive such lower bounds. For a special wireless system, namely the clique, we tend to design a policy that is sample-path delay-optimal. For the tandem queue network, where the delay-optimal policy is thought, the expected delay of the optimal policy numerically coincides with the lower sure. We conduct intensive numerical studies to recommend that the average delay of the rear-pressure scheduling policy will be made shut to the lower sure by using appropriate functions of queue length.