 Leaf test codes are secure sine they would not be jammed by jammers.  When few normal users are present, many leaf code tests are wasted since absent.

Slides:



Advertisements
Similar presentations
Chapter Thirteen: Multiplexing and Multiple- Access Techniques.
Advertisements

EE578 Assignment #5 Abdul-Aziz.M Al-Yami November 8 th 2010.
IE 419/519 Wireless Networks Lecture Notes #6 Spread Spectrum.
Spread Spectrum Chapter 7.
Spread Spectrum Chapter 7. Spread Spectrum Input is fed into a channel encoder Produces analog signal with narrow bandwidth Signal is further modulated.
Multiple Access Techniques for wireless communication
Optimal Jamming Attacks and Network Defense Policies in Wireless Sensor Networks Mingyan Li, Iordanis Koutsopoulos, Radha Poovendran (InfoComm ’07) Presented.
April 25, 2005ECE 457 Cellular Communication ECE 457 Spring 2005.
Comp 361, Spring 20056:Basic Wireless 1 Chapter 6: Basic Wireless (last updated 02/05/05) r A quick intro to CDMA r Basic
Chapter 12 Multiple Access Figure 12.1 Data link layer divided into two functionality-oriented sublayers Figure 12.2 Taxonomy of multiple-access protocols.
Sep 06, 2005CS477: Analog and Digital Communications1 Introduction Analog and Digital Communications Autumn
Spread Spectrum Input is fed into a channel encoder
Resilience To Jamming Attacks
William Stallings Data and Computer Communications 7th Edition
Data and Computer Communications Eighth Edition by William Stallings Chapter 9 – Spread Spectrum.
Lower-Layer Security in Mobility Yih-Chun Hu. Wireless Physical Layer Security The problem: prevent the jamming of broadcast to a group of nodes, some.
SPREAD SPECTRUM In spread spectrum (SS), we combine signals from different sources to fit into a larger bandwidth, but our goals are to prevent eavesdropping.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
© Rabat Anam Mahmood ITTC 1 Resilience To Jamming Attacks Rabat Anam Mahmood Department of Electrical Engineering & Computer Science
802.11b Vulnerabilities, Ad-Hoc Mode, RF Jamming and Receiver Design Ritesh H Shukla Graduate Student ECE Dept Under the Guidance of Prof. William R Michalson.
1 CMPT 371 Data Communications and Networking Spread Spectrum.
Sep 08, 2005CS477: Analog and Digital Communications1 Example Systems, Signals Analog and Digital Communications Autumn
Receiver Design for Ultrawideband PPM Communication Systems Vijay Ullal Clemson University July 29, SURE Program.
1 Communication System 1 September 2007 Prepared and Lectured by Assoc Prof. Thuong Le-Tien Slides with references from HUT Finland, La Hore uni., Mc.
1 Secure Cooperative MIMO Communications Under Active Compromised Nodes Liang Hong, McKenzie McNeal III, Wei Chen College of Engineering, Technology, and.
Signal Propagation Propagation: How the Signal are spreading from the receiver to sender. Transmitted to the Receiver in the spherical shape. sender When.
College of Engineering WiFi and WCDMA Network Design Robert Akl, D.Sc. Department of Computer Science and Engineering Robert Akl, D.Sc. Department of Computer.
Authors: Yih-Chun Hu, Adrian Perrig, David B. Johnson
Cross-Layer Optimization in Wireless Networks under Different Packet Delay Metrics Chris T. K. Ng, Muriel Medard, Asuman Ozdaglar Massachusetts Institute.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Data and Computer Communications Eighth Edition by William Stallings Lecture slides by Lawrie Brown Chapter 9 – Spread Spectrum.
Spread Spectrum Spread-spectrum techniques are methods by which energy generated in a particular bandwidth is deliberately spread in the frequency domain,
EE578 Assignment #5 Abdul-Aziz.M Al-Yami November 8 th 2010.
1 Chapter 7. Spread Spectrum Wen-Shyang Hwang KUAS EE.
REECH ME: Regional Energy Efficient Cluster Heads based on Maximum Energy Routing Protocol Prepared by: Arslan Haider. 1.
TI Cellular Mobile Communication Systems Lecture 4 Engr. Shahryar Saleem Assistant Professor Department of Telecom Engineering University of Engineering.
Lecture 4 Spread Spectrum.
CS654: Digital Image Analysis Lecture 34: Different Coding Techniques.
1 William Stallings Data and Computer Communications 7 th Edition Chapter 9 Spread Spectrum.
COMMUNICATION SYSTEM EECB353 Chapter 7 Part III MULTIPLE ACCESS Intan Shafinaz Mustafa Dept of Electrical Engineering Universiti Tenaga Nasional
a/b/g Networks Routing Herbert Rubens Slides taken from UIUC Wireless Networking Group.
Chapter Two Fundamentals of Data and Signals Data Communications and Computer Networks: A Business User's Approach Eighth Edition.
Stallings, Wireless Communications & Networks, Second Edition, © 2005 Pearson Education, Inc. All rights reserved Multiple Access Techniques.
Code Division Multiple Access (CDMA) Transmission Technology
Data and Computer Communications Eighth Edition by William Stallings Lecture slides by Lawrie Brown Chapter 9 – Spread Spectrum.
Data and Computer Communications Ninth Edition by William Stallings Chapter 9 – Spread Spectrum Data and Computer Communications, Ninth Edition by William.
1 Spread Spectrum Technology. 2 What is Spread Spectrum(SS) Spread Spectrum (SS) technology was first introduced by military as a way of sending secure.
Rajani Muraleedharan and Lisa Ann Osadciw By: Mai Ali Sayed Ahmed.
Defeating Energy-Efficient Jamming in IEEE based Wireless Networks By: y D. Wood, John A. Stankovic, and Gang Zhou, University of Virginia Presented.
Stallings, Wireless Communications & Networks, Second Edition, © 2005 Pearson Education, Inc. All rights reserved Spread Spectrum Chapter.
Dynamic Jamming Mitigation for Wireless Broadcast Networks Jerry T. Chiang Yih-Chun Hu 2007.
TUNALIData Communication1 Spread Spectrum Chapter 9.
Outline  Introduction (Resource Management and Utilization).  Compression and Multiplexing (Other related definitions).  The Most Important Access Utilization.
 Abbreviation of fourth generation wireless technology  It will provide a comprehensive IP solution where voice, data and multimedia can be given to.
