.png){kind=icon}
.png){kind=icon}
Return
Swarm-Intelligence-Based Rendezvous Selection via Edge Computing for Mobile Sensor Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/JIOT.2020.2973401.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Mobile-edge nodes, as an efficient approach to the performance improvement of wireless sensor networks (WSNs), play an important role in edge computing. However, existing works only focus on connected networks and suffer from high calculational costs. In this article, we propose a rendezvous selection strategy for data collection of disjoint WSNs with mobile-edge nodes. The goal is to achieve full network connectivity and minimize path length. From the perspective of the application scenario, this article is distinctive in two aspects. On the one hand, it is specially designed for partitioned networks which are much more complex than conventional connected scenarios. On the other hand, this article is specially designed for delay-harsh applications rather than usual energy-oriented scenarios. From the viewpoint of the implementation method, a simplified ant colony optimization (ACO) algorithm is performed and displays two characteristics. The first one is the path segmenting mechanism, simplifying the path construction of each part and consequently reducing the computational cost. The second one is the candidate grouping mechanism, reducing the search space and accordingly speeding up the convergence speed. Simulation results demonstrate the feasibility and advantages of this approach.
Keywords:
Delays
Wireless sensor networks
Data collection
Trajectory
Internet of Things
Clustering algorithms
Computational efficiency
Ant colony optimization (ACO)
disconnected network
mobile-edge node
rendezvous selection
wireless sensor network (WSN)
Journal
IF:
8.9
Papers:
1.4W
Citations:
7.8W
View more organizations