When deploying resource-intensive signal processing applications in wireless sensor or mesh networks, distributing processing blocks over multiple nodes becomes promising. Such distributed applications need to solve the placement problem (which block to run on which node), the routing problem (which link between blocks to map on which path between nodes), and the scheduling problem (which transmission is active when). We investigate a variant where the application graph may contain feedback loops and we exploit wireless networks? inherent multicast advantage. Thus, we propose Multicast-Aware Routing for Virtual network Embedding with Loops in Overlays (MARVELO) to find efficient solutions for scheduling and routing under a detailed interference model. We cast this as a mixed integer quadratically constrained optimisation problem and provide an efficient heuristic. Simulations show that our approach handles complex scenarios quickly.
翻译:当在无线传感器或网状网络中部署资源密集型信号处理应用程序时,在多个节点上分配处理区块就会大有希望。这种分布式应用程序需要解决定位问题(该区块将运行在哪个节点上 ) 、 路由问题(将各个区块连接到绘制节点之间的路径) 和排程问题(在哪个节点上进行传输时会有效) 。 我们调查一个变量,其中应用程序图可能包含反馈环,我们利用无线网络? 固有的多播种优势。 因此,我们提议多播种- 警告运行虚拟网络, 嵌入overlays的圈子( MARVELO), 以找到在详细干扰模式下有效的排程和路由解决方案。 我们将此作为一个混合的四重曲线限制优化问题, 并提供一个高效的超常问题。 模拟显示我们的方法能够快速处理复杂的情景 。