RESOURCE ALLOCATION IN WIRELESS NETWORKS

Open Access
Author:
Shin, Jaesheung
Graduate Program:
Computer Science and Engineering
Degree:
Doctor of Philosophy
Document Type:
Dissertation
Date of Defense:
February 28, 2007
Committee Members:
  • Thomas F Laporta, Committee Chair
  • Guohong Cao, Committee Member
  • John Metzner, Committee Member
  • Aylin Yener, Committee Member
  • Sencun Zhu, Committee Member
Keywords:
  • load balancing
  • multi-hop wireless relay network
  • wireless mesh networks
  • wireless cellular networks
  • resource allocation
  • link channelization
  • routing
  • network formation
Abstract:
The critical design issues for wireless networks include provisioning of seamless communication with Quality-of-Service (QoS) guarantees, improved service accessibility, reliable data transfer, and high communication performance. However, limited bandwidth and processing power of the network elements and scarce, and time/location-dependent radio resources make the design space much more complex and challenging. The overall objective of this research is to design and analyze the resource allocation schemes for wireless networks that can provide high communication performance. Driven by two main evolution issues in wireless cellular networks, core network evolution to all-IP wireless networks and radio access network evolution to high-capacity wireless networks based on multi-frequency, multi-hop transmission, in this research we investigate two kinds of resource allocation in wireless networks: network resource allocation and radio resource allocation. The resource allocation algorithms proposed in this research focus on perfect load balancing across each network element and dynamic multi-hop relay network formation in wireless cellular and wireless mesh network environment. The relay network formation includes path discovery to a GW or a relay mesh router, path selection, frequency allocation, and local tuning to reduce interference in resulting relay networks further. The advantages of these algorithms are demonstrated through extensive simulation. The results show that the algorithms achieve significantly improved throughput gain.