Laddar...
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...
Sparad:
| Huvudupphovsman: | |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Publicerad: |
Hindawi Publishing Corporation
2014
|
| Ämnen: | |
| Länkar: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4165744/ https://ncbi.nlm.nih.gov/pubmed/25258736 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1155/2014/815123 |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|