Notes - MIECT
Redes E Sistemas Autónomos
Notes - MIECT
Redes E Sistemas Autónomos
  • Redes e Sistemas Autónomos
  • Peer-to-Peer Systems and Networks
    • Content Distribution Networks
    • Peer-to-peer networks
      • Types
    • Structured vs Unstructured
    • Fully Decentralized Information System
    • FastTrack/KaZaA
    • OpenNAP/Napster
    • BitTorrent
  • InterPlanetary File System (IPFS)
    • IPFS
      • Bitswap
    • Connecting an IPFS node to the P2P network
    • Searching in DHTs (Structured)
    • File Search
    • Security
  • Ad-Hoc Networks
    • Mobile Ad-hoc networks
    • Application Scenarios
    • Routing
      • AODV - Ad Hoc On-Demand Distance Vector Routing
      • OLSR - Optimized Link State Routing Protocol
      • LAR – Location Aided Routing
      • Batman
    • IP Address Assignment
  • Self-organized systems: Data, learning and decisions
    • Use Cases and Data
    • Machine Learning
      • Supervised Learning
      • Neural Networks
      • Reinforcement Learning
      • Unsupervised Learning: K-means
    • Learning
  • Vehicular Networks
    • Vehicular Ad Hoc Networks
    • How do they work?
    • SPAT: Signal Phase And Timing
    • MAP: MAP
    • Manoeuvre Coordination Message (MCM)
    • Communication Technologies
  • QoS and Security
    • TCP- and UDP-based applications
      • TCP-Cubic
    • QUIC
    • TCP-Vegas
    • Classification of Transport protocols
    • Exploiting Buffering Capabilities
    • QoS in UDP: trade-offs
    • Transmission Quality (Batman v.3)
    • QoS-OLSR
    • Security
      • Key Management
      • RSA (Rivest-Shamir-Adleman) Key
      • Key Management in ad-hoc networks
      • Self-organized public key management (SOPKM)
      • Self-securing ad-hoc wireless networks (SSAWN)
Powered by GitBook
On this page
  • Possible routing attacks
  • Attacks using a modification
  • Attacks using impersonation
  • Attacks using fabrication
  1. QoS and Security

Security

PreviousQoS-OLSRNextKey Management

Last updated 1 year ago

Possible routing attacks

Attacks using a modification

A malicious node announces better routes than the other nodes in order to be inserted into the network.

  • Redirection by changing the route sequence number.

  • Redirection with a modified hop count.

  • Denial Of Service (DOS) attacks with modified source routes.

    • A malicious node is inserted in the network through one of the previous techniques.

    • The malicious node changes the packet headers it receives.

    • The packets will not reach the destination.

    • The transmission is aborted.

DOS attacks with modified source routes

Attacks using impersonation

Usurpation of the identity of another node to perform changes.

  • Spoofing MAC address of other nodes.

  • Forming loops by spoofing MAC address.

    • A malicious node M can listen to all nodes.

    • It changes its MAC address to the MAC address of another node.

    • It announces to several nodes a shorter path to reach X.

    • X is now unreachable because of the loop formed.

Attacks using fabrication

Generates traffic to disturb the good operation of an ad-hoc network.

  • Falsifying route error messages.

    • Isolate nodes.

  • Corrupting routing state.

    • Hackers can easily broadcast a message with a spoofed IP address such that the other nodes add this new route to reach a special node S.

    • The malicious node will receive the packets intended for S.

  • Routing table overflow attack.

    • Hackers can send in the network a lot of routes to non-existent nodes until overwhelm the protocol.

  • Replay attack.

    • A hacker sends old advertisements to a node.

  • Black hole attack.

    • Hacker advertises a zero metric route for all destinations.

    • All the nodes around it will route packets toward it.