Routing Methods and Scheduling Patterns in MIMO WMN Virtual Model

Abstract

Multi-input multi-output wireless mesh networks (MIMO WMNs) act as backbone broadband networks for ubiquitous access. Topology model is a crucial factor in interference avoidance, simplifying channel allocation, and discussing optimal scheduling and routing. Cartesian product of graphs (CPG) is introduced for MIMO WMN as a virtual topology. By putting orthogonal channels into different channel layer meshes, some conclusions are explored on channel allocation, routing and scheduling. A path coherent realization is composed of combinatorial edges over multiple channels for all hops. Some important property propositions in CPG are also given, such as path hops with node address and path number counting. Practical mesh node addressing scheme and path number counting theorems are useful virtual topology properties.