83  Ad-Hoc Network Fundamentals

In 60 Seconds

Ad-hoc networks are infrastructure-less, self-organizing wireless networks where every node can route traffic – no base stations, access points, or central controllers needed. Three routing paradigms: proactive (maintain routes continuously, zero latency but O(n^2) overhead), reactive (discover on-demand, zero idle cost but initial delay), and hybrid (ZRP combines both with tunable zone radius). Use ad-hoc for disaster response, military operations, or remote IoT where infrastructure is impractical.

83.1 Learning Objectives

By the end of this chapter, you will be able to:

• Explain Ad-Hoc Networks: Describe infrastructure-less, self-organizing wireless networks and how they differ from traditional infrastructure-based approaches
• Distinguish Routing Paradigms: Compare proactive, reactive, and hybrid routing strategies and evaluate their specific trade-offs
• Justify Use Case Selection: Determine when ad-hoc networking is the right solution and defend the choice based on deployment constraints
• Assess Trade-offs: Analyze the costs and benefits of ad-hoc versus infrastructure-based approaches for specific IoT systems
• Navigate the Ad-Hoc Topic Series: Choose the right sub-chapter based on your learning needs

Most Valuable Understanding (MVU)

Ad-hoc networks trade infrastructure dependence for self-organization — enabling IoT in places where no infrastructure exists — but this freedom comes at the cost of routing complexity, limited scalability, and energy overhead from multi-hop forwarding.

• Core trade-off: No infrastructure means instant deployment and resilience, but every node must participate in routing, consuming energy and bandwidth that would otherwise be handled by dedicated routers
• Routing is the central challenge: Choosing between proactive (always-ready routes, high overhead), reactive (on-demand routes, discovery delay), and hybrid (balanced) paradigms determines your network’s performance profile
• Scalability ceiling: Flat ad-hoc networks struggle beyond 100–200 nodes because routing overhead grows with network size; hierarchical or geographic approaches are needed for larger deployments

Putting Numbers to It

Flat ad-hoc scalability limit: Routing overhead in proactive protocols grows as \(O(N^2)\) because N nodes each maintain routes to N-1 destinations. For 200 nodes with 30-second updates, total network state: \(200 \times 199 = 39,800\) route entries updated every 30 seconds. Worked example: 39,800 entries × 50 bytes × (86,400/30 updates/day) = 5.7 GB/day routing overhead. At 250 kbps (IEEE 802.15.4), this consumes 73% of available bandwidth — routing overhead dominates actual data traffic beyond ~150-200 nodes in flat topologies.

For Kids: Meet the Sensor Squad!

Ad-hoc networks are like a game of telephone where everyone helps pass the message — no teacher or phone needed!

83.1.1 The Sensor Squad Adventure: The Camping Trip

The Sensor Squad went on a camping trip deep in the forest — far from any Wi-Fi or cell towers!

Sammy the Temperature Sensor noticed the campfire was getting dangerously hot. “I need to warn Bella at the other end of camp, but there’s no Wi-Fi out here!”

Lila the Light Sensor had an idea: “What if we just pass messages through each other? I’m close to you, Sammy, and Max is close to me, and Max is close to Bella!”

Max the Motion Detector jumped up. “Like a game of telephone! Sammy tells me, I tell Lila, Lila tells Bella. We don’t NEED a cell tower — we ARE the network!”

Bella the Humidity Sensor received the warning just in time. “Brilliant! But what if Max wanders off to explore? We’d need to find a new path!”

That’s exactly what ad-hoc networks do! When Max moved, Sammy found a new path through other sensors nearby. The network reorganized itself — no adult (infrastructure) needed!

83.1.2 Key Words for Kids

Word	What It Means
Ad-Hoc Network	A network where devices talk directly to each other without needing a central hub, like passing notes in class
Multi-Hop	When a message jumps through several friends to reach someone far away, like a relay race
Self-Organizing	The network figures out how to connect all by itself, like kids forming teams at recess without a teacher

83.1.3 Try This at Home!

Play the “Ad-Hoc Message Relay” game with friends:

