Study of the I-SAND Protocol based on Temporal Serialization Scheme in Underwater Optical Networking

LI Yanlong; LI Kaiwen; WANG Bing; WANG Tuyang

doi:10.13756/j.gtxyj.2026.250304

您当前的位置：

首页 >

文章列表页 >

Study of the I-SAND Protocol based on Temporal Serialization Scheme in Underwater Optical Networking

更新时间：2026-04-20

- Study of the I-SAND Protocol based on Temporal Serialization Scheme in Underwater Optical Networking
- Study on Optical Communications Issue 2, (2026)
- 作者机构：
  
  桂林电子科技大学　认知无线电与信息处理教育部重点实验室，广西　桂林　541004
- 作者简介：
- 基金信息：
- DOI：10.13756/j.gtxyj.2026.250304
  CLC： TN929
- Received：16 September 2025，
  
  Revised：2025-10-24，
  
  Published：10 April 2026
- 稿件说明：
移动端阅览
李燕龙，李楷文，王兵，等. 基于时序串行化的水下光网络I-SAND协议研究[J]. 光通信研究，2026(2): 250304.

Li Y L, Li K W, Wang B, et al. Study of the I-SAND Protocol based on Temporal Serialization Scheme in Underwater Optical Networking[J]. Study on Optical Communications, 2026(2): 250304.
李燕龙，李楷文，王兵，等. 基于时序串行化的水下光网络I-SAND协议研究[J]. 光通信研究，2026(2): 250304. DOI： 10.13756/j.gtxyj.2026.250304.

Li Y L, Li K W, Wang B, et al. Study of the I-SAND Protocol based on Temporal Serialization Scheme in Underwater Optical Networking[J]. Study on Optical Communications, 2026(2): 250304. DOI： 10.13756/j.gtxyj.2026.250304.

摘要

目的

随着海洋探测和国防安全等领域对水下多节点协同作业需求的增长，基于发光二极管（LED）的水下光组网技术因具有高带宽和低延迟等优势受到广泛关注。为解决光的定向辐射与自主式水下航行器（AUV）等节点移动性带来的邻居发现难问题，文章提出了基于时序串行化的改进型扇区天线邻居发现（I-SAND）协议。

方法

该协议将邻居发现过程分为3个阶段：在Improved-Hone-in阶段，通过发射周期性Hone-in信标与文章提出的信标应答机制协同工作，实现节点间时序对齐、扇区对准和邻居数量感知；在Improved-Hello-reply双向握手链路建立阶段，提出分组时隙冲突筛选（PSCS）机制，通过身份标识号（ID）过滤和多轮筛选实现冲突避免；在令牌传递阶段，通过低开销可回溯的深度优先遍历算法优化令牌传递路径，实现邻居节点的时序串行化发现。

结果

仿真表明，随着节点数量的增加，I-SAND协议的邻居发现时延显著低于基于扫描的确定性算法（SBA-D）协议和基于邻居交集迭代的邻居发现算法（ICN-ND）协议，其邻居发现效率较ICN-ND协议提升约24.7%，较SBA-D协议提升约43.6%。与SAND协议相比，I-SAND协议在节点数量较少时时延和控制开销与其相当，但随着节点数量的增加，其时延和控制开销的优化效果显著优于SAND协议。

结论

I-SAND协议基于令牌传递机制实现邻居时序串行化发现，其邻居发现时延性能和邻居发现效率显著优于SBA-D和ICN-ND协议；与SAND协议相比，在节点数量较少时，二者时延与控制开销相当，在节点数量增加时，I-SAND协议性能显著优于SAND协议。仿真对比验证了其在水下光组网中的优越性能，有效解决了定向光传输特性与AUV移动性带来的邻居发现难题。

Abstract

Objective

With the growing demand for multi-node underwater teamwork in areas like marine exploration and national security

LED-based underwater optical communication has received significant attention in underwater networking due to its high bandwidth and low latency. To tackle the problem of neighbor discovery caused by directional light signals and the movement of Autonomous Underwater Vehicles (AUV)

this paper introduces a new protocol called Improved-Sectored Antenna Neighbor Discovery (I-SAND). This protocol employs a time-based scheduling strategy to enhance the neighbor discovery process in underwater optical networks

