projects for
CSE,IT,ECE,EEE,MECH,CIVIL,MCA,M.TECH,M.PHILL,MBA,
DEFEATING JAMMING WITH THE POWER OF SILENCE: A
GAME- THEORETIC ANALYSIS
Abstract
The
timing channel is a
logical communication channel in which information is encoded in the timing between events. Recently, the use of the
timing
channel has
been proposed as a counter
measure to reactive
jamming attacks performed by
an energy constrained malicious
node. In
fact,
while a jammer is able to disrupt the information contained in the attacked packets, timing
information cannot be jammed, and therefore, timing channels can be exploited to
deliver information to the receiver even on a jammed channel. Since the nodes
under attack and the jammer have conflicting interests, their interactions
can be modeled
by means of game theory. Accordingly, in this paper, a game-theoretic
model of the interactions between nodes exploiting the timing channel to achieve
resilience to jamming attacks and a jammer is derived and analyzed. More
specifically,
the Nash equilibrium is studied in terms of existence, uniqueness, and
convergence under best response dynamics. Furthermore, the case in which the
projects for
CSE,IT,ECE,EEE,MECH,CIVIL,MCA,M.TECH,M.PHILL,MBA,
communication nodes
set
their strategy and the
jammer reacts
accordingly is
modeled and analyzed as a Stackel berg game, by considering both perfect and imperfect knowledge of the jammer’s utility function.
Existing System
Wireless networks are especially prone to several attacks due to the shared
and broadcast nature of the wireless medium. One of the most critical attacks is
jamming.
Jamming attacks
can partially
or
totally disrupt ongoing communications, and proper solutions have been proposed in various application
scenarios. Continuous jamming
attacks can be really expensive for the jammer in terms of energy consumption as the transmission
of jamming signals needs a
significant, and constant, amount of power. To reduce energy consumption
while
achieving a high jamming effectiveness, reactive jamming is frequently used
the feasibility and detectability of jamming attacks in wireless networks are analyzed. In these papers above, methodologies to detect jamming attacks are illustrated; it is
also shown that it is possible to identify which kind of jamming attack is ongoing
by looking at the signal strength and other relevant network parameters, such as bit
+ projects , 425 clients - MICANS
IFNFOTECH
provides IEEE &
application projects for CSE,IT,ECE,EEE,MECH,CIVIL,MCA,M.TECH,M.PHILL,MBA,
and packet errors. In the feasibility of reactive jamming attacks by providing a real
implementation
of a reactive jammer in a software-defined radio environment where a reactive jammer prototype is implemented on a USRP2 platform
and
network users are implemented on MICAz motes. Authors show that reactive
jamming
attacks are feasible and efficient, and that low reaction times can be
achieved; then,
they highlight the
need to investigate proper countermeasures
against reactive jamming attacks.
Drawbacks
To reduce energy consumption while achieving a high jamming effectiveness, reactive jamming is frequently used the feasibility and detect ability
of
jamming attacks in wireless networks are analyzed.
Proposed System
The main contributions of this paper can be therefore summarized
as
follows:
1) we model
the interactions between a jammer and a
target
node as a jamming game; 2) we prove the existence, uniqueness and
|
convergence to the Nash equilibrium
(NE)
under best response
dynamics; 3) we prove the existence and uniqueness of the equilibrium of the Stackel berg game where
the target node plays as a leader and the
jammer reacts consequently; 4) we investigate in this latter Stackel berg scenario the impact on the achievable performance
of imperfect
knowledge of the jammer’s utility function; 5) we conduct an extensive numerical
analysis which shows that our proposed models well capture
the
main factors behind the utilization of timing channels, thus representing a promising framework for the
design and understanding of
such systems.
Advantages
· Lower
Energy Consumption
· High Throughput
Modules
|
·
|
Nash Equilibrium Analysis
|
|
·
|
Existence of the
Nash Equilibrium
|
|
·
|
Uniqueness of the
Nash Equilibrium
|
|
·
·
|
Convergence to the Nash Equilibrium
Performance Analysis
|
NASH Equilibrium Analysis

