Comparative study of price-based resource allocation algorithms for ad hoc networks

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 traffic 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 ...

• Type: Conference
• Year: 2006
• Where: IPPS
• Authors: Marcel Lüthi, Simin Nadjm-Tehrani, Calin Curescu
• Keywords: Ad Hoc Networks, Distributed And Parallel Computing, Gradient Projection, IPPS 2006, Mobile Ad Hoc Networks