Abstract
While bit-loading algorithms over wireless systems have been extensively studied, the development of a protocol which implements bit-loading-based rate adaptation over wireless systems has not been highlighted. The design of such a protocol is not a trivial problem, due to the overhead associated with the feedback information. In this paper, a novel protocol is proposed to provide an efficient way to implement subcarrier-wise rate adaptation in OFDM-based wireless systems. When receiving a Ready-To-Send (RTS) packet, the receiver determines the number of bits to be allocated on each subcarrier through channel estimation. This decision is delivered to the sender using an additional OFDM symbol in the Clear-To-Send (CTS) packet. That is, bit-allocation over subcarriers is achieved using only one additional OFDM symbol. The protocol enhances the channel efficiency in spite of the overhead of one additional OFDM symbol.
Highlights
Wireless communication is experiencing an explosive growth of rate demand
The attention has been focused on the application of the Orthogonal Frequency Division Multiplexing (OFDM) in the wireless local area network (WLAN)
As a consequence, applying a different constellation size to each subcarrier according to its channel condition provides more reliable and efficient data transmission than applying the same constellation size to all subcarriers
Summary
Wireless communication is experiencing an explosive growth of rate demand. The high demand for wireless communication services requires increased system capacity. Since the sender and receiver have to share this allocation information, frequent exchanges of the bit-loading information between them are required This increases the overhead and, as a consequence, degrades the network performance. In order to utilize subcarrier-wise bit allocation in wireless ad hoc networks, an efficient protocol with minimum feedback information is required. Researches in this area have focused on allocating the optimal energy and rate and reducing the complexity of the bit-loading calculation itself [8,9,10,11,12,13] with the assumption of the availability of the feedback channel information.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
