Convergecast Scheduling for Industrial Wireless Sensor Networks With Local Available Channel Sets

In industrial wireless sensor networks (IWSNs), monitoring data generated by field devices (FDs) are supposed to be delivered to the gateway timely and reliably. The previous researches focus on the convergecast problem based on the global available channel set, where unreliable channels are blackli...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE sensors journal Ročník 19; číslo 22; s. 10764 - 10772
Hlavní autoři: Shi, Huaguang, Zheng, Meng, Liang, Wei, Zhang, Jialin
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 15.11.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
available channel sets
channel blacklisting
Channels
Computer networks
Computer simulation
convergecast scheduling
Convergence
Electronic devices
Gateways (computers)
Industrial wireless sensor networks
Integer programming
Integers
Interference
Job shop scheduling
Polynomials
Production scheduling
real-time
Remote sensors
Schedules
Scheduling
Scheduling algorithms
Topology
Wireless sensor networks
ISSN:1530-437X, 1558-1748
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In industrial wireless sensor networks (IWSNs), monitoring data generated by field devices (FDs) are supposed to be delivered to the gateway timely and reliably. The previous researches focus on the convergecast problem based on the global available channel set, where unreliable channels are blacklisted. However, in practical industrial environment, different links may have different local available channel sets (LACSs) due to the location-dependent characteristics of wireless channels. In this paper, we study the LACSs-based convergecast scheduling problem in the IWSNs with tree topologies. First, we formulate the convergecast scheduling problem in a mathematically precise form of integer programming. Then, we propose a novel method to calculate priorities for each FD, and design two effective heuristic rules of allocating channels to FDs to maximize the number of concurrent transmissions in each time slot, considering the priority of each FD and the constraints in the integer programming formulation. Finally, inspired by the proposed heuristic rules, we propose an LACSs-based convergecast scheduling (LCS) algorithms to generate efficient schedules for IWSNs in polynomial time. The simulation results show that the proposed algorithm outperforms existing works in terms of latency for different scenarios.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1530-437X
1558-1748
DOI:10.1109/JSEN.2019.2929672