A combinatorial auction based subcarrier allocation algorithm for multiuser OFDMA

Stiakogiannakis, IN; Kaklamani, DI

dc.contributor.author	Stiakogiannakis, IN	en
dc.contributor.author	Kaklamani, DI	en
dc.date.accessioned	2014-03-01T02:47:13Z
dc.date.available	2014-03-01T02:47:13Z
dc.date.issued	2011	en
dc.identifier.issn	15502252	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33023
dc.subject	Combinatorial Auction	en
dc.subject	Computational Complexity	en
dc.subject	Model Approximation	en
dc.subject	Optimal Algorithm	en
dc.subject	Resource Manager	en
dc.subject	Signal Processing	en
dc.subject	Base Station	en
dc.subject	Orthogonal Frequency Division Multiple Access	en
dc.subject.other	Bit rates	en
dc.subject.other	Combinatorial auction	en
dc.subject.other	Execution time	en
dc.subject.other	Hungarian algorithm	en
dc.subject.other	Margin adaptive	en
dc.subject.other	Multi-user	en
dc.subject.other	Optimal algorithm	en
dc.subject.other	Orthogonal frequency division multiple access	en
dc.subject.other	Sub-carrier allocation	en
dc.subject.other	Sub-carriers	en
dc.subject.other	Transmit power	en
dc.subject.other	Algorithms	en
dc.subject.other	Base stations	en
dc.subject.other	Computational complexity	en
dc.subject.other	Frequency division multiple access	en
dc.subject.other	Optimization	en
dc.subject.other	Orthogonal frequency division multiplexing	en
dc.subject.other	Combinatorial mathematics	en
dc.title	A combinatorial auction based subcarrier allocation algorithm for multiuser OFDMA	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/VETECS.2011.5956218	en
heal.identifier.secondary	http://dx.doi.org/10.1109/VETECS.2011.5956218	en
heal.identifier.secondary	5956218	en
heal.publicationDate	2011	en
heal.abstract	The margin adaptive problem for the downlink of Orthogonal Frequency Division Multiple Access is tackled in this work. A subcarrier allocation algorithm is presented, which formulates the issue of subcarrier allocation as a combinatorial auction, where the base station auctions the OFDM subcarriers and the users compete for their allocation. A major feature of the proposed algorithm is its distributed nature, since each user decides independently which subcarriers to bid for, informs the base station for his preferences, and the base station is the entity that makes the decision on the allocation, based on power criteria. The presentation of the algorithm is followed by a series of simulations. The simulations indicate that the performance of the proposed algorithm approaches the performance of the optimal, Hungarian algorithm: The offered bit rate is at least 98.77% of the optimal while the transmit power lies within the range 0.20dB-1.62dB higher than the optimal one. Additionally, based on execution time measurements, it is shown that the necessary execution time is much lower than that of the optimal algorithm, indicating thus a much lower computational complexity. © 2011 IEEE.	en
heal.journalName	IEEE Vehicular Technology Conference	en
dc.identifier.doi	10.1109/VETECS.2011.5956218	en