The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2009 vol.58)
pp: 706-718
Zhenghao Zhang , Florida State University, Tallahasse
Yuanyuan Yang , SUNY at Stony Brook, Stony Brook
Miao Zhao , SUNY at Stony Brook, Stony Brook
ABSTRACT
In this paper, we consider using simultaneous Multiple Packet Transmission (MPT) to improve the downlink performance of wireless networks. With MPT, the sender can send two compatible packets simultaneously to two distinct receivers and can double the throughput in the ideal case. We formalize the problem of finding a schedule to send out buffered packets in minimum time as finding a maximum matching problem in a graph. Since maximum matching algorithms are relatively complex and may not meet the timing requirements of real-time applications, we give a fast approximation algorithm that is capable of finding a matching at least 3/4 of the size of a maximum matching in O(|E|) time, where |E| is the number of edges in the graph. We also give analytical bounds for maximum allowable arrival rate, which measures the speedup of the downlink after enhanced with MPT, and our results show that the maximum arrival rate increases significantly even with a very small compatibility probability. We also use an approximate analytical model and simulations to study the average packet delay, and our results show that packet delay can be greatly reduced even with a very small compatibility probability.
INDEX TERMS
Multiple packet transmission, multiple-input, multiple-output (MIMO), wireless LAN, matching, approximation algorithm, maximum allowable arrival rate, packet delay.
CITATION
Zhenghao Zhang, Yuanyuan Yang, Miao Zhao, "Enhancing Downlink Performance in Wireless Networks by Simultaneous Multiple Packet Transmission", IEEE Transactions on Computers, vol.58, no. 5, pp. 706-718, May 2009, doi:10.1109/TC.2008.191
REFERENCES
[1] D. Tse and P. Viswanath, Fundamentals of Wireless Communication. Cambridge Univ. Press, May 2005.
[2] D.B. West, Introduction to Graph Theory. Prentice-Hall, 1996.
[3] T. Lang, V. Naware, and P. Venkitasubramaniam, “Signal Processing in Random Access,” IEEE Signal Processing Magazine, vol. 21, no. 5, pp. 29-39, Sept. 2004.
[4] G. Dimic, N.D. Sidiropoulos, and R. Zhang, “Medium Access Control—Physical Cross-Layer Design,” IEEE Signal Processing Magazine, vol. 21, no. 5, pp. 40-50, Sept. 2004.
[5] Q. Liu, S. Zhou, and G.B. Giannakis, “Cross-Layer Scheduling with Prescribed QoS Guarantees in Adaptive Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 23, no. 5, pp. 1056-1066, May 2005.
[6] V. Kawadia and P.R. Kumar, “Principles and Protocols for Power Control in Wireless Ad Hoc Networks,” IEEE J. Selected Areas in Comm., vol. 23, no. 1, pp. 76-88, Jan. 2005.
[7] A. Czygrinow, M. Hanckowiak, and E. Szymanska, “A Fast Distributed Algorithm for Approximating the Maximum Matching,” Proc. 12th Ann. European Symp. Algorithms (ESA '04), pp.252-263, 2004.
[8] http://grouper.ieee.org/groups/80211/, 2008.
[9] W. Xiang, T. Pratt, and X. Wang, “A Software Radio Testbed for Two-Transmitter Two-Receiver Space-Time Coding OFDM Wireless LAN,” IEEE Comm. Magazine, vol. 42, no. 6, pp. S20-S28, June 2004.
[10] J. Edmonds, “Paths, Trees, and Flowers,” Canadian J. Math., vol. 17, pp. 449-467, 1965.
[11] H.N. Gabow, “An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs,” J. ACM, vol. 23, no. 2, pp. 221-234, 1976.
[12] J. Magun, “Greedy Matching Algorithms: An Experimental Study,” Proc. First Workshop Algorithm Eng. (WAE '97), pp. 22-31, 1997.
[13] N. Kamaluddeen and C. Williamson, “Network Traffic Measurements of a Wireless Classroom Network,” Proc. 16th Int'l Conf. Wireless Comm. (Wireless '04), pp. 560-570, July 2004.
[14] Z. Zhang and Y. Yang, “Enhancing Downlink Performance in Wireless Networks by Simultaneous Multiple Packet Transmission,” Proc. 20th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '06), Apr. 2006.
[15] G. Caire and S. Shamai, “On the Achievable Throughput of a Multiantenna Gaussian Broadcast Channel,” IEEE Trans. Information Theory, vol. 49, no. 7, pp. 1691-1706, Jul. 2003.
[16] N. Jindal and A. Goldsmith, “Dirty-Paper Coding versus TDMA for MIMO Broadcast Channels,” IEEE Trans. Information Theory, vol. 51, no. 5, pp. 1783-1794, May 2005.
[17] C. Swannack, E. Uysal-Biyikoglu, and G. Wornell, “Low-Complexity Multi-User Scheduling for Maximizing Throughput in the MIMO Broadcast Channel,” Proc. 42nd Ann. Allerton Conf. Comm., Control and Computers, 2004.
[18] S. Vishwanath, N. Jindal, and A. Goldsmith, “Duality, Achievable Rates and Sum-Rate Capacity of MIMO Broadcast Channels,” IEEE Trans. Information Theory, vol. 49, no. 10, pp. 2658-2668, Oct. 2003.
[19] P. Viswanath and D.N.C. Tse, “Sum Capacity of the Vector Gaussian Broadcast Channel and Uplink-Downlink Duality,” IEEE Trans. Information Theory, vol. 49, no. 8, pp. 1912-1921, Aug. 2003.
[20] H. Weingarten, Y. Steinberg, and S. Shamai, “The Capacity Region of the Gaussian MIMO Broadcast Channel,” IEEE Trans. Information Theory, vol. 52, no. 9, pp. 3936-3964, Sept. 2005.
[21] M. Zhao, Z. Zhang, and Y. Yang, “Medium Access Diversity with Uplink-Downlink Duality and Transmit Beamforming in Multiple-Antenna Wireless Networks,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '06), Nov. 2006.
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool