Optimized Scheme to Secure IoT Systems Based on Sharing Secret in Multipath Protocol

Algorithm 3

Combination algorithm.

	Step 1: destination calculates the possible combinations that cover all the elements of our set
	…
(i)	If :
	So all the paths are reliable paths, and the initial message sent by the source is equal to ,
(ii)	If there are different combinations, and at least two equal combinations: So the equal combinations Crli (1 ≤ i ≤ α) are correct combinations equal to the message M. Therefore, the fragments which constitute these reliable combinations are necessarily all reliable fragments Frlij (1 ≤ j ≤ k). And the different combinations Csspo are suspect combinations constituted by suspicious fragments Fsspot (1 ≤ t ≤ k), that is why our method will proceed to the second step to locate the unreliable fragments that have been modified during transmission generating different combinations.