Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks

Abstract EN

We present a greedy data transportation schemewith hard packet deadlines in ad hoc sensor networks of stationarynodes and multiple mobile nodes with scheduled trajectorypath and arrival time.

In the proposed routing strategy, eachstationary ad hoc node en route decides whether to relay ashortest-path stationary node toward destination or a passing-bymobile node that will carry closer to destination.

We aim toutilize mobile nodes to minimize the total routing cost as far asthe selected route can satisfy the end-to-end packet deadline.

We evaluate our proposed routing algorithm in terms ofrouting cost, packet delivery ratio, packet delivery time, andusability of mobile nodes based on network level simulations.

Simulation results show that our proposed algorithm fullyexploits the remaining time till packet deadline to turn intonetworking benefits of reducing the overall routing cost andimproving packet delivery performance.

Also, we demonstratethat the routing scheme guarantees packet delivery with harddeadlines, contributing to QoS improvement in various networkservices.