Research Article
Multistage Dynamic Packet Access Mechanism of Internet of Things
Algorithm 3
Dynamic niche-based shuffled frog-leaping algorithm (DNSFLA).
(1) | Initialize and | (2) | for do | (3) | Calculate , and | (4) | end for | (5) | repeat | (6) | Descending and record the best solution | (7) | for do | (8) | Calculate and , put into niche group | (9) | Choose and | (10) | Search using Algorithm 1 | (11) | repeat | (12) | Update using Algorithm 2 | (13) | | (14) | until | (15) | Calculate the variation of , recorded as | (16) | if then | (17) | Initiated randomly | (18) | else | (19) | Reshuffle the solutions of all subgroups | (20) | end if | (21) | end for | (22) | | (23) | until |
|