Method for allocating bandwidths in multi-user single relay communication system

Abstract

The invention provides a method for allocating bandwidths in a multi-user single relay communication system. The method includes the steps that when multiple users exist in a region, part of users can be directly connected with APs to become a relay, and part of the users need to be connected with relay users to acquire data services; when the users enter a common local area network region, user revenue functions are discretized according to the user revenue functions and relay consumption functions, and a bandwidth allocation algorithm is utilized to select an optimum bandwidth allocation strategy to allocate the bandwidths; meanwhile, the limitation of the maximum service bandwidth of the relay and the minimum required bandwidth of the users is considered, the users who have little benefit to a network are removed under the appropriate condition, new users who have higher benefits are connected, and bandwidth allocation of a whole cluster is updated; when the users leave, the bandwidths are released, and the bandwidth allocation is updated.

Description

technical field [0001] The invention relates to the field of wireless communication, in particular to a bandwidth allocation method in a multi-user single-relay communication system. Background technique [0002] With the development of wireless local area network (WLAN), mobile users can access the Internet to obtain information, browse webpages and read emails anytime and anywhere by connecting to the access point AP. However, some users cannot access the Internet due to reasons such as limited AP connection range and poor signal strength. At this time, multi-hop access can solve this problem very well, that is, users within the signal coverage of the AP directly access the AP to become a relay, and those users who cannot directly connect to the AP can connect to the surrounding Relay to obtain Internet service indirectly. [0003] The cooperation modes of each node in WLAN are generally divided into two types: cooperative type and selfish type. In a cooperative scenari...

AI Technical Summary

Problems solved by technology

However, the main purpose of this pricing strategy is to maximize the interests of service providers. It does not consider the end user's affordability and service requirements, and also ignores the characteristics of the RUN network, such as the role change of ordinary users or relays.

Images