Research Article
Cloud-Based IoE Enabled an Urban Flooding Surveillance System
Algorithm 1
At the server/transmitter side.
| | (Initial stage) | | (1) | num Sacked = 0 | | (2) | For each sub–flow i do | | (3) | | | (4) | | | (5) | | | (6) | | | (7) | End for (Handling Events) | | (8) | If is the next destination then | | (9) | While room do | | (10) | If r Bu f has room, then | | (11) | , | | (12) | | | (13) | If action is sending an innovative packet, then | | (14) | | | (15) | Create an innovative Packet p = ∑ | | (16) | else | | (17) | | | (18) | Create a Redundant Packet p = ∑ | | (19) | End if | | (20) | Add Packet p to send buffer | | (21) | Sent Packet p to IP layer | | (22) | End if | | (23) | End while | | (24) | End if | | (25) | Else if SACK arrives from the receiver, then | | (26) | Update num Sacked as numSeen | | (27) | Update each as | | (28) | Dequeue send buffer up to num Sacked | | (29) | If duplicate SACK arrives then | | (30) | Retransmit the missing packets | | (31) | End if | | (32) | End if |
|
