TEDS: A Trusted Entropy and Dempster Shafer Mechanism for Routing in Wireless Mesh Networks
This addresses security issues for users of Wireless Mesh Networks, but it appears incremental as it builds on existing trust and detection methods.
The paper tackles the problem of blackhole attacks in Wireless Mesh Networks by proposing TEDS, a lightweight trust detection mechanism that combines entropy and Dempster Shafer theory to isolate malicious nodes, resulting in improved packet delivery ratio with a slight increase in routing overhead.
Wireless Mesh Networks (WMNs) have emerged as a key technology for the next generation of wireless networking due to its self-forming, self-organizing and self-healing properties. However, due to the multi-hop nature of communications in WMN, we cannot assume that all nodes in the network are cooperative. Nodes may drop all of the data packets they received to mount a Denial of Service (DoS) attack. In this paper, we proposed a lightweight trust detection mechanism called Trusted Entropy and Dempster Shafer (TEDS) to mitigate the effects of blackhole attacks. This novel idea combines entropy function and Dempster Shafer belief theory to derive a trust rating for a node. If the trust rating of a node is less than a threshold, it will be blacklisted and isolated from the network. In this way, the network can be assured of a secure end to end path free of malicious nodes for data forwarding. Our proposed idea has been extensively tested in simulation using network simulator NS-3 and simulation results show that we are able to improve the packet delivery ratio with slight increase in normalized routing overhead.