Securing the wireless network from jamming Attacks using anonymity

Multiple-path source routing protocols allow a data source node todistribute traffic to available paths. We consider the problem ofproblem-free source routing, in which the source node carries out atraffic allocation based on empirical statistics on individual networknodes. This reduces the efficiency of the blocking attack. In thetraditional system, a reactive jammer blocks wireless channels onlywhen sending targets; compared to constant interfering, reactivejamming is more difficult to track and compensate. The transmission ofmessages by the use of the reaction time of a reactive jammingtransmitter. It does not accept a reactive jammer with limited rangeand transmission power and can therefore be used in scenarios wheretraditional approaches fail. In this paper, we are investigating theability of network nodes to characterize the congestion and ability ofmultiple source nodes to compensate for blocking in the allocation oftraffic over multiple routing paths. We formulate the problem ofallocating traffic across multiple routing paths in the presence ofjamming as a loss-rich network flow optimization problem. We model theproblem as a Bayesian game for a single time slot attack and reduce itto solving linear programming problems (LP). We show that inmultisource networks, this central optimization problem can be solvedwith an anti-jamming technique. Finally, we simulate the achievablethroughput using our proposed traffic allocation method in severalscenarios. We formulate the central traffic distribution problem forseveral source nodes as a convex optimization problem. We show thatthe multisource multipath optimal traffic allocation at the sourcenodes can be calculated using an anti-jamming technique.