1. Setup: Stand in a field spread out so no one person can reach everyone by shouting
2. Round 1 - Single Hop: Try to shout a message directly to the farthest person. Hard to hear, right?
3. Round 2 - Multi-Hop: Pass the message through friends in between. Much easier!
4. Round 3 - Node Failure: Have one person in the chain walk away. Can you find a new path?
5. Discuss: What happens when too many people try to relay messages at the same time?

For Beginners: What Are Ad-Hoc Networks?

Traditional Networks use fixed infrastructure — Wi-Fi routers, cell towers, Ethernet switches — that someone has to install, power, and maintain before any communication can happen.

Ad-Hoc Networks skip all of that. Devices connect directly to each other and form a network on the fly. Every device can be both a sender and a relay (router) for other devices.

Real-World Analogy: Think of a hiking group in the wilderness. There are no roads, signs, or postal service. To get a message from the front of the group to the back, each person passes it to the next person in line. If someone moves, the chain adjusts. That is ad-hoc networking.

Why does this matter for IoT? Many IoT scenarios — disaster zones, remote farms, military operations, wildlife tracking — have no existing infrastructure. Ad-hoc networks let sensors and devices communicate immediately, anywhere, without waiting for someone to install a router.

The Big Trade-off:

You Gain	You Lose
No infrastructure needed	Higher energy use (every node routes)
Instant setup	More complex routing protocols
Resilience (no single point of failure)	Limited scalability (100–200 nodes max)
Works anywhere	Variable latency (depends on hop count)

Bottom Line: Ad-hoc networks are the go-to solution when you need communication where no infrastructure exists or when infrastructure cannot be relied upon.

83.2 Overview

Ad-hoc networks are infrastructure-less, self-organizing wireless networks where devices communicate directly without access points or base stations. Every device can act as both an endpoint and a router, forwarding packets for others.

This comprehensive topic is covered in three focused chapters:

83.2.1 Chapter Navigation

Chapter	Topics Covered	Time
Core Concepts and Characteristics	What is an ad-hoc network, key characteristics, infrastructure vs ad-hoc comparison, IoT relevance	~20 min
Multi-Hop Routing and Protocols	Why multi-hop, routing challenges, proactive/reactive/hybrid routing, protocol selection	~25 min
Applications and Practice	Real-world use cases, worked examples, knowledge checks, visual gallery	~20 min

83.3 How Ad-Hoc Networks Differ from Infrastructure Networks

The following diagram illustrates the fundamental architectural difference between infrastructure-based networks and ad-hoc networks:

In the infrastructure model, all devices must communicate through the central access point — a single point of failure. In the ad-hoc model, devices form direct peer-to-peer links and can relay traffic for each other, providing multiple redundant paths.

83.4 Learning Path

The following diagram shows the recommended learning sequence through the ad-hoc network topic:

83.5 Quick Start

Which Chapter Should I Read?

• New to ad-hoc networks? Start with Core Concepts and Characteristics
• Need to select a routing protocol? Jump to Multi-Hop Routing and Protocols
• Want practical examples and quizzes? Go to Applications and Practice

83.6 Key Concepts Preview

83.6.1 What Makes Ad-Hoc Networks Special?

Feature	Ad-Hoc Network	Traditional Network
Infrastructure	None needed	Requires APs/towers
Setup	Instant, self-organizing	Pre-planned deployment
Failure tolerance	High (multiple paths)	Low (single point of failure)
Scalability	Limited (10-200 nodes)	High (thousands)

83.6.2 Three Routing Paradigms

The three fundamental approaches to routing in ad-hoc networks represent different trade-offs between overhead and responsiveness:

1. Proactive (DSDV, OLSR): Maintains routes continuously — low latency, high overhead
2. Reactive (DSR, AODV): Discovers routes on-demand — low overhead, discovery delay
3. Hybrid (ZRP): Proactive within zones, reactive between — balanced approach

Putting Numbers to It

Proactive routing overhead calculation: For DSDV in a 100-node network with 30-second update intervals, each node broadcasts a routing table with 99 entries. Daily overhead: \(100 \times (86400/30) \times 99 \times 50\text{ bytes} = 1.43\text{ GB/day}\). Worked example: Compare to data traffic of 288 packets/day per node (every 5 minutes) × 100 bytes = 2.88 MB/day. Proactive overhead is 497× the actual data traffic! Clearly unsuitable for sparse IoT sensor reporting.

