Font Size: a A A

Research On The Distributed Algorithm For Bandwidth Allocation In Heterogeneous Wireless Networks

Posted on:2017-04-21Degree:MasterType:Thesis
Country:ChinaCandidate:J XieFull Text:PDF
GTID:2308330488964496Subject:Communication and Information System
Abstract/Summary:PDF Full Text Request
Heterogeneous wireless networks (HWNs) have been gradually emerging with-the rapid development of a variety of wireless communication technologies. Wireless resource management is directly related to the optimal use of resources for network and the quality of service (QoS) for users. This dissertation focuses on the bandwidth allocation based on the control of distributed resource management as follows.A distributed adaptive bandwidth allocation algorithm based on reserved bandwidth threshold and traffic transmission levels was proposed to deal with the resource allocation of multi-services in heterogeneous wireless networks. According to the multi-homing technology of mobile terminal and the distributed resource management model of heterogeneous networks, the studied problem was formulated as a convex optimization problem by building the network utility function of traffic under the transmission quality of service (QoS) requirements and traffic capacity constraints. An optimal bandwidth allocation matrix was obtained by a dynamic optimization iterative algorithm under the adaptive adjustment of reserved bandwidth threshold and traffic transmission levels with the change of the customer traffic access request. Additionally, a sub-optimal distributed algorithm was described to reduce the high signaling overhead, which was incurred by applying the optimal distributed algorithm to the dynamic heterogeneous systems. Numerical results demonstrate that the proposed algorithm can maximize the network utility function and reduce the new calls blocking probability as well as guaranteeing the lower communication cost and QoS requirements. However, the resource would be allocated and shared efficiently by applying the sub-optimal distributed algorithm to the dynamic HWNsA Stackelberg games-based distributed bandwidth algorithm of pricing for QoS requirements of multi-services was proposed to deal with bandwidth allocation based on user’s QoS requirements. According to the mechanism of bandwidth resource market trading and game theory, the studied problem was formulated as a multi-leader multi-follower Stackelberg games model between resource providers (Internet Service Providers) and resource consumers (User Equipments). The two-tier game equilibrium was obtained by distributed iterating the strategy of network price and the strategy of bandwidth request between the operators and users. Numerical results demonstrate that the proposed algorithm can improve network throughput and user benefits and is benefit for the transmission of stable traffic QoS requirements as well as guaranteeing the lower communication cost and different QoS requirements.
Keywords/Search Tags:heterogeneous wireless networks, bandwidth allocation, distributed solutions, quality of service, utility function
PDF Full Text Request
Related items