Throughput of Networks With Large Propagation Delays

Chitre, Mandar; Motani, Mehul; Shahabudeen, Shiraz

doi:10.1109/joe.2012.2203060

Cited by 80 publications

(62 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In high traffic scenarios, packet collisions of MUASNs not only severely degrade network throughput, but also cause intolerably long latency due to uncertain number of retransmissions. On the other hand, contention-free MAC protocols [22][23][24][25][26][27][28][29][30][31][32][33][34][35][36][37] are significantly superior to contention-based ones in high traffic scenarios because the medium is orthogonalized in a certain domain.…”

Section: Introductionmentioning

confidence: 99%

“…However, this large propagation delay is being re-interpreted rather positively, and TDMA approaches in MUASN are considered to be one of the most efficient MAC protocols. In particular, spatial reuse MACs [28][29][30][31][32][33][34][35][36][37] take advantage of a large propagation delay for concurrent transmissions without collisions at receivers by considering possible interferences from neighbor nodes.…”

Section: Introductionmentioning

confidence: 99%

“…Spatial reuse MACs that operate in a distributed manner [29][30][31][32][33][34] make concurrent multiple connections as frequently as possible, and show significantly improved throughput. However, it is not easy to operate these distributed methods in a centralized manner without sacrificing performance.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Asymmetric Propagation Delay-Aware TDMA MAC Protocol for Mobile Underwater Acoustic Sensor Networks

et al. 2018

View full text Add to dashboard Cite

Abstract:The propagation delay in mobile underwater acoustic sensor network (MUASN) is asymmetric because of its low sound propagation speed, and this asymmetry grows with the increase in packet travel time, which damages the collision avoidance mechanism of the spatial reuse medium access control (MAC) protocols for MUASN. We propose an asymmetric propagation delay-aware time division multiple access (APD-TDMA) for a MUASN in which periodic data packet transmission is required for a sink node (SN). Collisions at the SN are avoided by deferring data packet transmission after reception of a beacon packet from the SN, and data packets are arrived at the SN in a packet-train manner. The time-offset, which is the time for a node to wait before the transmission of a data packet after reception of a beacon packet, is determined by estimating the propagation delay over two consecutive cycles such that the idle interval at the SN is minimized, and this time-offset is announced by the beacon packet. Simulation results demonstrate that the APD-TDMA improves the channel access delay and the channel utilization by approximately 20% and 30%, respectively, compared with those of the block time bounded TDMA under the given network conditions.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Asymmetric Propagation Delay-Aware TDMA MAC Protocol for Mobile Underwater Acoustic Sensor Networks

et al. 2018

View full text Add to dashboard Cite

show abstract

“…The long propagation delay of the acoustic waves allows the nodes to overlap their transmissions in time without collisions. The idea of exploiting the time overlapping of travelling waves to increase the throughput in TDMA networks has been already proposed [6,13,14]. It has been successfully applied to several topologies, like a grid mesh of sensors [15] or in a linear network [16], by means of dynamic linear programming.…”

Section: Introductionmentioning

confidence: 99%

“…Nevertheless, these methods, based on a sequential decision problem slot by slot, are far from easy to implement in networks with a medium/large number of nodes. A new function to obtain a figure of merit of the vector of the states, denoted reward in [13], must be optimized by iteration for each network size. In these networks, the main drawback is the need to ascertain an efficient and simple algorithm to determine the optimal schedule with low complexity.…”

Section: Introductionmentioning

confidence: 99%

Optimal Scheduling and Fair Service Policy for STDMA in Underwater Networks with Acoustic Communications

Luque-Nieto

Moreno-Roldán

Otero

et al. 2018

Sensors

View full text Add to dashboard Cite

In this work, a multi-hop string network with a single sink node is analyzed. A periodic optimal scheduling for TDMA operation that considers the characteristic long propagation delay of the underwater acoustic channel is presented. This planning of transmissions is obtained with the help of a new geometrical method based on a 2D lattice in the space-time domain. In order to evaluate the performance of this optimal scheduling, two service policies have been compared: FIFO and Round-Robin. Simulation results, including achievable throughput, packet delay, and queue length, are shown. The network fairness has also been quantified with the Gini index.

show abstract

Graph‐based optimal asynchronous scheduling in large propagation delay underwater acoustic sensor networks

Mridula

Ameer

2020

Int J Communication

View full text Add to dashboard Cite

Summary Optimal scheduling is essential to minimize the time wastage and maximize throughput in high propagation delay networks such as in underwater and satellite communication. Understanding the drawbacks of synchronous scheduling, this paper addresses an asynchronous optimal scheduling problem to minimize the time wastage during the transmission. The proposed scheduling problem is analyzed in both broadcast and non‐broadcast networks, which is highly applicable in high propagation delay networks. In broadcast networks, the proposed scheduling method reduces to a graph‐theoretic model that is shown to be equivalent to the classic algorithmic asymmetric traveling salesman problem (TSP) which is NP‐Hard. Although it is NP‐Hard, the TSP is well‐investigated with many available methods to find the best solution for up to tens of thousands of nodes. In non‐broadcast networks, the optimal solution to the scheduling problem considers the possibility of parallel transmission, which is optimized using graph coloring algorithm. The groups obtained through graph coloring are solved using Asymmetric Traveling Salesman algorithm to obtain the optimal schedule. The proposed method efficiently solves the scheduling problem for networks of practical size.

show abstract

Throughput of Networks With Large Propagation Delays

Cited by 80 publications

References 19 publications

Asymmetric Propagation Delay-Aware TDMA MAC Protocol for Mobile Underwater Acoustic Sensor Networks

Asymmetric Propagation Delay-Aware TDMA MAC Protocol for Mobile Underwater Acoustic Sensor Networks

Optimal Scheduling and Fair Service Policy for STDMA in Underwater Networks with Acoustic Communications

Graph‐based optimal asynchronous scheduling in large propagation delay underwater acoustic sensor networks

Contact Info

Product

Resources

About