Online Routing in Dynamic Wireless Ad Hoc Networks with QoS Constraints

Online Routing in Dynamic Wireless Ad Hoc Networks with QoS Constraints

In this paper, we focus on online energy-aware routing protocol design for routing request to meet various end-to-end latency constraints under the uncertainty/imprecision rates while the lifetime of network is maximized. In dynamic wireless ad hoc network with latency constraints, the online request is implemented if the algorithm fnd the min-max path from source to sink for it which satisfy network conditions. Pseudopolynomial algorithms and fully polynomial-time approximation schemes are proposed.