Research Article
Detection of Packet Dropping Attack Based on Evidence Fusion in IoT Networks
| | Input: RPS (Received Packet Set) | | | Output: BG (Benign Group), MG (Malicious Group) | | (1) | Initialize ; | | | Step1 Getting the dropped packet set: | | (2) | Initialize all ; | | (3) | foreachdo | | (4) | ; | | (5) | end | | (6) | for ++ do | | (7) | sorts inner in ascending order of ; | | (8) | for ++ do | | (9) | ifthen | | (10) | ; | | (11) | end | | (12) | end | | (13) | end | | | Step2 Collecting PFEs: | | (14) | foreachdo | | (15) | , = ; | | (16) | = ; | | (17) | while Find no suspicious nodes do | | (18) | finds next forwarding node is ; | | (19) | , ; | | (20) | = ; | | (21) | = ; | | (22) | end | | (23) | finds two suspicious nodes ; | | (24) | ; | | (25) | ; | | (26) | foreachdo | | (27) | ; | | (28) | end | | | Step3 Fusing PFEs: | | (29) | foreachdo | | (30) | ifthen | | (31) | ++; | | (32) | else | | (33) | ++; | | (34) | end | | (35) | end | | (36) | ifthen | | (37) | Decrease ’s trust; | | (38) | end | | (39) | ifthen | | (40) | Decrease ’s trust; | | (41) | end | | (42) | end | | (43) | Based on nodes’ trusts, K-means clusters nodes to and ; | | (44) | return (BG, MG); |
|
