HEAL DSpace

Dynamic subchannel and slot allocation for OFDMA networks supporting mixed traffic: Upper bound and a heuristic algorithm

Αποθετήριο DSpace/Manakin

Εμφάνιση απλής εγγραφής

dc.contributor.author Gotsis, A en
dc.contributor.author Komnakos, D en
dc.contributor.author Constantinou, P en
dc.date.accessioned 2014-03-01T01:30:14Z
dc.date.available 2014-03-01T01:30:14Z
dc.date.issued 2009 en
dc.identifier.issn 1089-7798 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/19516
dc.subject Dynamic subchannel allocation en
dc.subject Mixed traffic. en
dc.subject Multiuser OFDM en
dc.subject Time domain scheduling en
dc.subject.classification Telecommunications en
dc.subject.other Dynamic subchannel allocation en
dc.subject.other Frequency and time domains en
dc.subject.other Frequency dimensions en
dc.subject.other Mixed traffic. en
dc.subject.other Multiuser diversity en
dc.subject.other Multiuser OFDM en
dc.subject.other Polynomial complexity en
dc.subject.other Real-time data en
dc.subject.other Slot allocation en
dc.subject.other Subcarrier en
dc.subject.other Subchannels en
dc.subject.other Throughput performance en
dc.subject.other Time domain scheduling en
dc.subject.other Upper Bound en
dc.subject.other Air traffic control en
dc.subject.other Cell membranes en
dc.subject.other Frequency division multiple access en
dc.subject.other Heuristic algorithms en
dc.subject.other Heuristic methods en
dc.subject.other Orthogonal frequency division multiplexing en
dc.subject.other Planning en
dc.subject.other Portals en
dc.subject.other Resource allocation en
dc.subject.other Time domain analysis en
dc.subject.other Frequency allocation en
dc.title Dynamic subchannel and slot allocation for OFDMA networks supporting mixed traffic: Upper bound and a heuristic algorithm en
heal.type journalArticle en
heal.identifier.primary 10.1109/LCOMM.2009.090140 en
heal.identifier.secondary http://dx.doi.org/10.1109/LCOMM.2009.090140 en
heal.language English en
heal.publicationDate 2009 en
heal.abstract Optimizing resource allocation over only the frequency dimension in a single-cell OFDMA network is strictly suboptimal when heterogeneous non-real-time data users coexist. In this work we examine how to jointly exploit multi-user diversity on frequency and time domains towards maximizing cell throughput performance and satisfying individual rate and fairness QoS constraints.We develop a performance upper bound as well as an efficient heuristic algorithm for subcarrier and slot allocation which outperforms existing algorithms under polynomial complexity. © 2009 IEEE. en
heal.publisher IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC en
heal.journalName IEEE Communications Letters en
dc.identifier.doi 10.1109/LCOMM.2009.090140 en
dc.identifier.isi ISI:000269008400006 en
dc.identifier.volume 13 en
dc.identifier.issue 8 en
dc.identifier.spage 576 en
dc.identifier.epage 578 en


Αρχεία σε αυτό το τεκμήριο

Αρχεία Μέγεθος Μορφότυπο Προβολή

Δεν υπάρχουν αρχεία που σχετίζονται με αυτό το τεκμήριο.

Αυτό το τεκμήριο εμφανίζεται στην ακόλουθη συλλογή(ές)

Εμφάνιση απλής εγγραφής