Ant-based evidence distribution with periodic broadcast in attacked wireless network

In order to establish trust among nodes in large wireless networks, the trust certicates need to be distributed and be readily accessible. However, even so, searching for trust certicates will still become highly cost and delay especially when wireless network is suering CTS jamming attack. We believe the individual solution can lead us to solve this combination problems in the future. Therefore, in this work, we investigate the delay and cost of searching a distributed certicate and the adverse eects of fabiricated control packet attacks on channel throughput and delivery ratio respectively, and propose two techniques that can improve the eciency of searching for such certicates in the network and mitigate the CTS jamming attack's eect. Evidence Distribution based on Periodic Broadcast (EDPB) is the rst solution we presented to help node to quickly locate trust certicates in a large wireless sensor network. In this solution, we not only take advantages from swarm intelligence alogrithm, but also allow nodes that carrying certicates to periodically announce their existence. Such announcements, together with a swarm-intelligence pheromone pdate procedure, will leave traces on the nodes to lead query packets toward the certicate nodes. We then investigate the salient features of this schema and evaluate its performance in both static and mobile networks. This schema can also be used for other essential information dissemination in mobile ad hoc networks. The second technqiue, address inspection schema (AIS) xes vulnerabilities exist in distribution coordinating function (DCF) dened in IEEE 802.11 standard so that each node has the ability to beat the impact of CTS jamming attack and furthermore, benets network throughput. We then perform ns-2 simulations to evaluate the benet of AIS