Existence of the Nash Equilibrium
It is well known that the intersection points between bT(y) and bJ(x)are the
NEs of the game. Therefore, to demonstrate the existence of at least one NE, it
Ø 7
Years of Excellence in IEEE Project development for universities across INDIA,
USA, UK, AUSTRALIA, and SWEEDEN.
Ø Expert developers in JAVA , DOT NET
, ANDROID , PHP, MATLAB , NS2 , NS3 , VLSI
,CLOUD SIM, TANNER , MICROWIND , EMBEDDED , ROBOTICS
, MECHANICAL , MECHATRONICS
, WIRELESS
NETWORS, OPNET
, OMNET
Ø Over
11000+ projects , 425 clients - MICANS
IFNFOTECH
provides IEEE &
application projects for CSE,IT,ECE,EEE,MECH,CIVIL,MCA,M.TECH,M.PHILL,MBA,
suffices to prove that bT(y) and bJ(x) have one or more intersection points. In other
words, it is sufficient to find one or more pairs.
Uniqueness of the Nash Equilibrium
After proving the NE existence in Theorem, let us prove the uniqueness of
the
NE, that is, there is only one strategy profile such that no player has incentive
to deviate unilaterally.
Convergence to the Nash Equilibrium
We now analyze the convergence of the game to the NE when players
follow Best Response Dynamics (BRD). In BRD the game starts from any initial
point(x(0),y(0))∈Sand, at each successive step, each player plays its strategy by
following its best response function.
Performance Analysis
The game allows the leader to achieve a utility which is atleast equal to the utility achieved in the ordinary game at the NE, if we assume perfect knowledge,
Ø 7
Years of Excellence in IEEE Project development for universities across INDIA,
USA, UK, AUSTRALIA, and SWEEDEN.
Ø Expert developers in JAVA , DOT NET
, ANDROID , PHP, MATLAB , NS2 , NS3 , VLSI
,CLOUD SIM, TANNER , MICROWIND , EMBEDDED , ROBOTICS
, MECHANICAL , MECHATRONICS
, WIRELESS
NETWORS, OPNET
, OMNET
Ø Over
11000+ projects , 425 clients - MICANS
IFNFOTECH
provides IEEE &
application projects for CSE,IT,ECE,EEE,MECH,CIVIL,MCA,M.TECH,M.PHILL,MBA,
that is, the target node is completely aware of the utility function of the jammer and its
parameters, and
thus
it is
able to evaluate
bJ(x). Whereas, if some parameters in the utility function of the
jammer are
unknown at the
target node.
System Requirements
Hardware Requirements
Processor -
Pentium –III Speed - 1.1 Ghz
RAM - 256 MB(min)
Hard Disk -
20 GB
Key Board -
Standard Windows Keyboard
Ø 7
Years of Excellence in IEEE Project development for universities across INDIA,
USA, UK, AUSTRALIA, and SWEEDEN.
Ø Expert developers in JAVA , DOT NET
, ANDROID , PHP, MATLAB , NS2 , NS3 , VLSI
,CLOUD SIM, TANNER , MICROWIND , EMBEDDED , ROBOTICS
, MECHANICAL , MECHATRONICS
, WIRELESS
NETWORS, OPNET
, OMNET
Ø Over
11000+ projects , 425 clients - MICANS
IFNFOTECH
provides IEEE &
application projects for CSE,IT,ECE,EEE,MECH,CIVIL,MCA,M.TECH,M.PHILL,MBA,
Mouse - Two or Three Button Mouse
Monitor -
SVGA
Software Requirements:-
Operating System :
LINUX
Tool : Network Simulator-2
Front End :O TCL (Object Oriented Tool Command Language)
References
[1] V. Anantharam and S. Verdu, “Bits through queues,” IEEE Trans. Inf. Theory,
vol. 42, no. 1, pp. 4–18, Jan. 1996.
cellence in IEEE Project development for
universities across INDIA, USA, UK, AUSTRALIA, and SWEEDEN.
Ø Expert developers in JAVA , DOT NET
, ANDROID , PHP, MATLAB , NS2 , NS3 , VLSI
,CLOUD SIM, TANNER , MICROWIND , EMBEDDED , ROBOTICS
, MECHANICAL , MECHATRONICS
, WIRELESS
NETWORS, OPNET
, OMNET
Ø Over
11000+ projects , 425 clients - MICANS
IFNFOTECH
provides IEEE &
application projects for CSE,IT,ECE,EEE,MECH,CIVIL,MCA,M.TECH,M.PHILL,MBA,
[2] G. Morabito, “Exploiting the timing channel to increase energy efficiency in
wireless networks,” IEEE J. Sel. Areas Commun., vol. 29, no. 8, pp. 1711–1720, Sep. 2011.
No comments:
Post a Comment