Performance Analysis of Delay and Optimality of Scheduling Policies for Multi-Hop wireless Networks
Y. Kiran Kumar#1, A. Atchyut Rao#2
#1 Computer Science
and Engineering, JNTU, Kakinada. Email: firstname.lastname@example.org
#2 Gokul Institute of Technology and Sciences, Piridi, Andhra Pradesh, India. E mail: email@example.com
In this paper, we analyze the delay performance of a multi-hop wireless network in which the routes between source-destination pairs are fixed. We develop a new queue grouping technique to handle the complex correlations of the service process resulting from the multi-hop nature of the flows and their mutual sharing of the wireless medium. A general set based interference model is assumed that imposes constraints on links that can be served simultaneously at any given time. These interference constraints are used to obtain a fundamental lower bound on the delay performance of any scheduling policy for the system. We present a systematic methodology to derive such lower bounds. For a special wireless system, namely the clique, we design a policy that is sample path delay optimal. For the tandem queue network, where the delay optimal policy is known, the expected delay of the optimal policy numerically coincides with the lower bound. The lower bound analysis provides useful insights into the design and analysis of optimal or nearly optimal scheduling policies. We conduct extensive numerical studies to demonstrate that one can design policies whose average delay performance is close to the lower bound computed by the techniques presented in this paper.Keywords— Delay, Performance, Analysis, Optimality, Multi -Hop, wireless.
International eJournal of Mathematical Sciences, Technology and Humanities
Volume 2, Issue 5, Pages: 805 - 810