Enhancing downlink performance in wireless networks by simultaneous multiple packet transmission

Authors:
Zhenghao Zhang;Yuanyuan Yang
Affiliations:
Department of Electrical and Computer Engineering, State University of New York, Stony Brook, NY;Department of Electrical and Computer Engineering, State University of New York, Stony Brook, NY
Venue:
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Year:
2006

Citing 5
Cited 2

An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs

Journal of the ACM (JACM)
Fundamentals of wireless communication

Fundamentals of wireless communication
A software radio testbed for two-transmitter two-receiver space-time coding OFDM wireless LAN

IEEE Communications Magazine
Principles and protocols for power control in wireless ad hoc networks

IEEE Journal on Selected Areas in Communications
Cross-layer scheduling with prescribed QoS guarantees in adaptive wireless networks

IEEE Journal on Selected Areas in Communications

Applying Opportunistic Medium Access and Multiuser MIMO Techniques in Multi-channel Multi-radio WLANs

Mobile Networks and Applications
A packet scheduling algorithm for optimizing downlink throughput in wireless LANs with the one-sender-multiple-receiver technique

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications

Quantified Score

Hi-index	0.00

Visualization

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, wireless LAN, matching, approximation algorithm, maximum allowable arrival rate, delay.