Travel Route Planning with Optimal Coverage in Difficult Wireless Sensor Network Environment

Travel Route Planning with Optimal Coverage in Difficult Wireless Sensor Network Environment

Yu Gao;Jin Wang;Wenbing Wu;Arun Kumar Sangaiah;Se-Jung Lim;Gao, Yu;Wang, Jin;Wu, Wenbing;Sangaiah, Arun Kumar;Lim, Se-Jung;
sensors 2019 Vol. 19 pp. 1838-
149
gao2019sensorstravel

Abstract

In recent years, wireless sensor networks (WSNs) have been widely applied to sense the physical environment, especially some difficult environment due to their ad-hoc nature with self-organization and local collaboration characteristics. Meanwhile, the rapid development of intelligent vehicles makes it possible to adopt mobile devices to collect information in WSNs. Although network performance can be greatly improved by those mobile devices, it is difficult to plan a reasonable travel route for efficient data gathering. In this paper, we present a travel route planning schema with a mobile collector (TRP-MC) to find a short route that covers as many sensors as possible. In order to conserve energy, sensors prefer to utilize single hop communication for data uploading within their communication range. Sojourn points (SPs) are firstly defined for a mobile collector to gather information, and then their number is determined according to the maximal coverage rate. Next, the particle swarm optimization (PSO) algorithm is used to search the optimal positions for those SPs with maximal coverage rate and minimal overlapped coverage rate. Finally, we schedule the shortest loop for those SPs by using ant colony optimization (ACO) algorithm. Plenty of simulations are performed and the results show that our presented schema owns a better performance compared to Low Energy Adaptive Clustering Hierarchy (LEACH), Multi-hop Weighted Revenue (MWR) algorithm and Single-hop Data-gathering Procedure (SHDGP).

Citation

ID: 272869
Ref Key: gao2019sensorstravel
Use this key to autocite in SciMatic or Thesis Manager

References

Blockchain Verification

Account:
NFT Contract Address:
0x95644003c57E6F55A65596E3D9Eac6813e3566dA
Article ID:
272869
Unique Identifier:
10.3390/s19081838
Network:
Scimatic Chain (ID: 481)
Loading...
Blockchain Readiness Checklist
Authors
Abstract
Journal Name
Year
Title
5/5
Creates 1,000,000 NFT tokens for this article
Token Features:
  • ERC-1155 Standard NFT
  • 1 Million Supply per Article
  • Transferable via MetaMask
  • Permanent Blockchain Record
Blockchain QR Code
Scan with Saymatik Web3.0 Wallet

Saymatik Web3.0 Wallet