Oblivious Routing for Sensor Network Topologies

DOI10.1007/978-3-642-14849-1_13zbMath1218.68194OpenAlexW164644525MaRDI QIDQ5391122

Jing Xi, Costas Busch, Malik Magdon-Ismail

Publication date: 5 April 2011

Published in: Monographs in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14849-1_13

zbMATH Keywords

geometric networksmesh networksoblivious routing algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (1)

Balancing Traffic Load Using One-Turn Rectilinear Routing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Congestion, dilation, and energy in radio networks
• Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
• Routing, merging, and sorting on parallel models of computation
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
• Tight bounds for oblivious routing in the hypercube
• A Scheme for Fast Parallel Communication
• Shortest-Path Routing in Arbitrary Networks
• Optimal Oblivious Path Selection on the Mesh
• On-line load balancing with applications to machine scheduling and virtual circuit routing
• Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs
• Optimal oblivious routing in polynomial time

This page was built for publication: Oblivious Routing for Sensor Network Topologies