Energy Storage Wireless Mobile Node Mutilayering Network Sliding Window Routing Algorithm

A wireless self-organizing network routing algorithm suitable for energy storage wireless communication nodes has been proposed, which features adaptive node cluster construction, automatic layering, treelike topology, multi-layer network, and can be used for uninterrupted communication in location changes. In this routing algorithm, the status of each node is equal and variable, and a method of constructing a cluster of mobile communication network nodes using circular sliding windows is proposed. Each node in the algorithm can be elected as a cluster head or a gateway node to connect subnets as needed. Through simulation, the energy loss of nodes and the average end- to-end delay between nodes were calculated and compared using this method. The average end-to-end delay between nodes was reduced by 11.64% compared to GACO, and 45.2% and 50.3% compared to AODV and DSR respectively. This algorithm has superior communication persistence capability in decentralized communication networks, infrastructure free communication network scenarios., emergency communication, and military communication.

Authors

Institutions

Publication Details

Published
2024-08-23
DOI
https://doi.org/10.1109/isset62871.2024.10779867
Primary Topic
Caching and Content Delivery
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Energy Storage Wireless Mobile Node Mutilayering Network Sliding Window Routing Algorithm

Zuchun Ding, Wenying Mo
Caching and Content Delivery
article

Energy Storage Wireless Mobile Node Mutilayering Network Sliding Window Routing Algorithm

Zuchun Ding, Wenying Mo
article en

Abstract

A wireless self-organizing network routing algorithm suitable for energy storage wireless communication nodes has been proposed, which features adaptive node cluster construction, automatic layering, treelike topology, multi-layer network, and can be used for uninterrupted communication in location changes. In this routing algorithm, the status of each node is equal and variable, and a method of constructing a cluster of mobile communication network nodes using circular sliding windows is proposed. Each node in the algorithm can be elected as a cluster head or a gateway node to connect subnets as needed. Through simulation, the energy loss of nodes and the average end- to-end delay between nodes were calculated and compared using this method. The average end-to-end delay between nodes was reduced by 11.64% compared to GACO, and 45.2% and 50.3% compared to AODV and DSR respectively. This algorithm has superior communication persistence capability in decentralized communication networks, infrastructure free communication network scenarios., emergency communication, and military communication.

South China University of Technology (CN)
Affordable and clean energy
Openalex Percentile: Top 74%
Caching and Content Delivery
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.