Fast Cell Scheduling Negotiation Algorithm in HSDPA

Traditional fast cell scheduling algorithm (FCS) in HSDPA is mainly based on the switch request, passively allocate the bandwidth. Based on the access consumerspsila apperceive, we start the research from the development background of FCS algorithm and its main localization. The negotiation analysis is divided into three steps, the first is among neighbor cells, the second is among the original ones and the aim switch cell set, the third is the best matching algorithm of FCS activation set by roam consumers to confirm the ultimately switch cell resource engross obligate. And the best matching algorithm of FCS with more impartial based on the equilibrium exclusive asymmetry Nash competition is thus established.