Research Article
Hierarchical Combinatorial Auction in Computing Resource Allocation for Mobile Blockchain
Algorithm 3: A greedy algorithm for solving the WDP for CCSP.
1.Initialization: set for each MESP | 2. For submitted bid for each MESP , calculate “bid density”. Reorder the MESPs’ bid in a descending order: | | 3. Allocate computing resources to corresponding MESPs until the CCSP do not have enough resources and set relative . |
|
Algorithm 3: A greedy algorithm for solving the WDP for CCSP. |