Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks
We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortes...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/815123 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We present a greedy data transportation scheme
with hard packet deadlines in ad hoc sensor networks of stationary
nodes and multiple mobile nodes with scheduled trajectory
path and arrival time. In the proposed routing strategy, each
stationary ad hoc node en route decides whether to relay a
shortest-path stationary node toward destination or a passing-by
mobile node that will carry closer to destination. We aim to
utilize mobile nodes to minimize the total routing cost as far as
the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of
routing cost, packet delivery ratio, packet delivery time, and
usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully
exploits the remaining time till packet deadline to turn into
networking benefits of reducing the overall routing cost and
improving packet delivery performance. Also, we demonstrate
that the routing scheme guarantees packet delivery with hard
deadlines, contributing to QoS improvement in various network
services. |
|---|---|
| ISSN: | 2356-6140 1537-744X |