Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
A Joint Routing-MAC Model for Cellular-Relaying Networks
KTH, Skolan för informations- och kommunikationsteknik (ICT), Kommunikation: Infrastruktur och tjänster (Stängd 20120101), Telekommunikationssystem, TSLab (stängd 2012-01-01).
KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik.
2008 (engelsk)Inngår i: 2008 IEEE 19TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, NEW YORK: IEEE , 2008, 1214-1219 s.Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

We present an iterative joint scheduling-routing algorithm for characterizing the long-term performance of a cellular-relaying network. The physical layer model is based on ideal rate adaptation, fixed transmission power, and average interference. At the MAC layer, time-shares of a common channel are allocated to links in a CSMA/CA-like fashion. At the transport layer, one or more parallel routes can transfer the data flow from a source to the destination, and the average end-user rates are adjusted so as to maximize a global utility function. The general problem of allocating time-shares and selecting link rates is nonconvex. We propose an iterative algorithm and a novel approximation for the physical layer so as to obtain a convex formulation at each iteration step. If only one route is available per source, the problem admits a convex equivalent formulation and the iterative algorithm converges to the global optimum. If more routes per source are available, the problem remains nonconvex. However we show in a simple tractable example that the joint formulation yields sum-log-utility values comparable to the results obtained through exhaustive search of all possible route combinations.

sted, utgiver, år, opplag, sider
NEW YORK: IEEE , 2008. 1214-1219 s.
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-32269DOI: 10.1109/PIMRC.2008.4699627ISI: 000282721800235Scopus ID: 2-s2.0-69949179504ISBN: 978-1-4244-2643-0 (tryckt)ISBN: 978-142442644-7 OAI: oai:DiVA.org:kth-32269DiVA: diva2:409802
Konferanse
2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2008; Poznan; Poland; 15 September 2008 through 18 September 2008
Merknad

QC 20110411

Tilgjengelig fra: 2011-04-11 Laget: 2011-04-11 Sist oppdatert: 2014-11-03bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler

Andre lenker

Forlagets fulltekstScopus

Søk i DiVA

Av forfatter/redaktør
Timus, BogdanSoldati, Pablo
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 29 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf