TY - GEN
T1 - Location-free link state routing for underwater acoustic sensor networks
AU - Barbeau, Michel
AU - Blouin, Stephane
AU - Cervera, Gimer
AU - Garcia-Alfaro, Joaquin
AU - Kranakis, Evangelos
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/6/19
Y1 - 2015/6/19
N2 - We propose a location-free link state routing protocol for Underwater Acoustic Sensor Networks (UASNs). Additionally, we present the mathematical background for the theoretical capacity and transmission power metrics of an underwater acoustic channel. UASNs are formed by devices enabled with acoustic communication capabilities that are deployed underwater to perform collaborative monitoring tasks. Information is collected by a sink at the surface also equipped with a radio. The underwater communication channel is characterized by a limited bandwidth and high propagation delay. The network topology constantly changes due to mobility of the nodes. In our routing protocol, every node ranks the quality of the path that it offers toward the sink. Packet forwarding is performed hop-by-hop considering one or several routing metrics, e.g., hop count or pressure. To avoid communication void problems, every node selects a one-hop neighbor within an area that guarantees progress toward a sink. Our strategy is loop-free. It includes a recovery mode handling network topology changes. Our routing protocol was implemented in ns-3 to conduct experiments.
AB - We propose a location-free link state routing protocol for Underwater Acoustic Sensor Networks (UASNs). Additionally, we present the mathematical background for the theoretical capacity and transmission power metrics of an underwater acoustic channel. UASNs are formed by devices enabled with acoustic communication capabilities that are deployed underwater to perform collaborative monitoring tasks. Information is collected by a sink at the surface also equipped with a radio. The underwater communication channel is characterized by a limited bandwidth and high propagation delay. The network topology constantly changes due to mobility of the nodes. In our routing protocol, every node ranks the quality of the path that it offers toward the sink. Packet forwarding is performed hop-by-hop considering one or several routing metrics, e.g., hop count or pressure. To avoid communication void problems, every node selects a one-hop neighbor within an area that guarantees progress toward a sink. Our strategy is loop-free. It includes a recovery mode handling network topology changes. Our routing protocol was implemented in ns-3 to conduct experiments.
UR - https://www.scopus.com/pages/publications/84938373309
U2 - 10.1109/CCECE.2015.7129510
DO - 10.1109/CCECE.2015.7129510
M3 - Conference contribution
AN - SCOPUS:84938373309
T3 - Canadian Conference on Electrical and Computer Engineering
SP - 1544
EP - 1549
BT - 2015 IEEE 28th Canadian Conference on Electrical and Computer Engineering, CCECE 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2015 28th IEEE Canadian Conference on Electrical and Computer Engineering, CCECE 2015
Y2 - 3 May 2015 through 6 May 2015
ER -