Hop-by-hop congestion control design with utility maximization in wireless ad hoc neworks

Kyung Mook Lim, Jeonghoon Mo, Seong Soon Joo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Wireless ad hoc network design with cross layer approach has been recently studied considering different layer information. Especially, the design of the optimal transport control protocol has been one of intensive research topics, but the issue is not fully addressed yet. Although researches on end-to-end semantics are prevailed in transport layer issue, relatively smaller scalability than wired networks and unreliable channel state give strong advantages on hop-by-hop approach. We consider the hop-by-hop congestion control algorithm with network utility optimization. We formulate and solve a new transport layer problem based on the hop-by-hop algorithm, which reaches the optimal rate point stably by jointly considering MAC layer and transport layer information. Simulation results show that the hop-by-hop congestion control has better performance on the aspect of the schedulability, stability, convergence speed and optimality.

Original languageEnglish
Title of host publication2006 IEEE 64th Vehicular Technology Conference, VTC-2006 Fall
Pages2088-2093
Number of pages6
DOIs
Publication statusPublished - 2006
Event2006 IEEE 64th Vehicular Technology Conference, VTC-2006 Fall - Montreal, QC, Canada
Duration: 2006 Sept 252006 Sept 28

Publication series

NameIEEE Vehicular Technology Conference
ISSN (Print)1550-2252

Other

Other2006 IEEE 64th Vehicular Technology Conference, VTC-2006 Fall
Country/TerritoryCanada
CityMontreal, QC
Period06/9/2506/9/28

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Hop-by-hop congestion control design with utility maximization in wireless ad hoc neworks'. Together they form a unique fingerprint.

Cite this