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: | HyungJune Lee |
|---|---|
| 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!
|
Similar Items
-
Timely directional data delivery to multiple destinations through relay population control in vehicular ad hoc network
by: Seona Lee, et al.
Published: (2020-05-01) -
A Deadline-Aware and Distance-Aware Packet Scheduling Algorithm for Wireless Multimedia Sensor Networks
by: Lin Tang, et al.
Published: (2015-03-01) -
Selective Route Based on SNR with Cross-Layer Scheme in Wireless Ad Hoc Network
by: Istikmal, et al.
Published: (2017-01-01) -
A neighbor knowledge and velocity-based broadcast scheme for wireless ad hoc networks
by: Dingzhu Lu, et al.
Published: (2017-11-01) -
Wireless Ad Hoc Sensor Networks
by: Carlos León, et al.
Published: (2013-09-01)