TY - JOUR
T1 - A Jackson network model and threshold policy for joint optimization of energy and delay in multi-hop wireless networks
AU - Xia, Li
AU - Shihada, Basem
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2014/11/20
Y1 - 2014/11/20
N2 - This paper studies the joint optimization problem of energy and delay in a multi-hop wireless network. The optimization variables are the transmission rates, which are adjustable according to the packet queueing length in the buffer. The optimization goal is to minimize the energy consumption of energy-critical nodes and the packet transmission delay throughout the network. In this paper, we aim at understanding the well-known decentralized algorithms which are threshold based from a different research angle. By using a simplified network model, we show that we can adopt the semi-open Jackson network model and study this optimization problem in closed form. This simplified network model further allows us to establish some significant optimality properties. We prove that the system performance is monotonic with respect to (w.r.t.) the transmission rate. We also prove that the threshold-type policy is optimal, i.e., when the number of packets in the buffer is larger than a threshold, transmit with the maximal rate (power); otherwise, no transmission. With these optimality properties, we develop a heuristic algorithm to iteratively find the optimal threshold. Finally, we conduct some simulation experiments to demonstrate the main idea of this paper.
AB - This paper studies the joint optimization problem of energy and delay in a multi-hop wireless network. The optimization variables are the transmission rates, which are adjustable according to the packet queueing length in the buffer. The optimization goal is to minimize the energy consumption of energy-critical nodes and the packet transmission delay throughout the network. In this paper, we aim at understanding the well-known decentralized algorithms which are threshold based from a different research angle. By using a simplified network model, we show that we can adopt the semi-open Jackson network model and study this optimization problem in closed form. This simplified network model further allows us to establish some significant optimality properties. We prove that the system performance is monotonic with respect to (w.r.t.) the transmission rate. We also prove that the threshold-type policy is optimal, i.e., when the number of packets in the buffer is larger than a threshold, transmit with the maximal rate (power); otherwise, no transmission. With these optimality properties, we develop a heuristic algorithm to iteratively find the optimal threshold. Finally, we conduct some simulation experiments to demonstrate the main idea of this paper.
UR - http://hdl.handle.net/10754/348513
UR - http://linkinghub.elsevier.com/retrieve/pii/S0377221714009023
UR - http://www.scopus.com/inward/record.url?scp=84920532664&partnerID=8YFLogxK
U2 - 10.1016/j.ejor.2014.10.063
DO - 10.1016/j.ejor.2014.10.063
M3 - Article
SN - 0377-2217
VL - 242
SP - 778
EP - 787
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 3
ER -