CDMA: principles of spread spectrum communication
CDMA: principles of spread spectrum communication
Secure group communications using key graphs
IEEE/ACM Transactions on Networking (TON)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Secure communications over insecure channels
Communications of the ACM
SPINS: security protocols for sensor networks
Wireless Networks
Advances in Network Simulation
Computer
The feasibility of launching and detecting jamming attacks in wireless networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Jamming and sensing of encrypted wireless ad hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Cross-layer jamming detection and mitigation in wireless broadcast networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
The use of concurrent codes in computer programming and digital signal processing education
Journal of Computing Sciences in Colleges - Papers of the Fourteenth Annual CCSC Midwestern Conference and Papers of the Sixteenth Annual CCSC Rocky Mountain Conference
Jamming-resistant Key Establishment using Uncoordinated Frequency Hopping
SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Zero pre-shared secret key establishment in the presence of jammers
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
An asymmetric security mechanism for navigation signals
IH'04 Proceedings of the 6th international conference on Information Hiding
Evolution of wireless data services: IS-95 to cdma2000
IEEE Communications Magazine
Short paper: reactive jamming in wireless networks: how realistic is the threat?
Proceedings of the fourth ACM conference on Wireless network security
Protecting Satellite Systems from Disassociation DoS Attacks
Wireless Personal Communications: An International Journal
Detection of reactive jamming in DSSS-based wireless networks
Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks
Hi-index | 0.00 |
Wireless communication systems are often susceptible to the jamming attack where adversaries attempt to overpower transmitted signals by injecting a high level of noise. Jamming is difficult to mitigate in broadcast networks because transmitting and receiving are inherently symmetric operations: A user that possesses the key to decode a transmission can also use that key to jam the transmission. We describe a code tree system that provides input to the physical layer and helps the physical layer circumvent jammers. In our system, the transmitter has more information than any proper subset of receivers. Each receiver cooperates with the transmitter to detect any jamming that affects that receiver. In the resulting system, each benign user is guaranteed to eliminate the impact of the attacker after some finite number of losses with arbitrarily high probability. We show that any system that relies on only using spreading code, and no other physical factors, to mitigate jamming must use at least j + 1 codes, where j is the number of jammers. We then propose an optimized scheme that is power-efficient: Each transmission is sent on at most 2j+1 codes simultaneously. Finally, we demonstrate that our scheme approaches the best possible performance by performing an extensive analysis of the system using both event-driven ns-2 and chip-accurate MATLAB simulations.