Relay Network Bandwidth Allocation Method Based on Auction Game in Congested Network
A bandwidth allocation method and relay network technology, which is applied in the field of relay network bandwidth allocation based on auction game, can solve the problem of low quality of long-distance communication services, and achieve the effect of expanding the scope of services and expanding the quality of services
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0052] In order to overcome the problem of low data quality caused by long distance or heavy load, the present invention considers the use of relays to assist in forwarding data, and relay cooperative communication scenarios such as figure 1 shown. In the figure, there is an operator, multiple users, and multiple candidate relays, among which relay devices can earn profits by providing data transmission services. The specific agreement process is as follows:
[0053] (1) The relay pays a deposit to the operator, joins the communication network, and becomes a relay candidate ( figure 1 Funding link in A);
[0054] (2) The user sends a data (video) download request to the operator;
[0055] (3) The operator broadcasts the data forwarding requirements to all relay candidates. After multiple auction interactions between the relay and the operator, the operator selects the most suitable relay that is not busy and close to the end user. The operator Allocate bandwidth resources ...
Embodiment 2
[0125] In this embodiment, it is assumed that there are 3 relays and 1 operator in the auction process, and the algorithm proposed by the present invention is also applicable to scenarios with many relays and relays. The noise is initially N 0 =10 -14 W / Hz, signal transmission power E b =37dBm, channel gain G b =0.999, total bandwidth B s = 1MHz, active factor α = 1, compromise factor k 2 = 2, the relay expenditure per unit bandwidth is θ = 7.5, the upper bound of the unit price and the Nether Maximum number of iterations t max It is set to 15, and the bandwidth update step ε is set to 1000.
[0126] The proposed dynamic non-fixed pricing scheme (Non-EP) subtly helps the relay to find the optimal unit price for bandwidth allocation according to its initial requested unit price and step size. In order to compare with the simulation results of the algorithm proposed by the present invention, here is a performance comparison with the currently popular fixed price scheme...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More