Parallel Redundancy Protocol for Railway Wireless Data Communication Network

Algorithm 1

Element insertion

1. x: the element to be inserted.

2. k: the number of hash functions.

3. c_max: the maximum value of the counter.

4. hash: a hash function whose value range is [0, m-1], and m is the length of array B.

5. The items in array B are initialized to 0;

6. for i ←1 to k do.

7. index ← hash(x, i);

8. B(index) ← c_max;

9. end for