@inproceedings{10.1145/1530748.1530756,
author = {Liu, Jia and Hou, Y. Thomas and Shi, Yi and Sherali, Hanif D.},
title = {On Performance Optimization for Multi-Carrier MIMO Ad Hoc Networks},
year = {2009},
isbn = {9781605586243},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {[https://doi.org/10.1145/1530748.1530756](https://doi.org/10.1145/1530748.1530756)},
doi = {10.1145/1530748.1530756},
abstract = {Broadband multi-carrier MIMO (MC-MIMO) is a promising technology that could provide significant capacity gain for wireless ad hoc networks. For MC-MIMO networks, since the capacity is affected by potential mutual interference on subcarriers, scheduling for subcarriers and algorithms for power control/allocation become key problems to harness their potential. However, due to non-convexity and large size of the underlying problem, there are few results on this important problem. In this paper, we first show that the non-convex problem for MC-MIMO networks satisfies the so-called concave perturbation condition, which gives a zero duality gap for the problem. This important result allows us to tackle the problem in the dual domain. The dual approach has the highly desirable benefit of reducing the complexity of the underlying problem, which allows us to design a near-optimal off-line algorithm. In addition to the off-line algorithm, we also devise an online adaptive algorithm (OAA) without the need of channel distribution information (CDI). We show that OAA is able to achieve the same result as the off-line algorithm.},
booktitle = {Proceedings of the Tenth ACM International Symposium on Mobile Ad Hoc Networking and Computing},
pages = {43–54},
numpages = {12},
keywords = {ad hoc networks, mimo, multi-carrier systems},
location = {New Orleans, LA, USA},
series = {MobiHoc '09}
}