Weight Trusted Routing Mechanism for Hierarchical Mesh Environments

In this paper, we have proposed a technique to detect and eliminate the malicious/misbehaving nodes involved during routing path formation in hierarchical mesh environments. In this, dijkstra's shortest path routing algorithm is used whose weights are deliberated using certain parameters (i.e. node distance, node's previous interactions, packet loss percentage and trust values of each node) for providing the security against routing attacks. The malicious nodes involved during route discovery process are eliminated by calculating the trust of each node using Social Impact Theory Optimizer (SITO). Here, we have discussed the network performance trade-off caused by secure path formation in conventional methods and proposed a Weight Trusted Routing (WTR) mechanism for eliminating these issues (packet-loss ratio, end-to-end delay and route discovery delay). We have numerically simulated and compared the network metrics for both conventional and proposed approaches. Moreover, the proposed technique is validated by discussing an empirical study over routing attacks.