83.6.3 When to Use Ad-Hoc Networks

The decision to use ad-hoc networking depends on your deployment constraints:

• Disaster response (no existing infrastructure)
• Military/tactical operations (rapid deployment)
• Sensor networks (forests, oceans, farms)
• Vehicle-to-vehicle communication
• Temporary events (concerts, construction sites)

83.7 Ad-Hoc Network Protocol Stack

Understanding where ad-hoc protocols fit in the network stack helps clarify what each routing paradigm actually controls:

The ad-hoc routing layer (highlighted in orange) is where the key innovation happens. Traditional networks handle routing in dedicated infrastructure devices (routers), while ad-hoc networks distribute this responsibility across all participating nodes.

Common Pitfalls in Ad-Hoc Network Design

1. Assuming all ad-hoc networks are mesh networks: Ad-hoc refers to infrastructure-less operation, not topology. Bluetooth piconets are ad-hoc but use star topology. Do not conflate “ad-hoc” with “mesh.”

2. Ignoring the scalability ceiling: Flat ad-hoc networks struggle beyond 100–200 nodes because routing table size and control message overhead grow super-linearly. Plan for hierarchical routing (cluster heads) if your deployment exceeds this range.

3. Choosing reactive routing for frequent communication: Reactive protocols (DSR, AODV) save energy only when traffic is sparse. If sensors report every 30 seconds, the repeated route discovery floods waste more energy than proactive table maintenance.

4. Forgetting about the hidden terminal problem: Two nodes that cannot hear each other may transmit simultaneously to a common neighbor, causing collisions. Without RTS/CTS or equivalent MAC-layer mechanisms, ad-hoc throughput drops dramatically.

5. Underestimating energy cost of forwarding: Every intermediate node that relays packets for others consumes energy. In battery-powered IoT deployments, relay nodes can die much faster than leaf nodes, creating network partitions. Rotate relay duties or use energy-aware routing.

6. Neglecting security in open networks: Ad-hoc networks have no central authority to authenticate nodes. Without proper key management, any device can join and inject false routing information (e.g., black hole attacks, wormhole attacks). Always implement at minimum hop-count verification and source authentication.

83.8 Worked Example: Choosing an Ad-Hoc Routing Protocol

Worked Example: Forest Fire Monitoring Network

Scenario: A national park deploys 80 temperature and smoke sensors across a 2 km x 2 km forested area. Sensors report readings every 60 seconds to a gateway at the park ranger station. There is no Wi-Fi or cellular coverage. Sensors are battery-powered with a 1-year life requirement.

Step 1: Confirm ad-hoc is appropriate

• No existing infrastructure? Yes — no Wi-Fi, no cellular.
• Rapid deployment needed? Yes — fire season starts in 2 weeks.
• Mobile nodes? No — sensors are fixed after deployment.

Decision: Ad-hoc networking is appropriate due to lack of infrastructure.

Step 2: Estimate network parameters

• 80 nodes in a 2 km x 2 km area = ~25 m average spacing
• Radio range with IEEE 802.15.4 at 0 dBm: ~75 m (forest, with foliage attenuation)
• Average hop count to gateway: ~4–6 hops
• Traffic: 80 sensors x 1 report/60 s = ~1.3 packets/second network-wide

Step 3: Select routing paradigm

Factor	Proactive (DSDV)	Reactive (AODV)	Hybrid (ZRP)
Traffic pattern	Regular, periodic	Regular, periodic	Regular, periodic
Route freshness	Always ready	Discovery delay	Zone-ready
Energy for 80 nodes	Periodic updates ~OK	Flooding per discovery = expensive at 1.3 pkt/s	Moderate
Topology changes	Rare (fixed nodes)	Rare	Rare

Step 4: Decision

With regular periodic traffic (every 60 seconds) and fixed node positions, proactive routing (DSDV) is the best choice:

• Routes are always available — no discovery delay before each report
• Fixed topology means route updates are infrequent after initial convergence
• 80 nodes is within the scalability range for proactive protocols
• Energy cost of periodic updates is low because topology rarely changes

Why NOT reactive? With 1.3 packets/second of regular traffic, reactive route discovery would trigger frequently. Each discovery floods the network, consuming more energy than DSDV’s periodic updates.

