TY - JOUR
T1 - Stability and dynamic control of underlay mobile edge networks
AU - Sarikaya, Yunus
AU - Inaltekin, Hazer
AU - Alpcan, Tansu
AU - Evans, Jamie S.
PY - 2018/9/1
Y1 - 2018/9/1
N2 - This paper studies the stability and dynamic control of underlay mobile edge networks. First, the stability region for a multiuser edge network is obtained under the assumption of full channel state information. This result provides a benchmark figure for comparing performance of the proposed algorithms. Second, a centralized joint flow control and scheduling algorithm is proposed to stabilize the queues of edge devices while respecting the average and instantaneous interference power constraints at the core access point. This algorithm is proven to converge to a utility point arbitrarily close to the maximum achievable utility within the stability region. Finally, more practical implementation issues such as distributed scheduling are examined by designing efficient scheduling algorithms taking advantage of communication diversity. The proposed distributed solutions utilize mini-slots for contention resolution and achieve a certain fraction of the utility optimal point. The performance lower bounds for distributed algorithms are determined analytically. The detailed simulation study is performed to pinpoint the cost of distributed control for mobile edge networks with respect to centralized control.
AB - This paper studies the stability and dynamic control of underlay mobile edge networks. First, the stability region for a multiuser edge network is obtained under the assumption of full channel state information. This result provides a benchmark figure for comparing performance of the proposed algorithms. Second, a centralized joint flow control and scheduling algorithm is proposed to stabilize the queues of edge devices while respecting the average and instantaneous interference power constraints at the core access point. This algorithm is proven to converge to a utility point arbitrarily close to the maximum achievable utility within the stability region. Finally, more practical implementation issues such as distributed scheduling are examined by designing efficient scheduling algorithms taking advantage of communication diversity. The proposed distributed solutions utilize mini-slots for contention resolution and achieve a certain fraction of the utility optimal point. The performance lower bounds for distributed algorithms are determined analytically. The detailed simulation study is performed to pinpoint the cost of distributed control for mobile edge networks with respect to centralized control.
UR - http://www.scopus.com/inward/record.url?scp=85021798624&partnerID=8YFLogxK
UR - http://purl.org/au-research/grants/arc/DP140101050
U2 - 10.1109/TMC.2017.2696939
DO - 10.1109/TMC.2017.2696939
M3 - Article
SN - 1536-1233
VL - 17
SP - 2195
EP - 2208
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 9
ER -