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
Comparative Study of Price-based Resource Allocation Algorithms for Ad Hoc 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.
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, RTSLAB - Real-Time Systems Laboratory.
2006 (English)In: The 20th IEEE International Parallel and Distributed Processing Symposium,2006, Conference Proceedings: IEEE Computer Society , 2006Conference paper, Published paper (Refereed)
Abstract [en]

As mobile ad hoc networks provide a wide range of possibly critical services, providing quality of service guarantees becomes an essential element. Yet there is a limited understanding of the performance characteristics of different resource allocation algorithms. In particular, there is little work that comparatively studies different algorithms in the same traffc environment. Therefore we study two algorithms, adhoc-TARA and an algorithm based on the gradient projection method, for optimised bandwidth allocation in ad hoc networks under overload situations. The focus is on convergence properties and performance measured in terms of accumulated utility. The simulation results show that the gradient projection algorithm converges to an optimal solution even in large, dynamic networks, but that in such dynamic environments the convergence time can significantly influence the overall performance. In comparison, the near-optimal algorithm adhoc-TARA, which quickly adapts to changes in the state of the network, can exhibit superior performance. Further we illustrate how different parameter settings influence the performance of the algorithms. We conclude that finding an optimal allocation comes at a high price in the rapidly changing environments of ad hoc networks and that near-optimal allocation can be an ample alternative.

Place, publisher, year, edition, pages
Conference Proceedings: IEEE Computer Society , 2006.
Keyword [en]
distributed price-based resource allocation, algorithm comparison, ad hoc networks, gradient projection and TARA bidding algorithms
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-31000Local ID: 16689OAI: oai:DiVA.org:liu-31000DiVA: diva2:251823
Available from: 2009-10-09 Created: 2009-10-09

Open Access in DiVA

No full text

Authority records BETA

Luethi, MarcelNadjm-Tehrani, SiminCurescu, Calin

Search in DiVA

By author/editor
Luethi, MarcelNadjm-Tehrani, SiminCurescu, Calin
By organisation
The Institute of TechnologyRTSLAB - Real-Time Systems Laboratory
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 46 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