Why NOT hybrid? With only 80 nodes in a small area, the complexity of zone management in ZRP provides no benefit over simpler DSDV.

Step 5: Validate energy budget

• DSDV update overhead for 80 nodes with stable topology: ~1 update/5 minutes per node
• Data transmission: 1 packet/60 s per sensor, ~4–6 hops average
• Total radio-on time: ~2% duty cycle
• At 2% duty cycle with 2x AA batteries (3000 mAh): estimated 14 months — meets the 1-year requirement with margin.

83.9 Ad-Hoc Network Scalability Calculator

Explore how network size affects proactive routing overhead:

viewof n_nodes = Inputs.range([10, 300], {value: 100, step: 10, label: "Number of nodes"})
viewof update_sec = Inputs.range([5, 120], {value: 30, step: 5, label: "Update interval (sec)"})
viewof entry_bytes = Inputs.range([20, 100], {value: 50, step: 5, label: "Bytes per routing entry"})

{
  const updates_per_day = 86400 / update_sec;
  const overhead_bytes = n_nodes * updates_per_day * (n_nodes - 1) * entry_bytes;
  const overhead_mb = overhead_bytes / 1e6;
  const overhead_gb = overhead_bytes / 1e9;
  const scalability_ok = n_nodes <= 150;
  return html`
    <div style="display:grid;grid-template-columns:repeat(3,1fr);gap:1rem;margin:1rem 0">
      <div style="background:#eaf4fb;border-left:4px solid #3498DB;padding:1rem;border-radius:4px">
        <div style="font-size:0.85rem;color:#555">Routing entries (network)</div>
        <div style="font-size:1.5rem;font-weight:bold;color:#2C3E50">${(n_nodes*(n_nodes-1)).toLocaleString()}</div>
        <div style="font-size:0.8rem;color:#777">N × (N-1) = O(N²)</div>
      </div>
      <div style="background:${scalability_ok ? '#eafaf1' : '#fdf2f8'};border-left:4px solid ${scalability_ok ? '#16A085' : '#E74C3C'};padding:1rem;border-radius:4px">
        <div style="font-size:0.85rem;color:#555">Daily overhead</div>
        <div style="font-size:1.5rem;font-weight:bold;color:#2C3E50">${overhead_gb >= 1 ? overhead_gb.toFixed(1)+' GB' : overhead_mb.toFixed(0)+' MB'}</div>
        <div style="font-size:0.8rem;color:#777">${scalability_ok ? 'Manageable' : 'Problematic!'}</div>
      </div>
      <div style="background:#fef9e7;border-left:4px solid #E67E22;padding:1rem;border-radius:4px">
        <div style="font-size:0.85rem;color:#555">Network status</div>
        <div style="font-size:1.2rem;font-weight:bold;color:#2C3E50">${scalability_ok ? 'Proactive OK' : 'Use Hybrid/Reactive'}</div>
        <div style="font-size:0.8rem;color:#777">Limit: ~150 nodes</div>
      </div>
    </div>
    <p style="font-size:0.9rem;color:#555">${n_nodes} nodes × ${(n_nodes-1)} entries × ${(updates_per_day).toFixed(0)} updates/day × ${entry_bytes} bytes = ${overhead_mb.toFixed(0)} MB/day. ${n_nodes > 150 ? 'Beyond 150 nodes, proactive routing overhead dominates. Consider ZRP or geographic routing.' : 'Within the flat proactive routing sweet spot.'}</p>
  `;
}

83.10 Knowledge Checks

Test your understanding of ad-hoc network fundamentals.

Worked Example: Ad-Hoc Network Range Calculation for Forest Monitoring

Scenario: Deploy 20 environmental sensors across 1km × 1km forest preserve. Calculate minimum node density and placement to ensure connectivity with 802.15.4 radios.

Given:

• Radio: IEEE 802.15.4 at 2.4 GHz, 0 dBm transmit power
• Free-space range: 100m (theoretical, no obstacles)
• Forest attenuation: -8 dB (dense foliage reduces range by ~60%)
• Effective range with foliage: 40m
• Terrain: Flat with uniform tree density
• Connectivity requirement: 95% network-wide (allow 5% edge nodes temporarily disconnected)

Steps:

