Research Article
Network Monitoring Information Collection in the SDN-Enabled Airborne Tactical Network
Algorithm 6
Buffer change-based time slot assignment.
Input: , , , M-info traffic information | Output: time-slots assignment result of M-info collection | 1. initialize , , ; | 2. ; | 3. Store the nodes in the network into except ; | 4. while there is a node’s buffer is not empty | 5. if there is node in whose buffer is not empty | 6. Sort the nodes in in decreasing order of the number of M-info packets needed to be transmitted; | 7. Take out a node say from , which has a nonempty buffer; | 8. Schedule link () respecting the transmission constraints; | 9. ; | 10. ; | 11. ; | 12. end if | 13. if there is a node in , which has a nonempty buffer; | 14. Find a node say in whose buffer is identified as | decreased; | 15. Find a child node of v say w whose buffer is not empty, and | schedule link () respecting the transmission constraints; | 16. ; | 17. ; | 18. ; | 19. ; | 20. end if | 21. end while |
|