Optimisation-based time slot assignment and synchronisation for TDMA MAC in industrial wireless sensor network

Wireless sensor network in the industrial environment [industrial wireless sensor network (IWSN)] has data delivery time constraint. Due to the dynamic routing and transmission collision, the data delivery time is unpredictable. The authors utilised time division multiple access (TDMA) MAC to avoid data collision and to provide bounded transmission delay. Moreover, a linear programming model is proposed to construct the TDMA schedules, which is focused on spatial reuse and fixed routing in IWSN. The objective function of the model is to minimise the time slot usage to increase the overall network bandwidth. Finally, both simulated annealing algorithm and particle swarm optimisation are applied to approximate the optimal solution of time slot usage.

[1]  Meie Shen,et al.  Bi-Velocity Discrete Particle Swarm Optimization and Its Application to Multicast Routing Problem in Communication Networks , 2014, IEEE Transactions on Industrial Electronics.

[2]  Mirko Krivánek,et al.  Simulated Annealing: A Proof of Convergence , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Haibo Zhang,et al.  Time-Optimal Convergecast With Separated Packet Copying: Scheduling Policies and Performance , 2015, IEEE Transactions on Vehicular Technology.

[4]  Wei Shen,et al.  PriorityMAC: A Priority-Enhanced MAC Protocol for Critical Traffic in Industrial Wireless Sensor and Actuator Networks , 2014, IEEE Transactions on Industrial Informatics.

[5]  Jintao Wang,et al.  Mixed Criticality Scheduling for Industrial Wireless Sensor Networks , 2016, Sensors.

[6]  Chenyang Lu,et al.  Real-Time Query Scheduling for Wireless Sensor Networks , 2013, IEEE Trans. Computers.

[7]  Jun Zhang,et al.  Adaptive Particle Swarm Optimization , 2008, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).