1. Calculate effective radio range with environmental factors:
   • Path loss: Free-space + foliage attenuation
   • Free-space range at 0 dBm: 100m
   • Forest attenuation: -8 dB ≈ 60% range reduction
   • Effective range: 100m × 0.4 = 40m
2. Calculate required node density for coverage:
   • Coverage per node (disk area): π × (40m)² = 5,027 m²
   • Total area: 1,000,000 m² (1 km²)
   • Minimum nodes for coverage: 1,000,000 / 5,027 ≈ 199 nodes (unrealistic!)
   • But: Nodes only need connectivity, not full area coverage
3. Calculate connectivity requirement (multi-hop graph theory):
   • For connected graph: Average node degree ≥ 2.3 (empirical for random placement)
   • Nodes within 40m radius: π × (40m)² = 5,027 m²
   • Node density for connectivity: 2.3 neighbors / 5,027 m² = 0.00046 nodes/m²
   • Required nodes: 1,000,000 m² × 0.00046 = 460 nodes (still too many!)
4. Optimize with strategic placement (grid vs random):

   • Grid placement: Hexagonal grid with 40m spacing

   • Hexagonal grid efficiency: 0.866 × spacing

   • Grid spacing for 40m range: 40m / 0.866 = 46m per cell

   • Number of cells: (1000m / 46m) × (1000m / 46m) = 22 × 22 = 484 cells → 484 nodes

   • Adjusted for multi-hop: Use 70m grid spacing (1.75× radio range)

   • Cells: (1000m / 70m)² = 14 × 14 = 196 nodes

   • Each node reaches ~6 neighbors (hexagonal grid)

   • Network diameter: 14 hops max

5. Validate connectivity with given 20 nodes:
   • Given: 20 nodes available (budget constraint)
   • Grid spacing: (1000m × 1000m / 20)^0.5 ≈ 220m spacing
   • At 40m radio range: 220m >> 40m → Network will be disconnected!

Result: With 40m effective range and 20 nodes: - Grid placement: Most nodes have ZERO neighbors (220m >> 40m range) - Random placement: 2-3 small clusters, isolated nodes - Network partitioned into 5-8 disconnected islands

Solutions:

• Option A: Increase node count to 196 (70m spacing) → $$$ (10× more nodes)
• Option B: Use higher-power radios (+10 dBm) → 2.5× range = 100m → Allows 140m spacing → 52 nodes → Still need 2.6× more
• Option C: Strategic placement along paths/waterways (linear topology) → 20 nodes at 50m intervals covers 1km line
• Option D: Hybrid with long-range gateway → 20 sensors in clusters near gateway (multi-hop within cluster, long-range to gateway)

Key Insight: Ad-hoc network viability depends critically on node density vs radio range. Forest deployments with typical 40-100m range need high node density (100-200 nodes/km²). Budget-constrained deployments (<50 nodes) should use LoRa or cellular rather than short-range ad-hoc networking.

Decision Framework: When to Use Ad-Hoc vs Infrastructure

Use this decision tree to determine if ad-hoc networking is appropriate for your IoT deployment.

START: Deployment Scenario
│
├─ Is cellular/WiFi infrastructure available?
│  ├─ YES → Use infrastructure (cheaper, simpler)
│  │      [STOP - Ad-hoc not needed]
│  │
│  └─ NO → Continue assessment
│     │
│     ├─ Can you deploy gateways/access points?
│     │  ├─ YES → Use gateway model (hybrid)
│     │  │      [STOP - Single-hop to gateway better]
│     │  │
│     │  └─ NO → Continue assessment
│     │     │
│     │     ├─ Node density sufficient? (>1 node per radio_range²)
│     │     │  ├─ NO → Ad-hoc infeasible
│     │     │  │      [STOP - Use LoRa/satellite instead]
│     │     │  │
│     │     │  └─ YES → Continue assessment
│     │     │     │
│     │     │     ├─ Mobility requirement?
│     │     │     │  ├─ HIGH (vehicles, UAVs) → Use reactive routing (DSR, AODV)
│     │     │     │  ├─ MODERATE (people, robots) → Use hybrid routing (ZRP)
│     │     │     │  └─ LOW (fixed sensors) → Use proactive routing (DSDV)
│     │     │     │
│     │     │     └─ Energy constraint?
│     │     │        ├─ SEVERE (<2 years battery) → Ad-hoc risky (forwarding drains relay nodes)
│     │     │        ├─ MODERATE (2-5 years battery) → Use energy-aware routing
│     │     │        └─ NONE (mains/solar) → Any routing strategy viable
│     │     │
│     │     └─ [DECISION: Ad-hoc networking appropriate]
│

