JOURNAL ARTICLE

Heuristic IG-TDMA protocol for underwater acoustic sensor networks

Abstract

In this paper, we design a heuristic interference-graph-based time division multiple access (IG-TDMA) protocol for underwater acoustic sensor networks (UW-ASNs) to improve the network performance. A general underwater communication scenario is considered for the protocol design, where the communication network topology is modeled as a three-dimensional (3D) scenario and the mobility of sensor nodes is also taken into consideration. In this protocol, we introduce a dynamic and flexible spatial reuse strategy and formulate the interference scenario as a dynamic interference graph according to the nodes' position distribution and a preset interference-free threshold. To achieve high spatial reuse efficiency with low computational complexity, we propose a heuristic interference graph clustering algorithm for the protocol. Simulations verify the performance advantages of our proposed protocol over the carrier sense multiple access with collision avoidance (CSMA/CA) protocol and the traditional TDMA protocol.

Keywords:
Time division multiple access Computer science Heuristic Computer network Protocol (science) Distributed computing Interference (communication) Carrier sense multiple access with collision avoidance Wireless sensor network Graph Cluster analysis Underwater acoustic communication Topology (electrical circuits) Real-time computing Underwater Throughput Engineering Wireless Theoretical computer science

Metrics

4
Cited By
1.27
FWCI (Field Weighted Citation Impact)
19
Refs
0.83
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Underwater Vehicles and Communication Systems
Physical Sciences →  Engineering →  Ocean Engineering
Energy Efficient Wireless Sensor Networks
Physical Sciences →  Computer Science →  Computer Networks and Communications
Energy Harvesting in Wireless Networks
Physical Sciences →  Engineering →  Electrical and Electronic Engineering

Related Documents

© 2026 ScienceGate Book Chapters — All rights reserved.