dc.contributor.author | Campagnaro, Filippo | |
dc.contributor.author | Casari, Paolo | |
dc.contributor.author | Zorzi, Michele | |
dc.contributor.author | Diamant, Roee | |
dc.date.accessioned | 2021-07-13T09:35:35Z | |
dc.date.available | 2021-07-13T09:35:35Z | |
dc.date.issued | 2019-04 | |
dc.identifier.issn | 2162-2337 | |
dc.identifier.uri | http://hdl.handle.net/20.500.12761/624 | |
dc.description.abstract | We describe a scheduling protocol for multimodal networks of relatively limited size, whose nodes encompass various underwater communication technologies. For such a case, we show that significant improvement in the network operations is possible when the transmission schedule is set to jointly utilize all communication technologies. Our solution is based on per-technology TDMA frames, whose time slots are determined optimally to maximize the overall channel utilization while preserving flow limitations and maintaining fairness in resource allocation. Our numerical simulations and experimental results \remembertext{phy}{for multimodal networks with several acoustic technologies} show that, while maintaining a fair resource allocation, our scheduling solution provides both high throughput and low packet delivery delay. | |
dc.language.iso | eng | |
dc.publisher | IEEE Communications Society | |
dc.title | Optimal Transmission Scheduling in Small Multimodal Underwater Networks | en |
dc.type | journal article | |
dc.journal.title | IEEE Wireless Communications Letters | |
dc.type.hasVersion | VoR | |
dc.rights.accessRights | open access | |
dc.volume.number | 8 | |
dc.issue.number | 2 | |
dc.identifier.doi | https://doi.org/10.1109/LWC.2018.2873329 | |
dc.page.final | 371 | |
dc.page.initial | 368 | |
dc.subject.keyword | Underwater communication networks | |
dc.subject.keyword | underwater acoustic communications | |
dc.subject.keyword | multi-modal systems | |
dc.subject.keyword | transmission scheduling | |
dc.description.status | pub | |
dc.eprint.id | http://eprints.networks.imdea.org/id/eprint/1894 | |