Example Decisions:

Scenario	Infrastructure?	Gateway Possible?	Density OK?	Mobility	Energy	Decision
Smart Building HVAC	Yes (WiFi)	N/A	N/A	Low	Mains	Use WiFi
Forest Fire Detection	No	Yes (solar towers)	Yes	None	Solar	Gateway model
Disaster Response	No	No	Medium	High	Moderate	Ad-hoc (DSR)
Wildlife Tracking	No	No	Low (km² sparse)	Medium	Severe	LoRa, not ad-hoc
Military Tactical	No	No	High	High	Moderate	Ad-hoc (AODV)
Smart Agriculture	Partial	Yes (farm buildings)	Yes	Low	Solar	Hybrid: gateway + ad-hoc

Red Flags for Ad-Hoc (indicates wrong choice): - ❌ Infrastructure already exists (ad-hoc adds complexity for no benefit) - ❌ Node density < 1 per 2× radio_range² (results in disconnected islands) - ❌ Severe energy constraints + high forwarding load (relay nodes die quickly) - ❌ Real-time latency <100ms required (multi-hop accumulates delay)

Common Mistake: Underestimating Multi-Hop Energy Cost for Relay Nodes

The Mistake: Deploying ad-hoc networks without accounting for the energy burden on high-betweenness nodes (central relays), leading to premature network partition.

Real-World Example: A 2020 smart agriculture deployment placed 40 soil sensors in grid pattern with corner gateway. Nodes adjacent to gateway died after 3 weeks (expected 2-year battery life) while edge nodes still had 90% battery. Network partitioned into unreachable outer ring.

Why This Happens:

Energy Asymmetry in Multi-Hop Networks:

• Edge nodes (sensors far from gateway): Originate traffic only
  • Energy per day: 10 packets × 50mJ transmit = 500mJ/day
• Relay nodes (path to gateway): Originate + forward traffic
  • Own traffic: 10 packets × 50mJ = 500mJ/day
  • Forwarding: 5 neighbors × 10 packets × (50mJ transmit + 30mJ receive) = 4,000mJ/day
  • Total: 4,500mJ/day (9× more than edge nodes!)

Quantified Impact:

• Edge node battery: 10,000mAh @ 3.6V = 129,600J
• Edge node lifetime: 129,600J / 500mJ/day = 259 days (~8 months)
• Relay node lifetime: 129,600J / 4,500mJ/day = 29 days (<1 month)

After 4 weeks: 3-5 relay nodes dead → network partitions → 60% of sensors unreachable

Solutions:

1. Over-provision relay node batteries:
   • Deploy 3× larger batteries for nodes within 2 hops of gateway
   • Cost: $15 extra × 8 relay nodes = $120 (vs $500 replacement visits)
2. Energy-aware routing (avoid low-battery relays):
   • Route cost = hop_count × (1 / remaining_battery²)
   • Distributes traffic away from depleted nodes
   • Extends min-battery lifetime from 29 → 87 days (3×)
3. Rotating relay duty (for mobile networks):
   • Node with >80% battery volunteers as relay
   • Load shared across nodes over time
   • Equalizes battery drain
4. Hierarchical architecture (static networks):
   • Deploy 5-8 mains-powered relay nodes as backbone
   • Battery sensors only do single-hop to nearest relay
   • Eliminates multi-hop energy burden on sensors

Measured Impact of Energy-Aware Routing (Smart Agriculture, Post-Fix):

• Before: Min battery 5% at 4 weeks (3 dead nodes), network partitioned
• After: Min battery 32% at 20 weeks, zero dead nodes
• Result: 5× network lifetime extension with zero hardware changes

Design Rule: In any ad-hoc network, identify high-betweenness nodes during planning (nodes on shortest paths between many source-destination pairs). These nodes need either: - Larger batteries (2-10× capacity) - Mains/solar power - Energy-aware routing to distribute load

