We take into account a scenario where a subtle jammer jams an space in a single-channel wireless sensor network. The jammer controls the likelihood of jamming and transmission vary to cause maximal damage to the network in terms of corrupted communication links. The jammer action ceases when it's detected by a monitoring node in the network, and a notification message is transferred out of the jamming region. The jammer is detected at a monitor node by using an optimal detection check based mostly on the percentage of incurred collisions. On the opposite hand, the network computes channel access chance in an attempt to minimize the jamming detection plus notification time. In order for the jammer to optimize its profit, it wants to know the network channel access likelihood and variety of neighbors of the monitor node. Accordingly, the network wants to know the jamming probability of the jammer. We study the idealized case of excellent data by each the jammer and therefore the network about the strategy of one another, and also the case where the jammer or the network lack this information. The latter is captured by formulating and solving optimization issues, the solutions of which constitute best responses of the attacker or the network to the worst-case strategy of each alternative. We conjointly take into consideration potential energy constraints of the jammer and also the network. We extend the matter to the case of multiple observers and adaptable jamming transmission vary and propose a intuitive heuristic jamming strategy for that case.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here