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
  • Challenges and Requirements
  • Major challenges
  • Major requirements
  • Proactive and Reactive Protocols
  • Proactive protocols
  • Reactive protocols
  1. Ad-Hoc Networks

Routing

Challenges and Requirements

Major challenges

  • Mobility – path breaks, packet collisions, transient loops.

  • Bandwidth constraint – channel shared by all nodes in the broadcast region.

  • Error-prone and shared channel – take into account the larger BERs in wireless ad-hoc.

  • Location-dependent contention – high when the number of nodes increases.

Major requirements

  • Minimum route acquisition delay.

  • Quick route reconfiguration (handle path breaks).

  • Loop-free routing (avoid waste of resources).

  • Distributed routing approach (reduce the bandwidth consumed).

  • Minimum control overhead (bandwidth, collisions).

  • Scalability (scale with a large network – minimize control overhead).

  • Provisioning of QoS (provide QoS levels) - support for time-sensitive traffic.

  • Security and privacy (resilient to threats and vulnerabilities).

Proactive and Reactive Protocols

Which approach achieves a better trade-off depends on the traffic and mobility patterns.

Proactive protocols

  • Always maintain routes.

  • Little or no delay for route determination.

  • Consume bandwidth to keep routes up-to-date.

  • Maintain routes that may never be used.

Reactive protocols

  • Lower overhead since routes are determined on demand.

  • Significant delay in route determination.

  • Employ flooding (global search).

  • Control traffic may be bursty.

PreviousApplication ScenariosNextAODV - Ad Hoc On-Demand Distance Vector Routing

Last updated 2 years ago

OLSR - Optimized Link State Routing Protocol
AODV - Ad Hoc On-Demand Distance Vector Routing