Oblivious routing for sensor network topologies

DOI10.1007/978-3-642-14849-1_13MaRDI QIDQ5391122zbMATH OpenOpenAlexFDO

Authors Costas Busch, Malik Magdon-Ismail, Jing Xi

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

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

Recommendations

• Online Packet Admission and Oblivious Routing in Sensor Networks
• Survey on oblivious routing strategies
• Optimal oblivious routing on \(d\)-dimensional meshes
• On the efficiency of routing in sensor networks
• Oblivious routing in directed graphs with random demands

Cites work

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

Cited in

(6)

• Balancing Traffic Load Using One-Turn Rectilinear Routing
• Survey on oblivious routing strategies
• On the efficiency of routing in sensor networks
• A stochastic analysis of a greedy routing scheme in sensor networks
• Online Packet Admission and Oblivious Routing in Sensor Networks
• Finding routes in anonymous sensor networks

This page was built for publication: Oblivious routing for sensor network topologies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5391122)