Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Distributed dynamic resource allocation with power shaping for multicell SDMA packet access networks
Dipartimento di Ingegneria - Universit`a di Ferrara, Ferrara, Italy.
Dipartimento di Ingegneria - Universit`a di Ferrara, Ferrara, Italy.
KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS.ORCID iD: 0000-0003-4986-6123
Dipartimento di Ingegneria - Universit`a di Ferrara, Ferrara, Italy.
2004 (English)In: 2004 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, VOLS 1-4 - BROADBAND WIRELESS - THE TIME IS NOW, New York: IEEE , 2004, 2515-2520 p.Conference paper, Published paper (Refereed)
Abstract [en]

We consider distributed dynamic slot and power allocation for the downlink of a TD/SDMA broadband wireless packet network with multiple access ports and adaptive antennas. The still open issue for packet multicell SDMA is how to manage the intercell interference, which is very difficult to predict in an uncoordinated environment, due to packet access and downlink beamforming. For this reason, doing distributed allocation efficiently as well as improving the performance by means of power control results in a very hard task. We propose a greedy SDMA algorithm exploiting the power shaping technique, which is based on a static preallocation of the transmit power to each slot of the frame. This permits to obtain a partial predictability of intercell interference, allowing different levels of estimated intercell interference and available power for each slot. We show that our greedy SDMA algorithm with power shaping increases system capacity with respect to the same algorithm without power shaping and reduces the performance gap with respect to a greedy centralized strategy thus limiting the need of coordination among cells. Both centralized and distributed algorithms are compared, as reference, to the baseline case of random allocation, previously proposed for packet access.

Place, publisher, year, edition, pages
New York: IEEE , 2004. 2515-2520 p.
Series
IEEE Wireless Communications and Networking Conference, ISSN 1525-3511
Keyword [en]
slot allocation, systems
National Category
Computer and Information Science
Research subject
SRA - ICT
Identifiers
URN: urn:nbn:se:kth:diva-27797DOI: 10.1109/WCNC.2004.1311484ISI: 000222999500439Scopus ID: 2-s2.0-4544225736ISBN: 0-7803-8344-3 (print)OAI: oai:DiVA.org:kth-27797DiVA: diva2:382591
Conference
IEEE Wireless Communications and Networking Conference Atlanta, GA, MAR 21-25, 2004
Note
QC 20110105Available from: 2011-01-02 Created: 2011-01-02 Last updated: 2011-01-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Zander, Jens

Search in DiVA

By author/editor
Zander, Jens
By organisation
Communication Systems, CoS
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 23 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf