If so, it calculates the buffer utility of the message i in node j, W ij. If W ij is less than the overall buffer utility of node j, U j, then message is discarded, otherwise, the buffer replacement function drops the buffered message with the minimum buffer utility.
As shown in Equations (2) and (3), we set up a weight calculation equation to calculate the buffer utility of the message i in node j W ij − α TT L min TT L o + β BS j S mi + γ count av count, (2).
When the receiver receives that message, it saves in its buffer a summary of the message: its sequence number and the RSSI level related to the reception of the message.
Third, there are still a large number of redundant copies of a message stay in the buffer when the message is successfully delivered to the destination.
This means that a mote can only have one message of each neighbour into its buffers regardless of the type of the message, so the maximum incoming messages that a mote can have is equal to the number of neighbours.
If the ID from the newly received packet is equal to the ID of the message in the buffer, the packet is added to the buffer.
If the new packet ID differs from the ID of the message in the buffer, a message change has occurred.
While other copies of the message still accommodate the buffer of the relay nodes and spread in the network until the TTL elapsed.
The low average delay also validates the original assumption we had when designing the buffer replacement policy, which takes the TTL, size, and forwarding times of the message into consideration and lets messages spend less time in the buffer.
The messages history serves as a buffer for incoming messages, and the algorithm makes implicit use of the message history during steps B.1.1.2 and B.2.1.
