Cross-layer optimization of wireless networks

Pao Yue-kong Library Electronic Theses Database

Cross-layer optimization of wireless networks


Author: Feng, Wei
Title: Cross-layer optimization of wireless networks
Degree: Ph.D.
Year: 2011
Subject: Wireless communication systems -- Design and construction.
Hong Kong Polytechnic University -- Dissertations
Department: Dept. of Computing
Pages: xvi, 184 p. : ill. ; 30 cm.
Language: English
InnoPac Record:
Abstract: Existing wireless network is designed based on the layered network structure. This strict layered network structure limits the flexibility of protocol design. In this dissertation, we investigate the methodology of cross-layer optimization and utilize it to optimize various wireless networks. Specifically speaking, we make three original contributions in this dissertation. First, we design and implement the first cooperative QoS routing protocol in cooperative multi-hop wireless network. Existing works about cooperative QoS routing did not consider the interference effect among links, and only evaluate their algorithms through simulations. This paper targets at designing and implementing an interference-aware Cooperative QoS routing protocol (CQ-routing) in the real testbed. We formulate the problem of finding cooperative routing path with maximum available bandwidth as an optimization problem, called Coop-routing problem. We prove that the Coop-routing problem is strong NP-hard. We propose both centralized and distributed approximation algorithms to solve the Coop-routing problem. We design and implement a CQ-routing protocol in wireless mesh network testbed and evaluate its performance through both experiments and simulations. The results show that CQ-routing protocol can significantly improve the network performance in terms of available bandwidth and number of admitter flows.
Second, we propose the first multi-link spectrum handoff scheduling algorithms for multi-hop cognitive network. Existing work only considered the problem of minimizing spectrum handoff delay of a single link in single-hop cognitive networks, referred to as the SH-SLSH problem. We study a more challenging problem in which multiple links perform spectrum handoff in multi-radio multi-hop cognitive networks (referred to as the SH-MLMH problem). The SH-MLMH problem targets at minimizing the Total Handoff Completion Time (THCT) while maintaining the network connectivity. The THCT is defined as the time for all the links to finish spectrum handoff. We prove that SH-MLMH problem is NP-hard. We propose both centralized and distributed algorithms to solve it. The simulation results show that our proposed solution can significantly improve the network throughput and reduce the THCT. Third, we study the non-cooperative channel and bandwidth allocation problem in multi-radio multi-channel wireless network. Existing works ignored two important issues, impact of traffic load to channel’s transmission quality, and difference of band-width demands for different node pairs. To address these two issues, we extend the problem of non-cooperative multi-radio channel allocation to Non-cooperative Joint Channel and Bandwidth Allocation problem (NJCBA), in which node pairs need to consider not only allocating radios to channels, but also allocating bandwidth to selected channels to maximize its own benefit. We prove that there exist pure Nash Equilibriums (NEs) for the NJCBA game. We also analyze the efficiency of the NEs for NJCBA game, and prove that these NEs can achieve a constant Price Of Anarchy (POA). We design two distributed algorithms, to enable node pairs to converge to a pure NE. The simulation results show that these two algorithms can improve the system throughput by 2 or 3 times compared with a greedy allocation algorithm.

Files in this item

Files Size Format
b24624913.pdf 3.093Mb PDF
Copyright Undertaking
As a bona fide Library user, I declare that:
  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.


Quick Search


More Information