Price coordination method for congestion control in ad Hoc networks

Ya Ming Wang, Wei Qiang Xu, George Baciu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

Abstract

In this paper, the congestion control problem in Ad Hoc networks is represented as the nonlinear optimization problem, which is the network utility maximization with the capacity constraints based on the link's interference set describing the contention relationship between flows. Based on dual decomposition and gradient projection method, Price Coordination Approach (PCA) is proposed to solve this utility maximization problem. Also, Neighbor Set Approximation method (NSA) and Queue Size Estimation method (QSE) are proposed to implement PCA in NS2 simulator. The MATLAB-based simulation results illustrate that PCA can approach the globally optimal solution. The NS2-based simulation results demonstrated that PCA outperforms default TCP and ATCP to achieve the efficient and fair resource allocation in Ad Hoc networks.
Original languageEnglish
Title of host publicationChina-Ireland International Conference on Information and Communications Technologies, CIICT 2007
Pages683-690
Number of pages8
Edition529 CP
DOIs
Publication statusPublished - 1 Dec 2007
EventChina-Ireland International Conference on Information and Communications Technologies, CIICT 2007 - Dublin, Ireland
Duration: 28 Aug 200729 Aug 2007

Conference

ConferenceChina-Ireland International Conference on Information and Communications Technologies, CIICT 2007
Country/TerritoryIreland
CityDublin
Period28/08/0729/08/07

Keywords

  • Ad Hoc networks
  • Congestion control
  • Dual decomposition

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this