Relay Node Placement Considering Age of Information for Seafloor Optical Wireless Networks

In this paper, we consider the optimal placement problem in seafloor optical wireless networks. In a seafloor optical wireless network, data collected by sensors are forwarded to relay nodes and delivered to a sink node via multiple relay nodes. The performance of data delivery to the sink node depends greatly on the placement of relay nodes. Therefore, this paper formulates an optimization problem in which the objective function is to minimize information freshness, i.e., the age of information. Since this optimization problem is a mixed integer linear problem once the relay node locations are determined, we propose a relay node placement method using a genetic algorithm. In the proposed method, the placement position of the relay node is assumed to be a gene, and the fitness value is obtained by solving the mixed integer programming problem. Through the simulation experiments, we show that efficient data transfer can be achieved by using the proposed method for relay node placement.

Authors

Institutions

Publication Details

Published
2025-01-15
DOI
https://doi.org/10.1109/icoin63865.2025.10993158
Primary Topic
Age of Information Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Relay Node Placement Considering Age of Information for Seafloor Optical Wireless Networks

Jun Cheng, Takahiro Kodama, Hayato Taniguchi, Tomotaka Kimura et al.
Age of Information Optimization
article

Relay Node Placement Considering Age of Information for Seafloor Optical Wireless Networks

Jun Cheng, Takahiro Kodama, Hayato Taniguchi, Tomotaka Kimura, Nagisa Iwami
article en

Abstract

In this paper, we consider the optimal placement problem in seafloor optical wireless networks. In a seafloor optical wireless network, data collected by sensors are forwarded to relay nodes and delivered to a sink node via multiple relay nodes. The performance of data delivery to the sink node depends greatly on the placement of relay nodes. Therefore, this paper formulates an optimization problem in which the objective function is to minimize information freshness, i.e., the age of information. Since this optimization problem is a mixed integer linear problem once the relay node locations are determined, we propose a relay node placement method using a genetic algorithm. In the proposed method, the placement position of the relay node is assumed to be a gene, and the fitness value is obtained by solving the mixed integer programming problem. Through the simulation experiments, we show that efficient data transfer can be achieved by using the proposed method for relay node placement.

Doshisha University (JP), Kagawa University (JP)
Openalex Percentile: Top 90%
Age of Information Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.