Research Article
Resource Allocation for D2D Communication in Multiservice Cellular Network
Algorithm 1
Dynamic Iterative Resource Allocation Based on Hungarian Algorithm (DRABH).
(1) | fordo | (2) | for do | (3) | ; | (4) | if and then | (5) | ; | (6) | Initialization: , , | (7) | repeat | (8) | Assign resource blocks to cell users through Hungarian algorithm; | (9) | for do | (10) | for do | (11) | ; | (12) | if then | (13) | ; | (14) | repeat | (15) | ; | (16) | for do | (17) | for to do | (18) | Calculate | (19) | Assign resource blocks to target users through Hungarian algorithm; | (20) | repeat | (21) | Update the interference received by each user according to equation (6); | (22) | fordo | (23) | ifandthen | (24) | ; | (25) | else ifandthen | (26) | ifthen | (27) | | (28) | else | (29) | | (30) | Do the same for ; | (31) | until; | (32) | untilor; | (33) | fortodo | (34) | if then | (35) | fortodo | (36) | ; | (37) | if all the assigned users meet the demands of SINR then | (38) | Break; | (39) | else | (40) | ; | (41) | The matching process in SB2 is the same as that in SB1 | (42) | until or no more users can communicate; |
|