Energy Efficient Scheduling Method and Algorithm for the Non-Deterministic Traffic in IEEE 802.15.4e Time Slotted Channel Hopping (TSCH) Medium Access Control characterized by comprising the process steps of; • calculating K PDR = 1 s × ∑ i = 1 s k PDR i, where k PDR i = 1 − m PDR i θ frame i × 1 − 1 n C i, • calculating K d = 1 s × ∑ i = 1 s k d i, where k d i = ln 2 × m d i 1 − m PDR i, calculating the number of total child nodes (N c) where N C = ∑ i s N C i and the total traffic load (Λ frame) where Λ frame = ∑ v = 1 N C λ frame v, which are constant parameters, respectively, • assigning the average energy required for a packet to be successfully received ( P avg) to the biggest value, • repeating the processes within the loop for each frame length (frameLength) value in the L frameLength list by the device, • repeating the processes within the loop for each possible shared cell number ( s) value according to the chosen frameLength value by the device, • forming the Λ frame vector, which shows the traffic load of each child node, • creating the traffic load vector ( Θ frame) such that each element will be 0, which is updated as the shared cells are distributed, • forming the V' vector which indicates the shared cells assigned to the child nodes and each element of which corresponds to a child node, • distributing the traffic loads of the child nodes such that in each shared cell there will be equal load and updating V ' and Θ frame values according to this distribution, • determining the shared cell that has the highest traffic load in order to control the requirements, • estimating the PDR metric π PDR, which belongs to the shared cell with the highest traffic load, where π PDR = 1 − K PDR × Θ frame i max × 1 − 1 n C i max and i max is the index number of the shared cell that has the highest traffic load, • estimating the average latency metric π d belonging to the same cell, where π d = 1 2 × e K d × 1 − π PDR × l × slotTime, • comparing the estimated PDR and average latency values according to the threshold values determined by the user, • If the PDR value is higher than the threshold value and the average latency value is lower than the threshold value, the device deciding that the corresponding state meets the requirements and starting to calculate the average energy consumption, • calculating the average energy consumption for this state and saving the it on the P' avg variable, • comparing the saved value to the lowest energy consumption calculated so far, • if the saved value is lower, updating the lowest energy consumption value with the saved value in the next step, • saving the state parameters corresponding to this energy consumption, • after trying all the possible states, returning the obtained state values corresponding to the lowest energy consumption to the device, • application of the transmitted output by the device. • calculating K PDR = 1 s × ∑ i = 1 s k PDR i, where k PDR i = 1 − m PDR i θ frame i × 1 − 1 n C i, • calculating K d = 1 s × ∑ i = 1 s k d i, where k d i = ln 2 × m d i 1 − m PDR i, • assigning the average energy required for a packet to be successfully received ( P avg) to the biggest value, • repeating the processes within the loop for each frame length (frameLength) value in the L frameLength list by the device, • repeating the processes within the loop for each possible shared cell number ( s) value according to the chosen frameLength value by the device, • forming the Λ frame vector, which shows the traffic load of each child node, • creating the traffic load vector ( Θ frame) such that each element will be 0, which is updated as the shared cells are distributed, • forming the V' vector which indicates the shared cells assigned to the child nodes and each element of which corresponds to a child node, • distributing the traffic loads of the child nodes such that in each shared cell there will be equal load and updating V ' and Θ frame values according to this distribution, • determining the shared cell that has the highest traffic load in order to control the requirements, • estimating the PDR metric π PDR, which belongs to the shared cell with the highest traffic load, where π PDR = 1 − K PDR × Θ frame i max × 1 − 1 n C i max and i max is the index number of the shared cell that has the highest traffic load, • estimating the average latency metric π d belonging to the same cell, where π d = 1 2 × e K d × 1 − π PDR × l × slotTime, • comparing the estimated PDR and average latency values according to the threshold values determined by the user, • If the PDR value is higher than the threshold value and the average latency value is lower than the threshold value, the device deciding that the corresponding state meets the requirements and starting to calculate the average energy consumption, • calculating the average energy consumption for this state and saving the it on the P' avg variable, • comparing the saved value to the lowest energy consumption calculated so far, • if the saved value is lower, updating the lowest energy consumption value with the saved value in the next step, • saving the state parameters corresponding to this energy consumption, • after trying all the possible states, returning the obtained state values corresponding to the lowest energy consumption to the device, • application of the transmitted output by the device.