Hybrid resource allocation in wireless ad hoc networks

  • Authors:
  • Chen Liu;M. H. MacGregor;Janelle Harms;Candace Phelps

  • Affiliations:
  • Department of Computing Science, University of Alberta, Edmonton, Alberta;Department of Computing Science, University of Alberta, Edmonton, Alberta;Department of Computing Science, University of Alberta, Edmonton, Alberta;Department of Computing Science, University of Alberta, Edmonton, Alberta

  • Venue:
  • ICC'09 Proceedings of the 2009 IEEE international conference on Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Inefficient resource management may cause problems of reliability of service in shared medium wireless networks. Resources include bandwidth, processor cycles and buffers. Excessive competition for these resources can cause severe packet collision rates, compound network congestion, or even result in starvation of some nodes. In such a situation, data transmission is subject to very long delays and significant packet losses. Although transport layer protocols can help improve end-to-end performance, these approaches are slow in responding to network changes and incur additional overhead. This paper aims to reduce transmission delay and increase packet delivery ratio. A hybrid resource allocation problem is formulated by the Primal algorithm and a controller is derived to decrease congestion globally and to reduce collisions locally. Our simulation results show that this hybrid controller can achieve packet loss rates close to 1% and significantly shorten end-to-end delay even in a high interference environment with heavy system load. In addition, we also compare the performance of the hybrid controller with the impact of multipath routing. The accuracy of our simulation is improved by adding a probabilistic preamble detection model and SINR collision model based on frame error rate.