Abstract
A new link scheduling approach for millimeter wave wireless mesh network is presented. The proposed link scheduling solution is designed to work together with a multiple overlapping spanning trees-based routing schemes on a mesh network topology. The link schedule computation will minimize the end-to-end delay along a subset of shortest-hop paths from non-gateway nodes to a gateway node of the mesh, where each path is obtained from one of the spanning trees. The link schedule itself consists of cyclic repetition of a vector of transmission sets, where a transmission set is a maximal collection of links that can be active simultaneously. Simultaneous activity of the links is limited by radio interference and by shared resources. Algorithms for the computation of the link schedule are provided and computational issues of the algorithms are discussed.
Published Version
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.
