An Oblivious Routing Algorithm for 3D Mesh Networks to Achieve a New Worst-Case Throughput Bound.
Guang SunChia-Wei ChangBill LinLieguang ZengPublished in: IEEE Embed. Syst. Lett. (2012)
Keyphrases
- routing algorithm
- d mesh
- worst case
- network coding
- network resources
- packet delivery
- path selection
- upper bound
- ad hoc networks
- lower bound
- wireless sensor networks
- routing protocol
- multipath
- transmission delay
- interconnection networks
- shortest path
- message overhead
- wireless ad hoc networks
- d objects
- transmission range
- qos parameters
- qos routing
- network traffic
- network routing
- energy consumption
- wireless networks
- mobile nodes
- traffic load
- three dimensional
- multi hop
- shape descriptors
- real time
- response time
- base station
- geometric properties
- multicast tree
- network topology
- computer networks
- quality of service
- routing scheme
- traffic engineering
- qos requirements
- network structure
- viewpoint
- network on chip
- end to end delay