time-delayed broadcasting for defeating inside jammers

advertisement
TIME-DELAYED BROADCASTING FOR DEFEATING INSIDE
JAMMERS
ABSTRACT
We address the problem of jamming-resistant broadcast communications under an internal
threat model. We propose a time delayed broadcast scheme (TDBS), which implements the
broadcast operation as a series of unicast transmissions distributed in frequency and time.
TDBS does not rely on commonly shared secrets, or the existence of jamming-immune
control channels for coordinating broadcasts. Instead, each node follows a unique pseudonoise (PN) frequency hopping sequence. Contrary to conventional PN sequences designed for
multi-access systems, the PN sequences in TDBS exhibit correlation to enable broadcast.
Moreover, they are designed to limit the information leakage due to the exposure of a subset
of sequences by compromised nodes. We map the problem of constructing such PN
sequences to the 1-factorization problem for complete graphs. We further accommodate
dynamic broadcast groups by mapping the problem of updating the assigned PN sequences to
the problem of constructing rainbow paths in proper edge-colored graphs.
EXISTING SYSTEM
The problem of FH sequence design is mapped to a 1-factorization problem in complete
graphs. While a broad class of scheduling algorithms are known to employ 1-factors (perfect
matchings) (e.g, they are, in general, concerned with unicast communications in a benign
setting and require the existence of a coordination channel. TDBS is specifically designed to
facilitate broadcasting in the presence of jammers and in the absence of a coordination
channel. We further consider the problem of updating the FH sequences of existing nodes
when the broadcast groups are dynamic. This problem is mapped to the construction of a
rainbow path of fixed size in proper edge-colored complete graphs.
PROPOSED SYSTEM
We propose a time delayed broadcast scheme (TDBS), which implements the broadcast
operation as a series of unicast transmissions distributed in frequency and time. TDBS does
not rely on commonly shared secrets, or the existence of jamming-immune control channels
for coordinating broadcasts. Instead, each node follows a unique pseudo-noise (PN)
frequency hopping sequence. Contrary to conventional PN sequences designed for
multi-access systems, the PN sequences in TDBS exhibit correlation to enable broadcast.
Moreover, they are designed to limit the information leakage due to the exposure of a subset
of sequences by compromised nodes. We map the problem of constructing such PN
sequences to the 1-factorization problem for complete graphs. We further accommodate
dynamic broadcast groups by mapping the problem of updating the assigned PN sequences to
the problem of constructing rainbow paths in proper edge-colored graphs.
Further Details Contact: A Vinay 9030333433, 08772261612
Email: info@takeoffprojects.com | www.takeoffprojects.com
SYSTEM REQUIREMENTS:
HARDWARE REQUIREMENTS:
•
System
: Pentium IV 2.4 GHz.
•
Hard Disk
: 40 GB.
•
Floppy Drive
: 1.44 Mb.
•
Monitor
: 15 VGA Colour.
•
Mouse
: Logitech.
•
Ram
: 512 Mb.
SOFTWARE REQUIREMENTS:
 Operating System
: Windows XP
 Programming Language
: JAVA
 Java Version
: JDK 1.6 & above.
 Database
: MYSQL
Further Details Contact: A Vinay 9030333433, 08772261612
Email: info@takeoffprojects.com | www.takeoffprojects.com
Download