1 / 22

Routing Protocol for Wireless Sensor Network in Hostile Environments

Routing Protocol for Wireless Sensor Network in Hostile Environments. PhD Student : Kashif Saghar Supervisors: William Henderson David Kendall. Outline. Wireless Sensor Networks (WSN) and Routing Formal Modelling Challenges & Security Issues in WSN Research Aim Research Method

Download Presentation

Routing Protocol for Wireless Sensor Network in Hostile Environments

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Routing Protocol for Wireless Sensor Network in Hostile Environments PhD Student : Kashif Saghar Supervisors: William Henderson David Kendall

  2. Outline • Wireless Sensor Networks (WSN) and Routing • Formal Modelling • Challenges & Security Issues in WSN • Research Aim • Research Method • Progress

  3. WIRELESS SENSOR NETWORK (WSN)

  4. WSN COMMUNICATION ARCHITECTURE Routing

  5. WHY WSN ARE DIFFERENT? • Fault Tolerance • Scalability • Density • Hardware Constraints • Cost • Power Consumption • WSN Topology

  6. ROUTING IN WSN • Cost • Energy-efficiency • Latency • Mobility • Distribution density • Scalability • Quality of Service (QoS)

  7. SECURITY ISSUES IN WSN • Broadcast Nature • Limited Resources • Unattended • Hostile Environment

  8. AIM AND OBJECTIVES • AIM/Purpose • "Attacks on Wireless Sensor Networks, having limited resources, can be successfully resisted at the Network Layer." • Primary Assumptions • Confidentiality and Authentication Scheme is present at Link Layer • Sink is a highly resourced node • Nodes do not have any special hardware • The approximate time to compromise a node is known in advance • Nodes can be placed by any means (Random, Regular) • Attacker is very Powerful

  9. WSN ATTACKS CONSIDERED • Wormhole • Two colluding nodes • A node at one end of the wormhole advertises high quality link to the base station • Another node at the other end receives the attracted packets • Two Laptops or Normal Nodes • Black hole • Selective Forwarding • Fail Encryption or via Wormhole • Sink hole • Node attract all traffic around by making itself attractive to all nodes with in range e.g. Laptop • Fail Encryption or via Wormhole • Insider Attack • Get into network by node compromise or false node

  10. LIST OF SOME WSN ATTACKS • Spoofing • False Injection or Path-base Denial of Service • Black hole or Selective forwarding • Sinkhole attacks • Sybil attacks • Wormholes • Jamming • Eavesdropping • Traffic Analysis Attack • Insider Attack (Compromised Node) • False Node and malicious data • Rushing Attack • Stealthy Attack • Hello Flood Attack

  11. LITERATURE REVIEW ANALYSIS

  12. DESIGN PHASES

  13. TECHNIQUES AVAILABLE • Formal Modelling • WSN Simulation • Empirical Testing

  14. FORMAL MODELLING • Assumptions become clear • Can check Best cases and Worst Cases easily • Inform about boundaries of protocol behaviour • Liveliness and Safety properties • Rarely used in analysis of previous protocols • Main Advantages over Simulation and Empirical Testing: • No need to build a prototype of the system • Able to verify the system against every single execution trace (Hidden Errors) • Shortcomings • High Resources Required for detailed model • Scalability, Density, Topology • Subset of Model can be checked • Expertise Required • Uncertainty

  15. UPPAL MODEL OF DESIGN (SETUP)

  16. VERIFICATION USING UPPAAL • Theorem1: Model never deadlocks • Theorem2: All nodes get the correct level • Theorem3: The levels of nodes are not changed once all nodes get the correct • Theorem4: A node in INIT mode means it has not yet been assigned a level • Theorem5: A node always gets a level and gets out of INIT mode

  17. MESSAGE SEQUENCE DIAGRAM

  18. SIMULATION • Level of simulator (High, Low, Bit Level) • Usual Workability • Scalability • Effect of Topology • Effect of Density • Vary environment conditions • Shortcomings • Ideal cases are checked only • Hidden Errors

  19. CURRENT AND FUTURE WORK • Current Work • Formal specifications of design • Future Work • Formal Model and Verification • Simulation of complete protocol • Simulation of Attacks • Additional/Optional Work • Implementation in Real Hardware

  20. Questions

More Related