Enhancing Downlink Performance in Wireless Networks by Simultaneous Multiple Packet Transmission
作者： Zhenghao Zhang , Yuanyuan Yang , Miao Zhao
DOI: 10.1109/TC.2008.191
关键词:
摘要: In this paper, we consider using simultaneous Multiple Packet Transmission (MPT) to improve the downlink performance of wireless networks. With MPT, sender can send two compatible packets simultaneously distinct receivers and double throughput in ideal case. We formalize problem finding a schedule out buffered minimum time as maximum matching graph. Since algorithms are relatively complex may not meet timing requirements real-time applications, give fast approximation algorithm that is capable at least 3/4 size O(|E|) time, where |E| number edges also analytical bounds for allowable arrival rate, which measures speedup after enhanced with our results show rate increases significantly even very small compatibility probability. use an approximate model simulations study average packet delay, delay be greatly reduced
computer.org
ieeecomputersociety.org参考文章(21)
Elif Uysal-Biyikoglu, Charles Swannack, Low Complexity Multiuser Scheduling for Maximizing Throughput in the MIMO Broadcast Channel ,(2004)
Douglas Brent West, Introduction to Graph Theory ,(1995)
Lang Tong, V. Naware, P. Venkitasubramaniam, Signal processing in random access IEEE Signal Processing Magazine. ,vol. 21, pp. 29- 39 ,(2004) , 10.1109/MSP.2004.1328086
Andrzej Czygrinow, Michał Hańćkowiak, Edyta Szymańska, A Fast Distributed Algorithm for Approximating the Maximum Matching european symposium on algorithms. pp. 252- 263 ,(2004) , 10.1007/978-3-540-30140-0_24
Pramod Viswanath, David Tse, Fundamentals of Wireless Communication ,(2005)
H. Weingarten, Y. Steinberg, S.S. Shamai, The Capacity Region of the Gaussian Multiple-Input Multiple-Output Broadcast Channel IEEE Transactions on Information Theory. ,vol. 52, pp. 3936- 3964 ,(2006) , 10.1109/TIT.2006.880064
Yang Xiao, Haizhon Li, Evaluation of distributed admission control for the IEEE 802.11e EDCA IEEE Communications Magazine. ,vol. 42, ,(2004) , 10.1109/MCOM.2004.1336720
N. Jindal, A. Goldsmith, Dirty-paper coding versus TDMA for MIMO Broadcast channels IEEE Transactions on Information Theory. ,vol. 51, pp. 1783- 1794 ,(2005) , 10.1109/TIT.2005.846425
Jack Edmonds, Paths, Trees, and Flowers Canadian Journal of Mathematics. ,vol. 17, pp. 361- 379 ,(1965) , 10.1007/978-0-8176-4842-8_26
Harold N. Gabow, An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs Journal of the ACM. ,vol. 23, pp. 221- 234 ,(1976) , 10.1145/321941.321942