We present a spatial reuse resource allocation scheme for underwater acoustic networks that organizes communications so as to avoid destructive collisions. One prime source of collisions in underwater acoustic networks is the so called near-far effect, where a node located farther from the receiver is jammed by a closer node. While common practice considers such a situation a challenge, in this paper we consider it a resource, and use it to increase the network throughput of spatial-reuse time-division multiple access. Our algorithm serves two types of communications: (1) contention-free and (2) opportunistic. Our objective is to maximize the time slot allocation, while guaranteeing a minimum per-node packet transmission rate. The result is an increase in the number of contention-free packets received, and a decrease in the scheduling delay of opportunistic packets. Numerical results show that, at a slight cost in terms of fairness, our scheduling solutions achieve higher throughput and lower transmission delay than benchmark spatial-reuse scheduling protocols. These results are verified in a field experiment conducted in the Garda Lake, Italy, where we demonstrated our solution using off-the-shelf acoustic modems. To allow the reproducibility of our results, we publish the implementation of our proposed algorithm.

Leveraging the Near-Far Effect for Improved Spatial-Reuse Scheduling in Underwater Acoustic Networks

Diamant, Roee;Casari, Paolo;Campagnaro, Filippo;Zorzi, Michele
2017

Abstract

We present a spatial reuse resource allocation scheme for underwater acoustic networks that organizes communications so as to avoid destructive collisions. One prime source of collisions in underwater acoustic networks is the so called near-far effect, where a node located farther from the receiver is jammed by a closer node. While common practice considers such a situation a challenge, in this paper we consider it a resource, and use it to increase the network throughput of spatial-reuse time-division multiple access. Our algorithm serves two types of communications: (1) contention-free and (2) opportunistic. Our objective is to maximize the time slot allocation, while guaranteeing a minimum per-node packet transmission rate. The result is an increase in the number of contention-free packets received, and a decrease in the scheduling delay of opportunistic packets. Numerical results show that, at a slight cost in terms of fairness, our scheduling solutions achieve higher throughput and lower transmission delay than benchmark spatial-reuse scheduling protocols. These results are verified in a field experiment conducted in the Garda Lake, Italy, where we demonstrated our solution using off-the-shelf acoustic modems. To allow the reproducibility of our results, we publish the implementation of our proposed algorithm.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/3258278
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 31
  • ???jsp.display-item.citation.isi??? 22
  • OpenAlex ND
social impact