Abstract
In this letter, we prove that both the centralized and distributed routing schedule problems are NP-complete in 2D Mesh topology, which further enhance the complexity result of the routing schedule problem based on the complexity theory. Moreover, we prove that the Minimum Path Stretch Schedule (MIN-PSS), Maximum Path Contraction Schedule (MAX-PCS) and Maximum Constant Path Schedule (MAX-CPS) problems are NP-hard in predictable dynamic networks. Our conclusions provide the theoretical significance for the routing optimization.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
