A New Worst-Case Throughput Bound for Oblivious Routing in Odd Radix Mesh Network.
Guang SunChia-Wei ChangBill LinPublished in: IEEE Comput. Archit. Lett. (2013)
Keyphrases
- mesh network
- worst case
- ad hoc networks
- wireless mesh networks
- multi hop
- upper bound
- routing algorithm
- routing protocol
- mobile ad hoc networks
- wireless ad hoc networks
- channel assignment
- network topology
- error bounds
- lower bound
- wireless networks
- ip networks
- np hard
- end to end delay
- multicast routing
- end to end
- routing problem
- shortest path
- computational complexity
- base station
- wireless sensor networks
- data transmission
- quality of service
- wifi