Virtual Mapping of Software Defined Wireless Network Based on Topological Perception

Li, Muxuan; Wang, Xiaojuan; Chen, Shifang; Song, Mei; Ma, Yuchun

doi:10.1007/978-3-319-31854-7_22

Cited by 2 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Second, we ensure node mapping and adequate wireless communication in constraints ( 5) - (8). In ( 5) and ( 6), we ensure that a processing block is placed only once (p src is placed on all source nodes and p sink is placed on v sink ) and the nodes' capacity constraints are not violated.…”

Section: Optimisation Problemmentioning

confidence: 99%

See 1 more Smart Citation

MARVELO: Wireless virtual network embedding for overlay graphs with loops

Afifi

Auroux

Karl

2018

2018 IEEE Wireless Communications and Networking Conference (WCNC)

View full text Add to dashboard Cite

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.• We support overlay graphs with loops, as often found in signal processing applications. • We leverage the wireless multicast advantage as typical signal processing applications sending the same data to multiple receivers (e.g., in loops). • When scheduling wireless transmission, we consider interference from all sending nodes.

show abstract

Section: Optimisation Problemmentioning

confidence: 99%

“…Also, a node is allowed either to transmit or receive in a given time slot (i.e., half-duplex radios). In (8), we have our only quadratic constraint, which allows transmissions from node v to v if the SINR at v is bigger than or equal to SINR th . In this check, we consider interference from all nodes except node v.…”

Section: Optimisation Problemmentioning

confidence: 99%