liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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
Utility-based Adaptive Resource Allocation in Hybrid Wireless Networks
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, RTSLAB - Real-Time Systems Laboratory.
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, RTSLAB - Real-Time Systems Laboratory.
Computer Science Department, University of North Carolina at Charlotte, NC.
Computer Science Department, University of North Carolina at Charlotte, NC.
2005 (English)In: The 2nd IEEE International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks QSHINE,2005, Conference Proceedings: IEEE Computer Society , 2005, 44- p.Conference paper, Published paper (Refereed)
Abstract [en]

Service availability in wireless networks is highly dependent on efficient resource allocation and guaranteed Quality of Service (QoS) amid overloads and failures. This paper addresses optimal bandwidth allocation in a hybrid network (cellular and ad hoc), where added reach through an ad hoc overlay is combined with the stability and essential services of a cellular network. The paper builds on a near optimal approach in which Resource-Utility functions are used as a means of adaptive delivery of QoS, user differentiation, and maximisation of system level utility. It distinguishes between non-adaptive, semi-adaptive, and fully adaptive applications. First, the global cellular bandwidth allocation (in the presence of multiple routes through ad hoc relays) is cast in terms of a Linear Programming problem. Second, a heuristic algorithm that has far lower computational overhead and accrues at worse 12% less than the utility of the optimal solution is presented. Both algorithms are implemented within a model of a hybrid network on top of the Jsim simulation environment. Comparative tudies are made to show effective load balancing and crash tolerance in the presence of a high traffic overload.

Place, publisher, year, edition, pages
Conference Proceedings: IEEE Computer Society , 2005. 44- p.
Keyword [en]
bandwidth allocation, wireless networks, utility-based optimisation
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-30998DOI: 10.1109/QSHINE.2005.63Local ID: 16687OAI: oai:DiVA.org:liu-30998DiVA: diva2:251821
Available from: 2009-10-09 Created: 2009-10-09

Open Access in DiVA

No full text

Other links

Publisher's full texthttp://www.ida.liu.se/~rtslab/publications/2005/curescu05qshine.pdf

Authority records BETA

Curescu, CalinNadjm-Tehrani, Simin

Search in DiVA

By author/editor
Curescu, CalinNadjm-Tehrani, Simin
By organisation
The Institute of TechnologyRTSLAB - Real-Time Systems Laboratory
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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