Never assume uniform energy consumption across ad-hoc network nodes.

83.11 Concept Relationships

Concept	Relationship	Connected Concept
Infrastructure-Less Operation	Eliminates deployment requirements but introduces	Routing Complexity
Multi-Hop Forwarding	Distributes energy across nodes but accumulates	Per-Hop Latency
Proactive Routing	Maintains continuous route availability generating	O(N²) Update Overhead
Reactive Routing	Discovers routes on-demand eliminating idle overhead but introducing	Discovery Latency
Self-Organization	Enables instant deployment at the cost of	Convergence Time

83.12 See Also

• Ad-Hoc Networks: Core Concepts - Detailed characteristics and architecture
• Ad-Hoc Networks: Multi-Hop Routing - Protocol mechanics and selection
• Ad-Hoc Networks: Applications - Real-world use cases
• Multi-Hop Fundamentals - Foundation for relay communication
• Wireless Sensor Networks - Stationary ad-hoc deployments

Interactive Quiz: Match Concepts

Interactive Quiz: Sequence the Steps

83.13 Enhanced Summary

83.13.1 Core Concepts Recap

Ad-hoc networks are infrastructure-less, self-organizing wireless networks where every device can act as both endpoint and router. They enable IoT communication in scenarios where no fixed infrastructure exists.

83.13.2 Key Trade-offs

Dimension	Ad-Hoc Advantage	Ad-Hoc Cost
Infrastructure	Zero deployment needed	Every node must route
Resilience	Multiple redundant paths	Routing protocol complexity
Setup time	Instant, self-organizing	Initial convergence period
Mobility	Handles node movement	Route instability, overhead
Scalability	Good for 10–200 nodes	Degrades beyond ~200 nodes

83.13.3 Routing Paradigm Selection Guide

Your Scenario	Best Paradigm	Why
Fixed sensors, regular reporting	Proactive (DSDV)	Routes always ready, low update cost for stable topology
Mobile nodes, occasional data	Reactive (AODV/DSR)	Only discovers routes when needed, saves energy
Large network with mixed traffic	Hybrid (ZRP)	Proactive for local, reactive for distant communication
Intermittent connectivity	DTN (store-carry-forward)	Tolerates network partitions

83.13.4 What to Study Next

This chapter provided a high-level overview. Dive deeper into the sub-chapters:

1. Core Concepts and Characteristics — detailed definitions, characteristics, and comparisons
2. Multi-Hop Routing and Protocols — protocol mechanics, selection criteria, and performance analysis
3. Applications and Practice — real-world deployments, hands-on exercises, and worked problems

83.14 Related Chapters

Deep Dives and Related Topics

Specific Routing Protocols:

• Ad-hoc Routing: Proactive (DSDV) - Table-driven routing with sequence numbers
• Ad-hoc Routing: Reactive (DSR) - On-demand source routing
• Ad-hoc Routing: Hybrid (ZRP) - Zone-based hybrid routing

Advanced Topics:

• Delay-Tolerant and Social Routing - Networks with intermittent connectivity
• Ad-hoc Production and Review - Protocol comparison and review
• Ad-hoc Labs and Quiz - Hands-on experiments

Related Architectures:

• Multi-Hop Fundamentals - Multi-hop communication basics
• Wireless Sensor Networks - WSN fundamentals
• UAV Networks - Flying ad-hoc networks

Protocols Using Ad-Hoc Principles:

• Zigbee Mesh - AODV-like routing
• Thread Networking - IPv6-based mesh
• RPL Routing - Low-power lossy networks

Simulations:

• Simulations Hub - Interactive ad-hoc routing simulators
• Network Design and Simulation - NS-3, OPNET tools

83.15 Start Learning

Ready to begin? Start with the first chapter:

Begin with Core Concepts and Characteristics

Label the Diagram

83.16 What’s Next

If you want to…	Read this
Study core ad hoc concepts and characteristics	Core Concepts and Characteristics
Learn multi-hop routing protocols in detail	Multi-Hop Routing and Protocols
Apply concepts to real-world deployments	Applications and Practice
Study DSDV proactive routing	Ad-hoc Routing: Proactive (DSDV)
Study DTN for disconnected networks	DTN Fundamentals

💻 Code Challenge