Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks
Figure 1
Routing paths from stationary source (in the left bottom) to stationary destination (in the right top) in the usages of stationary and mobile paths. Routing cost and packet deadline constraint determine which routing path should be selected for effective data transportation.
(a) Routing path using the shortest stationary ad hoc route
(b) Routing path combined with stationary routes and mobile routes