significantly improving its speed and reliability.

Methods

The I-SAND protocol structures the neighbor discovery process into three stages. During the Improved-Hone-in phase

periodic beacon transmission coordinated with reply time slots achieves temporal and sector alignment

and enables neighbor quantity awareness. In the Improved-Hello-reply phase for two-way handshake link establishment

a Packet-Slotted Conflict Screening (PSCS) mechanism is introduced to enable adaptive collision avoidance through dynamic ID filtering and multi-round scheduling. In the token-passing phase

a low-overhead depth-first search algorithm is employed to optimize the token delivery path

achieving temporally serialized neighbor discovery.

Results

Simulation shows that the neighbor discovery latency of the I-SAND protocol increases significantly more slowly with the number of nodes compared to the Scan-based Algorithm-Deterministic (SBA-D) and the Neighbor Discovery Algorithm based on Iterative Common Neighbors (ICN-ND). Moreover

the neighbor discovery success rate of I-SAND is about 24.7% higher than that of ICN-ND and about 43.6% higher than that of SBA-D. When compared with the SAND protocol

the latency and control overhead of the I-SAND protocol are comparable to those of the SAND protocol when the number of nodes is small. As the number of nodes increases

the optimization effect of the I-SAND protocol in terms of latency and control overhead is significantly better than that of the SAND protocol.

Conclusion

The I-SAND protocol

which implements temporally serialized neighbor discovery through a token-passing mechanism

shows significantly lower neighbor discovery latency and higher success rate compared to the SBA-D and ICN-ND protocols. When compared with the SAND protocol

their latency and control overhead are comparable when the number of nodes is small. With the increase of the number of nodes

the optimization effect of the I-SAND protocol becomes more prominent. These results validate its superior performance in underwater optical networks

effectively addressing the neighbor discovery challenges posed by directional optical transmission and AUV mobility.

关键词

Keywords

references

Li Y , Jiang P , Li S , et al . Asymmetric Modulation Physical-Layer Network Coding based on Power Allocation and Multiple Receive Antennas in an OFDM-UWOC Three-User Relay Network [J ] . Photonics , 2025 , 12 ( 2 ): 144 .

Li Y , Jiang Y , Chen X , et al . Research on Adaptive Transmit Diversity Strategy for Reducing Interference in Underwater Optical Multi-Beam Non-Orthogonal Multiple Access Systems [J ] . Photonics , 2023 , 10 ( 10 ): 1152 .

Li Y , Li S , Jiang P , et al . Controlled Alignment Imaging Optical MIMO Communication System based on Light Spot Detection of Arrayed Light Sources [J ] . Optics Express , 2024 , 32 ( 17 ): 30393 - 30406 . [PubMed]

Li Y , Zhu K , Jiang Y , et al . Adaptive Diversity Algorithm based on Block STBC for Massive MIMO Link Misalignment in UWOC Systems [J ] . Journal of Marine Science and Engineering , 2023 , 11 ( 4 ): 772 .

胡浩然 . 定向通信自组网邻居发现技术研究 [D ] . 成都 : 电子科技大学 , 2025 .

Hu H R . Research on Neighbor Discovery Technology of Directional Communication Ad Hoc Network [D ] . Chengdu, China : University of Electronic Science and Technology of China , 2025 .

李想 , 朱小军 , 冯斯梦 , 等 . 定向无线自组网中的邻居发现算法综述 [J ] . 计算机科学 , 2025 , 52 ( 3 ): 306 - 317 .

Li X , Zhu X J , Feng S M , et al . Overview of Neighbor Discovery Algorithms in Directional Wireless Ad Hoc Networks [J ] . Computer Science , 2025 , 52 ( 3 ): 306 - 317 .

吴华昆 . 面向无线自组织网络的定向天线邻居发现技术研究 [D ] . 广州 : 广东技术师范大学 , 2025 .

Wu H K . Research on Neighbor Discovery Technology of Directional Antenna for Wireless Ad Hoc Network [D ] . Guangzhou, China : Guangdong Polytechnic Normal University , 2025 .

