miun.sePublications
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
The Concepts of PARPS: Packet and Resource Plan Scheduling
Mid Sweden University, Faculty of Science, Technology and Media, Department of Information Technology and Media. (MUCOM)ORCID iD: 0000-0003-0925-5678
Mid Sweden University, Faculty of Science, Technology and Media, Department of Information Technology and Media. (MUCOM)
Responsible organisation
1999 (English)In: Multiaccess, Mobility and Teletraffic for Wireless Communications (MMT '99), Venice, Italy, October 6-8, 1999, 1999Conference paper, (Other academic)
Abstract [en]

Dynamic schemes for downlink packet radio resource management (RRM) are the topic of this paper. The concept of PARPS (Packet And Resource Plan Scheduling) is introduced. PARPS reduces the combined proble m of dynamic RRM, including statistical multiplex, dynamic channel allocation, power control, link adaptation, reuse partitioning, soft handover, admission control, etc, to a scheduling problem. PARPS makes it possible to achieve dynamic RRM individually for each data packet, without performing signal-to-interference ratio calculations for every single packet. A PARPS algorithm assigns a so-called resource plan to each timeslot, and assigns data packets to timeslots and transmitters. A resource plan is a combination of several radio parameters, e.g. transmitter power levels, coding rates and modulation schemes, for a group of centrally controlled and synchronised transmitters. We propose several optimised and heuristic PARPS algorithms. Optimised PARPS is NP hard, i.e. it is not realistic to solve in real time for a big system, but it can be used for finding an upper bound for the compound effect of several RRM techniques by means of computer simulations. The heuristic algorithms are realistic to implement in real systems. Our results show that some of the heuristic algorithms have delay performance very near an optimised algorithm, and that the capacity and coverage of a set of resource plans for 2D Poisson traffic can be evaluated with static analyses, i.e. without queuing system simulation. We apply PARPS to cellular systems based on the COFDM modulation scheme. Especially, we have personal communication services in the MEMO system in mind, where the terrestrial digital audio or video broadcasting system (DAB or DVB-T) is used as a broadband downlink, in combination with some narrowband uplink, e.g. GSM.

Place, publisher, year, edition, pages
1999.
Keyword [en]
OFDM, macro-diversity, SFN, DSFN, MEMO, DAB, DVB-T
National Category
Computer Science
Identifiers
URN: urn:nbn:se:miun:diva-4807Local ID: 814OAI: oai:DiVA.org:miun-4807DiVA: diva2:29839
Available from: 2008-09-30 Created: 2008-09-30 Last updated: 2013-10-30Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Eriksson, Magnus
By organisation
Department of Information Technology and Media
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Total: 73 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