DATA AND COMPUTER COMMUNICATIONS Eighth Edition by William Stallings Lecture slides by Lawrie Brown Chapter 9 – Spread Spectrum.
The Importance of Being Opportunistic Sachin Katti Dina Katabi, Wenjun Hu, Hariharan Rahul, and Muriel Medard.
William Stallings Data and Computer Communications 7th Edition
Lecture 7 CSMA and Spread Spectrum Dr. Ghalib A. Shah
CT301 lecture7 10/29/2015 Lect 7 NET301.
DIRECT SEQUENCE SPREAD SPECTRUM WITH FREQUENCY HOPPING
Multiple Access Problem: When two or more nodes transmit at the same time, their frames will collide and the link bandwidth is wasted during collision.
Channel Allocation (MAC)
Spread Spectrum L.Tahani Aljehani.
Spread Spectrum Multiplexing combines signals from several sources to achieve bandwidth efficiency: The available bandwidth of a link is divided between.
CT301 lecture7 10/29/2015 Lect 7 NET301.
Spread Spectrum A signal that occupies a bandwidth of B, is spread out to occupy a bandwidth of Bss All signals are spread to occupy the same bandwidth.
William Stallings Data and Computer Communications 7th Edition
William Stallings Data and Computer Communications 7th Edition
Spread Spectrum Analog or digital data Analog signal
Presentation transcript:

 Leaf test codes are secure sine they would not be jammed by jammers.  When few normal users are present, many leaf code tests are wasted since absent users cannot not report jamming.  Optimal height for test codes in the tree is dependent on the number of normal users present, absent users, and jammers.  A subtree behaves according to its leaves: - A subtree is jammed if any of the leaves of the subtree are jammers. - A subtree is absent if all of the leaves of the subtree are absent. - A subtree is normal otherwise.  These designations reflect how the network will react when the root of that subtree is chosen as a test code.  Given there are 2 n total users, of which A are absent, J > 0 are jammers, and N > 0 are normal, The probability of detecting jamming when a test code is chosen at height m is:  The expected number of tests until detection:  The optimal height minimizes the expected number of tests until detection  We performed MATLAB simulations with 20 normal users and 0 to 10 jammers.  Frequency hopping CDMA with 127 channels and 63 hops per bit  Noise across the entire spectrum is 15dB higher than the total signal power.  Power emitted by each jammer equals that emitted by the transmitter.  We simulated 10 tests where the base station transmitted 10,000 6-bit messages  Three scenarios simulated: - Ignore jamming: transmitter uses only one spread spectrum code - Our scheme: network follows our protocol - Best possible: jammers only emit noise  Our scheme delivers almost 100% of packets when there are 5 jammers or fewer and delivers more than 90% of packets between 6 to 10 jammers.  When the jammers have no knowledge of the spread spectrum code used by the system, the network can delivery almost 100% of the packets, but spread spectrum does not mitigate jamming in wireless broadcast networks if the network ignores jammers who have obtained the code. Cross-Layer Jamming Mitigation in Wireless Broadcast Networks Jerry T. Chiang, Yih-Chun Hu Illinois Center for Wireless Systems  Jamming is hard to efficiently prevent in broadcast wireless networks.  Transmitting to all receivers using only one spread spectrum code allows any legitimate receiver to jam.  Transmitting to all different receivers using individual codes is not power efficient. Problem Statement Proposed Solution – Tree Coding Optimization – Test Height Research Results Background  Mobile communication networks are susceptible jamming attacks.  Jamming introduces noise, lowering the signal-to-noise ratio and reducing the probability of successful packet reception.  Jamming can be mitigated using spread spectrum where the transmitter redundantly encodes information using a code allowing the receiver to reject signals that do not come from the transmitter.  Total transmit power is divided between codes in use.  Power efficiency is directly related to number of codes in use. Broader Impact  Our work allows all existing broadcast channels used in spread spectrum wireless access technologies to defend against jamming attacks.  Our work has broad applicability since there already exist a wide variety of spread spectrum wireless access technologies such as IEEE , Bluetooth, IS-95, and CDMA2000. Example: User N 2 holds codes C 2, C 23, C 03, C 07 An example run of our protocol that isolates the effect of jammer, N 5 Disjoint covers shown in blue, detectable codes shown in cyan, and test codes shown in red We propose a power efficient scheme to mitigate jamming in wireless broadcast networks using balanced binary tree:  Each element of the tree corresponds to a spread spectrum code.  Each user is assigned the codes corresponding to a leaf and all its ancestors.  A disjoint cover is a set of spread spectrum codes such that any user can decode using exactly one code in the set.  Each packet sent simultaneously on a disjoint cover and a set of test codes.  The ancestor of a test code in the disjoint cover is called a detectable code.  If any receiver receives packets on a test code but not the corresponding detectable code, the receiver reports J AMMING D ETECTED to the transmitter using his leaf code.  The transmitter stops using the detectable code on which jamming is detected and instead uses its two children codes.  Thus the transmitter always sends packets on the minimal disjoint cover on which no jamming had been previously detected.  Our protocol mitigates jamming by isolating jammers on individual codes while conserving power efficiency by keeping normal users in groups thereby transmitting on fewer spread spectrum codes.