Guo X , Chi N . Superposed 32QAM Constellation Design for 2×2 Spatial Multiplexing MIMO VLC Systems [J ] . Journal of Lightwave Technology , 2020 , 38 ( 7 ): 1702 - 1711 .

Wei Z , Liang Y , Meng Z , et al . Fast Neighbor Discovery for Wireless Ad Hoc Network with Successive Interference Cancellation [J ] . IEEE Transactions on Vehicular Technology , 2024 , 73 ( 1 ): 1322 - 1336 .

张子东 , 宋志群 , 刘玉涛 , 等 . 基于TDMA的空中自组网MAC层资源调度算法研究 [J ] . 计算机测量与控制 , 2024 , 32 ( 1 ): 251 - 259 .

Zhang Z D , Song Z Q , Liu Y T , et al . Research on MAC Layer Resource Scheduling Algorithm of Air Mobile Ad Hoc Network based on TDMA [J ] . Computer Measurement & Control , 2024 , 32 ( 1 ): 251 - 259 .

吕玉超 , 任智 , 张伟业 , 等 . 一种三维定向无人机自组网邻居发现算法 [J ] . 小型微型计算机系统 , 2025 , 46 ( 9 ): 2251 - 2257 .

Lü Y C , Ren Z , Zhang W Y , et al . Directional Three-Dimensional Neighbor Discovery Algorithm for Unmanned Aerial Vehicle Ad Hoc Networks [J ] . Journal of Chinese Computer Systems , 2025 , 46 ( 9 ): 2251 - 2257 .

Vasudevan S , Towsley D , Goeckel D , et al . Neighbor Discovery in Wireless Networks and the Coupon Collector’s Problem [C ] // Proceedings of the 15th Annual International Conference on Mobile Computing and Networking . Beijing, China : ACM , 2009 : 181 - 192 .

徐倩 . 无线传感器网络的自适应网络拓扑控制技术研究 [J ] . 信息记录材料 , 2024 , 25 ( 8 ): 153 - 155 .

Xu Q . Research on Adaptive Network Topology Control Technology for Wireless Sensor Networks [J ] . Information Recording Materials , 2024 , 25 ( 8 ): 153 - 155 .

Hong L , Luo P , Yan X , et al . A Neighbor Discovery Algorithm for UAV Networking based on Directional Antennas [J ] . Journal of Northwestern Polytechnical University , 2020 , 38 ( 1 ): 191 - 198 .

Felemban E , Murawski R , Ekici E , et al . SAND: Sectored-Antenna Neighbor Discovery Protocol for Wireless Networks [C ] // 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON) . Boston, MA, USA : IEEE , 2010 : 5508291 .

Murawski R , Felemban E , Ekici E , et al . Neighbor Discovery in Wireless Networks with Sectored Antennas [J ] . Ad Hoc Networks , 2012 , 10 ( 1 ): 1 - 18 .

阎梓宁 . 无线传感器网络中多智能体路径规划算法研究 [D ] . 哈尔滨 : 哈尔滨工程大学 , 2024 .

Yan Z N . Research on Multi-Agent Path Planning Algorithm in Wireless Sensor Networks [D ] . Harbin, China : Harbin Engineering University , 2024 .

Views

下载量

CSCD

CNKI被引量

Alert me when the article has been cited

提交

Tools

Publicity Resources

Research on Underwater Optical Communication Technology

The resource management in intelligent optical network

Related Author

LIU Run-peng

TONG Shou-feng

ZHANG Peng

WANG Tian-shu

LIU Ai-bo

ZHAO Ji-jun

JI Yue-feng

Related Institution

Institute of Space Optoelectronic Technology, Changchun University of Science and Technology

Optical Communication Center,Beijing University of Posts and Telecommunications

北京邮电大学光通信中心北京　100876

Address：3rd floor, Building 4, Fenghuo Science Park, Gaoxinsilu, East Lake New Technology Development Zone, Wuhan, Hubei Province, P.R.China Postal code：430205
Technical support is provided by Beijing Founder electronics co., LTD 鄂ICP备2022010197 鄂公网安备 42011202002092号
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.
Total Visits：330363 Visits Today：329

⁰