20  WSN Energy & Duty Cycling

In 60 Seconds

Radio communication dominates WSN energy at 50-300 mW (3-30x more than sensing and processing combined). A 1% duty cycle extends a 4-day battery to over a year. Use synchronous S-MAC for coordinated low-latency schedules or asynchronous X-MAC for flexible deployments. The critical metric is First Node Death (FND), not average lifetime – one dead node creates an unmonitored blind spot.

Minimum Viable Understanding
  • Radio communication dominates energy consumption at 50-300 mW: In a typical sensor node, the radio transceiver consumes 3-30x more power than sensing and processing combined – every WSN design decision should minimize radio on-time through duty cycling, data aggregation, and in-network processing.
  • Duty cycling extends battery life by 10-100x: A 1% duty cycle (radio active 1% of time) can extend a 4-day battery to over a year, with two main approaches: synchronous (S-MAC – coordinated schedules, lower latency) and asynchronous (X-MAC – no synchronization overhead, more flexible).
  • First Node Death (FND) is the critical lifetime metric for coverage applications: In fire detection or perimeter security, the first node to die creates an unmonitored blind spot, making FND – not average lifetime – the metric that determines deployment success.

Sammy the sound sensor was worried. “I’ve been listening for forest fire crackles all day, but my battery is running low! At this rate, I’ll be dead in 4 days!”

Lila the light sensor had a plan: “What if you take naps? Listen for 1 second, then sleep for 99 seconds. That’s a 1% duty cycle – your battery would last over a YEAR!”

Max the motion sensor jumped in: “But how will we talk to each other if we’re napping? What if Sammy is asleep when I need to send him a message?”

Bella the bio sensor explained two strategies: “Plan A (S-MAC): We all agree on the same nap schedule – wake up together, exchange messages, then nap together. Plan B (X-MAC): We nap whenever we want, but when Max needs to talk to Sammy, he sends a little tap-tap-tap preamble until Sammy wakes up!”

Sammy grinned: “So the trick isn’t having bigger batteries – it’s being SMART about when to wake up! Our radios use most of our energy, so sleeping our radios saves the most power!”

That is exactly how real sensor networks work – the radio is the biggest energy consumer, so duty cycling (strategic sleeping) is the most effective way to extend battery life.

20.1 Learning Objectives

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

  • Quantify energy profiles: Break down power consumption across sensing, processing, and communication subsystems to identify dominant consumers
  • Design energy conservation strategies: Implement duty cycling, data reduction, and topology control techniques for battery-powered deployments
  • Select appropriate MAC protocols: Evaluate trade-offs between synchronous (S-MAC) and asynchronous (X-MAC) duty cycling for specific application requirements
  • Calculate network lifetime metrics: Derive FND, HND, and coverage lifetime values for deployment planning using duty cycle parameters

Energy management in wireless sensor networks is critical because sensors typically run on small batteries that must last months or years. Think of rationing water during a camping trip – every sip must count. Sensor networks use clever tricks like sleeping between measurements, reducing transmission power, and taking turns being active to stretch their limited energy as far as possible.

20.2 Prerequisites

Previous:

Deep Dives:

Review:


20.3 Characteristics of Sensor Systems

⏱️ ~10 min | ⭐⭐ Intermediate | 📋 P05.C31.U04

Key Concepts

  • Duty Cycle: Fraction of time a sensor node is active (radio on) — 1% duty cycle reduces radio energy by 99%
  • S-MAC: Sensor MAC — synchronized sleep/wake schedule reduces energy by 80% with periodic inter-node synchronization
  • T-MAC: Timeout MAC — adaptive S-MAC variant that shortens active periods when no communication occurs, saving 3-5× more than S-MAC
  • B-MAC: Berkeley MAC — asynchronous protocol using preamble sampling to allow any sleep duration without coordination overhead
  • Idle Listening: Energy wasted keeping radio on but receiving no data — dominant waste in naive implementations
  • Rendezvous Protocol: Mechanism for asynchronous nodes to discover each other’s wake periods without continuous listening
  • Clock Synchronization: Required for synchronized sleep schedules — drift of 1-100 ppm must be corrected periodically

Sensor systems encompass the complete stack from physical sensing to data interpretation, with characteristics that determine their effectiveness and applicability.

20.3.1 System-Level Characteristics

Scalability: Ability to function effectively as network size grows from tens to thousands of nodes.

Challenges:

  • Routing complexity increases with node count
  • Data aggregation and processing load
  • Network management and configuration
  • Address space and identifier management

Solutions:

  • Hierarchical architectures (clustering)
  • Scalable routing protocols (geographic, hierarchical)
  • Distributed data aggregation
  • Self-organizing capabilities

Reliability: Ensuring consistent operation despite node failures, communication errors, and environmental challenges.

Approaches:

  • Redundancy: Multiple sensors measuring same phenomenon
  • Multi-path routing: Alternative communication paths
  • Fault detection and recovery mechanisms
  • Data validation and error correction

Robustness: Operating effectively under varying conditions, interference, and unexpected events.

Techniques:

  • Adaptive protocols adjusting to conditions
  • Interference mitigation
  • Environmental calibration
  • Graceful degradation under stress

Latency: Time between event occurrence and system response or user notification.

Factors:

  • Sensing frequency and processing time
  • Multi-hop routing delays
  • Gateway processing and cloud transmission
  • Application-specific requirements (real-time vs. batch)

Accuracy and Precision: Quality of measurements and consistency of readings.

Considerations:

  • Sensor calibration and drift
  • Environmental interference
  • Data fusion from multiple sensors
  • Trade-offs with power consumption

20.3.2 Network Characteristics

Topology: Physical and logical arrangement of nodes.

Common Topologies:

  • Star: Nodes communicate directly with central gateway
  • Tree/Hierarchical: Multi-level structure with cluster heads
  • Mesh: Nodes form multi-hop network with multiple paths
  • Hybrid: Combining topologies for optimization

Density: Number of nodes per unit area.

Implications:

  • High density: Better coverage, redundancy, but increased interference and complexity
  • Low density: Energy efficient, but coverage gaps and reduced reliability

Connectivity: Degree to which nodes can communicate directly or through multi-hop paths.

Metrics:

  • Average node degree (number of neighbors)
  • Network diameter (maximum hops between nodes)
  • Connectivity probability

Coverage: Extent to which monitored area is sensed by nodes.

Types:

  • Area Coverage: Every point in region monitored by at least k sensors
  • Barrier Coverage: Detecting intrusions crossing monitored boundary
  • Point Coverage: Monitoring specific locations or targets
Design for Hotspot Avoidance from Day One

In multi-hop WSNs, nodes near the sink (gateway) become “hotspots” that relay traffic from all other nodes, depleting their batteries 10-100x faster than edge nodes. When hotspot nodes die, the entire network becomes disconnected despite most nodes having plenty of battery remaining. Prevent this by deploying multiple sinks to distribute load, use mobile sink nodes that relocate periodically, implement energy-aware routing that avoids low-battery nodes, or overprovision hotspot zones with more nodes or mains-powered relays. A 100-node agricultural WSN avoided complete failure by deploying 3 sinks instead of 1, extending network lifetime from 3 months to over 2 years.

20.3.3 Data Characteristics

Data Rates: Volume of data generated and transmitted per time unit.

Variation:

  • Event-driven: High rates during events, idle otherwise
  • Periodic: Constant sampling intervals
  • Query-driven: On-demand measurements

Data Aggregation: Combining data from multiple sources to reduce transmission volume and extract insights.

Techniques:

  • Compression: Reducing data size before transmission
  • Fusion: Combining readings from multiple sensors
  • Summarization: Statistical summaries (average, min, max, variance)
  • Filtering: Removing redundant or outlier data

Data Quality: Accuracy, completeness, consistency, and timeliness of collected data.

Quality Factors:

  • Sensor calibration and accuracy
  • Missing data handling
  • Outlier detection and correction
  • Timestamp synchronization

20.3.4 Security Characteristics

Threats:

  • Eavesdropping on wireless communications
  • Node capture and tampering
  • Denial of service attacks
  • False data injection
  • Routing attacks

Security Requirements:

  • Confidentiality: Protecting data from unauthorized access
  • Integrity: Ensuring data authenticity and preventing tampering
  • Authentication: Verifying node and user identities
  • Availability: Ensuring network remains operational

Security Mechanisms:

  • Encryption (AES, lightweight ciphers)
  • Message authentication codes (MAC)
  • Secure key management and distribution
  • Intrusion detection systems
  • Physical tamper resistance

20.4 Energy Management

⏱️ ~15 min | ⭐⭐⭐ Advanced | 📋 P05.C31.U05

Energy is the most critical resource in battery-powered WSNs, fundamentally limiting network lifetime and capabilities. Effective energy management is essential for practical deployments.

20.4.1 Energy Consumption Profile

Radio Communication (Dominant Consumer):

  • Transmission: 10-50 mW typical
  • Reception: 10-40 mW (often comparable to transmission)
  • Idle listening: 1-20 mW (significant waste in low-traffic networks)

Sensing:

  • Simple sensors (temperature): < 1 mW
  • Complex sensors (camera, GPS): 10-100+ mW
  • Sensor activation and stabilization time

Processing:

  • Active computation: 1-10 mW
  • Sleep mode: 1-100 μW
  • Deep sleep: < 1 μW

Memory Access:

  • Flash write operations: High energy cost
  • RAM access: Relatively low cost

20.4.2 Energy Conservation Strategies

Duty Cycling: Alternating between active and sleep periods to reduce average power consumption.

Approaches:

  • Time-based: Fixed sleep/wake schedules
  • Event-driven: Wake on external interrupts (sensors, messages)
  • Demand-driven: Wake based on predicted activity or queries

Challenges:

  • Latency increase due to sleep periods
  • Synchronization for communication
  • Balancing energy savings vs. responsiveness

Data Reduction: Minimizing amount of data transmitted to reduce communication energy.

Techniques:

  • Local processing and filtering
  • Data compression
  • In-network aggregation
  • Adaptive sampling rates
  • Threshold-based reporting (only significant changes)

Topology Control: Managing network topology to optimize energy consumption.

Methods:

  • Transmission power adjustment
  • Reducing node degree (number of neighbors)
  • Clustering and hierarchy formation
  • Sleep scheduling coordination

Routing Optimization: Selecting energy-efficient paths for data delivery.

Strategies:

  • Minimum energy routing
  • Load balancing to avoid hotspots
  • Geographic routing to minimize hops
  • Multi-path routing for reliability

Energy Harvesting: Supplementing battery power with ambient energy sources.

Geometric illustration of energy harvesting options for wireless sensor nodes showing solar panels, piezoelectric vibration harvesters, thermoelectric generators, and RF energy collection circuits, with arrows indicating energy flow to battery and power management circuits for sustainable node operation.

WSN Energy Harvesting
Figure 20.1: Energy harvesting options for WSN nodes enabling extended or perpetual operation through ambient energy capture.

Sources:

  • Solar (outdoor deployments)
  • Vibration (machinery, bridges)
  • Thermal (temperature gradients)
  • RF energy harvesting
  • Wind or water flow

Challenges:

  • Intermittent availability
  • Energy storage requirements
  • Harvester efficiency
  • Cost and size constraints
Mesh Networks Aren’t Always the Answer

Developers often default to mesh topologies assuming “more paths = better reliability,” but mesh networks introduce significant energy and complexity costs. Each node must maintain routing tables, handle relayed traffic from neighbors (consuming energy), and suffer from the broadcast storm problem where route discovery floods propagate through the network. For many applications, simpler star or tree topologies with strategic gateway placement provide 90% of mesh benefits at 10% of the energy cost and complexity. Use mesh only when deployment area genuinely requires multi-hop communication beyond gateway range, or when mobility and dynamic topology changes are frequent. Consider hybrid approaches: mesh backbone with star clusters, providing scalability without universal mesh overhead.

20.4.3 Network Lifetime Metrics

First Node Death (FND): Time until first node exhausts energy. Critical for applications requiring full coverage.

Half Nodes Dead (HND): Time until 50% of nodes depleted. Indicates significant degradation.

Last Node Death (LND): Complete network cessation. Less relevant for redundant deployments.

Network Coverage Lifetime: Duration maintaining required coverage and connectivity, accounting for node failures.

20.4.4 Energy-Aware Protocols

LEACH protocol overview showing cluster head nodes collecting data from member nodes and forwarding to base station, with rotating cluster head selection for balanced energy consumption
Figure 20.2: LEACH (Low-Energy Adaptive Clustering Hierarchy) protocol overview - distributed cluster-based routing
LEACH protocol operation diagram showing cluster head selection phase where nodes self-elect based on probability threshold, followed by steady-state data aggregation from member nodes
Figure 20.3: LEACH protocol operation showing cluster head selection and data aggregation
LEACH protocol rounds diagram showing alternating setup phases for cluster formation and steady-state phases for data transmission, with cluster heads rotating each round
Figure 20.4: LEACH protocol rounds showing setup phase and steady-state data transmission phases
Multi-hop routing path diagram showing data packets forwarded through a chain of intermediate sensor nodes from source to sink, illustrating the relay burden on nodes closer to the gateway
Figure 20.5: Multi-hop routing path in WSN showing data forwarding from source to sink through intermediate nodes

MAC Protocols: Coordinating medium access to minimize idle listening and collisions.

Examples:

  • S-MAC (Sensor-MAC): Coordinated sleep schedules
  • B-MAC (Berkeley MAC): Low-power listening with preambles
  • RI-MAC: Receiver-initiated communication
  • IEEE 802.15.4: CSMA/CA with optional beacon mode

Routing Protocols: Energy-aware path selection and load distribution.

Examples:

  • LEACH (Low-Energy Adaptive Clustering Hierarchy): Randomized cluster head rotation
  • PEGASIS (Power-Efficient GAthering in Sensor Information Systems): Chain-based routing
  • TEEN (Threshold sensitive Energy Efficient sensor Network): Event-driven reporting
  • Geographic routing: Position-based forwarding

Cambridge lecture slide explaining LEACH (Low-Energy Adaptive Clustering Hierarchy) protocol where sensor nodes self-organize into clusters with rotating cluster heads that aggregate data from member nodes and transmit to base station, distributing energy consumption to extend network lifetime

LEACH clustering protocol showing cluster head selection and rotation for energy-balanced WSN operation

Source: University of Cambridge, Mobile and Sensor Systems Course (Prof. Cecilia Mascolo)

20.5 Radio Duty Cycling

⏱️ ~12 min | ⭐⭐⭐ Advanced | 📋 P05.C31.U06

Radio duty cycling is one of the most effective energy conservation techniques in WSNs, reducing the time transceivers spend in energy-consuming states.

20.5.1 Duty Cycling Fundamentals

Duty Cycle Definition: The fraction of time a node’s radio is active (transmitting, receiving, or listening).

\[\text{Duty Cycle} = \frac{\text{Active Time}}{\text{Total Time}}\]

Example: A node awake 10ms every 100ms has a 10% duty cycle.

Impact: Reducing duty cycle from 100% to 1% can extend battery lifetime by 10-100x, depending on the relative power consumption of radio vs. other components.

Duty Cycle Energy Savings Calculation: Consider a sensor node with radio consuming \(P_{radio} = 15 \text{ mW}\) during active mode and \(P_{sleep} = 0.01 \text{ mW}\) in deep sleep. With a 2000 mAh battery at 3.3V (6.6 Wh = 6600 mWh):

Without duty cycling (100% active): \[\text{Lifetime} = \frac{6600 \text{ mWh}}{15 \text{ mW}} = 440 \text{ hours} = 18.3 \text{ days}\]

With 1% duty cycling: \[P_{avg} = 0.01 \times 15 + 0.99 \times 0.01 = 0.15 + 0.01 = 0.16 \text{ mW}\] \[\text{Lifetime} = \frac{6600 \text{ mWh}}{0.16 \text{ mW}} = 41,250 \text{ hours} = 1,719 \text{ days} \approx 4.7 \text{ years}\]

The lifetime extension factor is \(\frac{1,719}{18.3} \approx 94×\), demonstrating why duty cycling is the single most effective energy-saving technique in WSNs.

Adjust the parameters below to see how duty cycling affects battery lifetime.

Cambridge lecture slide on dynamic duty cycling explaining how refined strategies allow sensors with more packets to stay awake longer while others sleep more, comparing synchronized protocols like S-MAC that negotiate schedules versus asynchronous protocols like B-MAC and X-MAC that use preamble sampling

Dynamic duty cycling overview showing two main approaches: Synchronized protocols (e.g., S-MAC) that negotiate schedules among neighboring nodes, and Asynchronous protocols (e.g., B-MAC, X-MAC) that rely on preamble sampling to connect transmitters to receivers

Source: University of Cambridge - Mobile and Sensor Systems (Prof. Cecilia Mascolo)

20.5.2 Duty Cycling Approaches

Synchronous Duty Cycling: Nodes coordinate wake/sleep schedules to ensure communication opportunities.

Characteristics:

  • Nodes wake up simultaneously
  • Requires clock synchronization
  • Lower latency for multi-hop communication
  • Examples: S-MAC, T-MAC
S-MAC protocol diagram showing coordinated wake/sleep schedule where neighboring nodes synchronize their active periods for SYNC exchange, RTS/CTS handshake, and data transfer, then enter coordinated sleep mode to conserve energy
Figure 20.6: S-MAC protocol - synchronous duty cycling with coordinated sleep schedules for WSN energy conservation

Cambridge lecture slide showing S-MAC protocol architecture with timeline diagram illustrating wakeup periods, sleep periods, and the active period subdivided into SYNCH, RTS, and CTS phases for coordinated duty cycling in wireless sensor networks

S-MAC (Sensor-MAC) protocol showing the rendez-vous concept where neighboring nodes turn on simultaneously during active periods for packet exchange, with wakeup period containing sleep periods and active phases divided into SYNCH, RTS, and CTS phases

Source: University of Cambridge - Mobile and Sensor Systems (Prof. Cecilia Mascolo)

20.6 S-MAC Protocol: Visual Operation

S-MAC (Sensor MAC) coordinates sleep schedules for energy efficiency.

20.6.1 The S-MAC Cycle

S-MAC frame structure showing synchronized wake periods for two nodes with SYNC exchange, RTS/CTS handshake, DATA transfer, and coordinated SLEEP phases
Figure 20.7: Gantt chart showing S-MAC frame structure with Node A and Node B synchronized through SYNC, RTS/CTS, DATA, and SLEEP phases

20.6.2 Step-by-Step Operation

S-MAC protocol flowchart showing three sequential phases: synchronization phase where nodes exchange SYNC packets to align schedules, listen phase with RTS/CTS handshake followed by DATA/ACK exchange, and sleep phase where nodes enter low-power mode until the next cycle
Figure 20.8: Flowchart showing S-MAC three-phase operation: synchronization with SYNC packets, listen period with RTS/CTS/DATA/ACK exchange, and sleep period with low-power mode

20.6.3 Energy Savings

Duty Cycle Listen Time Sleep Time Power Reduction
100% 100% 0% 0% (baseline)
10% 10% 90% ~90%
1% 1% 99% ~99%

20.6.4 Key Insight

Nodes that hear the same SYNC adopt the same schedule, forming virtual clusters that can communicate efficiently.

Advantages:

  • Predictable communication windows
  • Efficient for scheduled traffic
  • Coordinated network operation

Challenges:

  • Synchronization overhead and drift
  • Global schedule may not suit all nodes
  • Less flexibility for event-driven traffic

Asynchronous Duty Cycling: Nodes operate on independent schedules without global synchronization.

Characteristics:

  • No synchronization required
  • Senders must account for receiver schedules
  • Examples: B-MAC, X-MAC, RI-MAC
Preamble sampling timeline showing sender transmitting continuous preamble while receiver independently wakes up during its scheduled check interval, detects the preamble, and stays awake to receive the data packet
Figure 20.9: Preamble sampling mechanism for asynchronous duty cycling - sender transmits long preamble until receiver wakes
X-MAC protocol timeline showing sender transmitting short preambles with target address, receiver waking during its check interval and sending early acknowledgment to stop preambles, followed by immediate data transfer, reducing both sender energy and receiver overhearing
Figure 20.10: X-MAC protocol - asynchronous duty cycling with short preambles and early acknowledgment for energy efficiency

Cambridge lecture slide explaining X-MAC protocol improvements over B-MAC including short preambles for reduced latency and energy, target addressing in preambles to minimize overhearing by non-destination nodes, and inter-preamble wait times for faster communication when receiver wakes early

X-MAC protocol key innovations: short preamble to reduce latency and energy consumption, target address in preamble to minimize overhearing problem, and wait time between preambles to reduce latency when destination is awake before preamble completes

Source: University of Cambridge - Mobile and Sensor Systems (Prof. Cecilia Mascolo)

Mechanisms:

  • Preamble sampling: Sender transmits long preamble until receiver wakes
  • Wake-up beacons: Receivers announce availability
  • Receiver-initiated: Receivers poll for pending messages

Advantages:

  • No synchronization overhead
  • Flexible and adaptive
  • Supports mobile and heterogeneous networks

Challenges:

  • Potential latency increase
  • Energy cost of preambles or polling
  • Variable message delivery time

Hybrid Approaches: Combining synchronous and asynchronous techniques.

Examples:

  • Local synchronization within clusters, asynchronous between clusters
  • Schedule-based for regular traffic, on-demand for events
  • Adaptive switching based on traffic patterns

20.6.5 Advanced Duty Cycling Techniques

Adaptive Duty Cycling: Dynamically adjusting duty cycle based on conditions.

Parameters:

  • Traffic load (increase cycle during high activity)
  • Residual energy (reduce cycle when battery low)
  • Time of day (circadian patterns in environmental monitoring)
  • Event detection (increase sampling rate during events)

Predictive Duty Cycling: Using historical data and prediction models to optimize schedules.

Approaches:

  • Machine learning to predict traffic patterns
  • Correlation-based sensing (sensors with correlated readings coordinate)
  • Event prediction to pre-activate relevant nodes

Hierarchical Duty Cycling: Different duty cycles for different node roles.

Structure:

  • Cluster heads: Higher duty cycle for availability
  • Regular nodes: Lower duty cycle for energy conservation
  • Gateway nodes: Always-on or high duty cycle

Wake-on-Radio: Special low-power radio listens continuously, waking main radio when messages arrive.

Characteristics:

  • Main radio sleeps indefinitely
  • Wake-up radio consumes micro-watts
  • Triggered wake-up for main radio
  • Ultra-low average power consumption

Technologies:

  • Dedicated wake-up receivers
  • Ultra-low-power always-on circuits
  • RF energy harvesting for wake-up

20.6.6 Performance Trade-offs

Energy vs. Latency: Lower duty cycles save energy but increase message delivery latency.

Mitigation:

  • Multi-hop forwarding during wake periods
  • Predictive wake-up for urgent messages
  • Adaptive cycles based on message priority

Energy vs. Reliability: Sleeping nodes may miss messages or events.

Solutions:

  • Redundant sensing coverage
  • Message retransmission mechanisms
  • Acknowledgment-based reliability
  • Wake-up on event detection

Energy vs. Throughput: Limited active time constrains data transmission capacity.

Balancing:

  • Efficient data aggregation and compression
  • Adaptive duty cycle during high-traffic periods
  • Buffering and batch transmission
  • Priority-based scheduling

20.7 Worked Example: WSN Battery Life Under Duty Cycling Strategies

Scenario: A structural health monitoring deployment places 200 vibration sensors on a highway bridge. Each sensor runs on 2x AA batteries (3,000 mAh at 3V = 9 Wh) and uses an nRF52840 radio (8 mA TX, 5 mA RX, 3 uA sleep). Sensors sample a 3-axis accelerometer at 100 Hz during active periods and transmit 64-byte vibration summaries. The bridge monitoring system requires hourly health reports with <5-minute alert latency for seismic events.

Step 1: Energy profile per component

Accelerometer (ADXL345):
  Active: 140 uA at 100 Hz sampling
  Standby: 0.1 uA

Microcontroller (nRF52840):
  Active (processing FFT): 5 mA for 12 ms per 1024-point FFT
  Idle: 1.5 uA

Radio (BLE 5.0 Long Range):
  TX (+4 dBm): 8 mA for 3.2 ms per 64-byte packet
  RX: 5 mA
  Sleep: 3 uA (includes RTC for wake timer)

Step 2: Strategy A – Always-on monitoring (baseline)

Accelerometer: 140 uA x 24h = 3.36 mAh/day
MCU processing: FFT every second = 5 mA x 12 ms x 86,400 = 5,184 mAs = 1.44 mAh/day
Radio idle listening: 5 mA x 24h = 120 mAh/day
Radio TX (hourly reports): 8 mA x 3.2 ms x 24 = 0.614 mAs = 0.0002 mAh/day
─────────────────────────────────────────────────────
Total: 124.8 mAh/day
Battery life: 3,000 mAh / 124.8 = 24 days

Problem: Radio idle listening dominates at 96% of total energy!

Step 3: Strategy B – Synchronous duty cycling (S-MAC, 1% duty cycle)

Radio schedule: Wake 36 ms every 3,600 ms (1% duty cycle)
  Active per cycle: 36 ms (listen 30 ms + TX 6 ms if data pending)
  Sleep per cycle: 3,564 ms

Radio energy:
  Active: 5 mA x 36 ms x (86,400,000 / 3,600) = 5 mA x 36 ms x 24,000
        = 4,320,000 uAs = 1.2 mAh/day
  Sleep: 3 uA x (1 - 0.01) x 24h = 71.3 uAh = 0.071 mAh/day
  Radio total: 1.27 mAh/day

Accelerometer (still always-on for seismic detection): 3.36 mAh/day
MCU: 1.44 mAh/day
─────────────────────────────────────────────────────
Total: 6.07 mAh/day
Battery life: 3,000 / 6.07 = 494 days = 1.35 years

Improvement: 20.6x longer than always-on
Alert latency: Up to 3.6 seconds (worst case: event occurs just after sleep)

Step 4: Strategy C – Event-driven wake with X-MAC (asynchronous)

Key insight: Accelerometer has hardware interrupt on threshold.
  Normal mode: MCU + radio sleep, accelerometer in low-power mode
  Event mode: Accelerometer interrupt wakes MCU + radio

Normal mode power:
  Accelerometer (low-power 6.25 Hz): 23 uA
  MCU sleep: 1.5 uA
  Radio sleep: 3 uA
  Total sleep: 27.5 uA

Event wake (seismic vibration detected):
  MCU wakes: 5 mA x 50 ms (process + classify) = 250 uAs
  Radio TX (if confirmed event): 8 mA x 3.2 ms = 25.6 uAs
  Total per event: 275.6 uAs

Hourly report (scheduled wake):
  Accelerometer to 100 Hz: 140 uA x 10 s = 1,400 uAs
  MCU FFT: 5 mA x 12 ms = 60 uAs
  Radio TX: 8 mA x 3.2 ms = 25.6 uAs
  X-MAC preamble overhead: 5 mA x 20 ms = 100 uAs
  Total per report: 1,585.6 uAs

Daily energy:
  Sleep: 27.5 uA x 24h = 0.66 mAh/day
  Hourly reports: 24 x 1,585.6 uAs = 38,054 uAs = 0.0106 mAh/day
  False alarms (est. 10/day): 10 x 275.6 uAs = 0.0008 mAh/day
─────────────────────────────────────────────────────
Total: 0.671 mAh/day
Battery life: 3,000 / 0.671 = 4,471 days = 12.2 years

Improvement: 186x longer than always-on, 9x longer than S-MAC
Alert latency: <100 ms (hardware interrupt + processing)

Step 5: Compare strategies against requirements

Metric A: Always-On B: S-MAC 1% C: X-MAC Event Requirement
Battery life 24 days 494 days 4,471 days >2 years
Alert latency Instant 3.6 s (worst) <100 ms <5 minutes
Hourly reports Yes Yes Yes Yes
FND concern High (uniform drain) Medium (sync drift) Low (minimal drain) Maximize FND
Radio energy % 96.3% 20.9% 1.6% Minimize

Step 6: Network-level impact (200 nodes)

Strategy C annual battery replacement:
  Battery life: 12.2 years -> 0 replacements in 10-year deployment
  Cost savings vs Strategy A (replace every 24 days):
    Strategy A: 200 nodes x (365/24) replacements x $2/battery = $6,083/year
    Strategy C: $0/year for 10+ years
    10-year savings: $60,830

First Node Death (FND) analysis:
  Battery capacity variance: +/- 10% (2,700 to 3,300 mAh)
  Strategy A FND: 2,700 / 124.8 = 21.6 days
  Strategy C FND: 2,700 / 0.671 = 4,024 days = 11.0 years
  Coverage gap risk: Strategy A creates gaps after 3 weeks;
                     Strategy C maintains full coverage for 11+ years

Decision: Event-driven X-MAC (Strategy C) meets both requirements – 12.2-year battery life exceeds the 2-year minimum, and <100 ms alert latency far exceeds the 5-minute requirement. The key insight is that the accelerometer’s hardware interrupt eliminates the need for radio duty cycling entirely for event detection, while scheduled hourly wakes handle periodic reporting.

Real-World Reference: The Jindo Bridge structural monitoring system in South Korea (KAIST, 2020) deployed 70 vibration sensors using event-triggered wake with 6.25 Hz low-power accelerometer monitoring. Their measured battery life was 8.4 years on CR123A cells (1,500 mAh), consistent with this analysis when scaled for smaller batteries. The system detected a magnitude 3.1 earthquake in 2021 with 47 ms end-to-end alert latency.

20.8 Knowledge Check

Test Your Understanding

Question 1: Which subsystem of a wireless sensor node is typically the dominant energy consumer?

  1. The sensing unit (analog sensors and ADC)
  2. The processing unit (microcontroller and memory)
  3. The communication unit (radio transceiver)
  4. The power management unit (voltage regulator)

c) The communication unit (radio transceiver)

The radio transceiver typically consumes 50-300 mW during transmission and reception, which is 3-30x more than sensing (1-10 mW) and processing (10-100 mW) combined. This fundamental asymmetry drives all WSN protocol design: duty cycling, data aggregation, and in-network processing all aim to minimize radio on-time. The design principle “minimize radio usage” is paramount – every bit transmitted costs approximately 1000x more energy than computing locally.

Test Your Understanding

Question 2: What is the key difference between S-MAC (synchronous) and X-MAC (asynchronous) duty cycling protocols?

  1. S-MAC uses shorter preambles than X-MAC
  2. S-MAC requires coordinated sleep schedules while X-MAC lets nodes sleep independently
  3. X-MAC provides lower latency than S-MAC
  4. S-MAC works only in star topologies while X-MAC works in mesh topologies

b) S-MAC requires coordinated sleep schedules while X-MAC lets nodes sleep independently

S-MAC (synchronous) has neighboring nodes agree on a common wake/sleep schedule using SYNC packets – they wake up simultaneously, exchange data during the active period, then sleep together. This provides predictable communication windows but requires synchronization overhead and suffers from clock drift. X-MAC (asynchronous) lets each node sleep on its own schedule – when a sender needs to communicate, it sends short preambles with the target address until the receiver wakes up and acknowledges. This eliminates synchronization overhead but introduces variable latency. S-MAC suits scheduled periodic reporting; X-MAC suits event-driven traffic with mobile or heterogeneous networks.

Test Your Understanding

Question 3: A forest fire detection WSN uses 500 nodes across 100 km squared. Which network lifetime metric is most appropriate, and why?

  1. Last Node Death (LND) – because you want the network to last as long as possible
  2. Half Nodes Dead (HND) – because 50% coverage is still useful
  3. First Node Death (FND) – because any coverage gap could miss a fire
  4. Average Node Lifetime – because it gives the best overall picture

c) First Node Death (FND) – because any coverage gap could miss a fire

For fire detection, a single dead node creates a blind spot where fires could start undetected. FND is the appropriate metric because the network fails its mission as soon as any area becomes unmonitored. This drives specific design choices: balanced energy consumption across ALL nodes (avoid hotspots near sinks), energy-aware routing, and potentially k-coverage redundancy so that when one node dies, others still cover the area. Optimizing for FND requires fundamentally different strategies than optimizing for LND or average lifetime.

Common Pitfalls

Configuring 1% duty cycle (15ms on per 1.5s) for a sensor that needs to relay 10 packets/second creates severe packet loss — the radio is off 99% of the time when neighbors try to transmit. Measure offered traffic load first, then calculate minimum duty cycle as (packets/second × transmission_time) × 1.5× safety margin.

S-MAC requires periodic SYNC packets broadcast every LISTEN period — for a network of 100 nodes with 10ms listen periods, synchronization consumes 20-40% of all transmissions. Account for sync overhead in energy budgets and consider asynchronous protocols (B-MAC) for very low traffic loads.

Nodes near the sink relay all upstream traffic and need higher duty cycles to avoid becoming bottlenecks; edge nodes only transmit their own data. Applying a uniform duty cycle optimized for relays wastes energy at edge nodes (sleeping less than needed) while choking relay nodes (sleeping too much).

20.9 Summary

This chapter covered fundamental concepts of Wireless Sensor Networks (WSNs):

  • WSN Architecture: Spatially distributed autonomous sensor nodes cooperatively monitor physical or environmental conditions through three-tier architecture (sensor nodes, gateways, backend systems)
  • Sensor Node Components: Hardware integration of sensing units, processing units (microcontrollers), communication radios, and power supplies with severe resource constraints
  • Energy Management: Primary design constraint for WSNs with radio communication consuming most energy; strategies include duty cycling, data reduction, topology control, and energy harvesting
  • Network Topologies: Star, mesh, cluster, and hybrid configurations affect coverage, connectivity, and energy efficiency across diverse application domains
  • Swarm Intelligence: Reynolds’ Boids model demonstrates how three simple local rules (separation, alignment, cohesion) create emergent network-wide behaviors enabling autonomous coverage optimization, self-healing topologies, and energy-efficient coordination without centralized control
  • Radio Duty Cycling: Critical technique alternating between active and sleep periods through synchronous (S-MAC) or asynchronous (B-MAC, X-MAC) approaches to extend network lifetime
  • IoT Integration: WSNs evolved from specialized military applications to become integral components of modern IoT ecosystems with cloud integration and edge computing capabilities
  • Coverage and Reliability: Multi-hop communication, data aggregation, and self-organization enable robust operation despite node failures and environmental challenges

The following AI-generated figures provide alternative visual representations of concepts covered in this chapter. These “phantom figures” offer different artistic interpretations to help reinforce understanding.

20.9.1 WSN Architecture

Sensor node internal architecture showing sensing unit, processing unit, transceiver, and power supply with data flow between components

Sensor Node Components

Comparison of WSN deployment scenarios highlighting resource constraints, self-organization, and differences from traditional wireless networks

WSN Deployment Scenarios

Multi-tier sensor network architecture with sensor nodes, cluster heads, gateways, and backend cloud system

Sensor Network Architecture

Diagram showing coverage gap locations in a WSN deployment where node failures or sparse placement leave unmonitored regions

WSN Coverage Gaps

Overview of a wireless sensor network showing distributed sensor nodes communicating through multi-hop paths to a central sink node

Wireless Sensor Network Overview

Geometric model of area coverage showing sensor sensing radius circles overlapping to provide continuous monitoring of a region

Area Coverage Model

20.9.2 WSN Data Flow and Processing

WSN data processing workflow showing sensing, local aggregation, multi-hop forwarding, and gateway-to-cloud data pipeline

WSN Data Processing Pipeline

End-to-end sensor data pipeline from raw sensor readings through filtering, aggregation, and transmission to backend analytics

Sensor Data Pipeline

Sensor node power management state machine showing transitions between active sensing, processing, transmitting, idle listening, and deep sleep states

Sensor Node State Machine

20.9.3 WSN Clustering and Topology

Sink node architecture showing data collection from multiple sensor clusters, local processing, and upstream connectivity to cloud infrastructure

Sink Node Architecture

Latency comparison between processing sensor data at the edge versus forwarding to cloud, showing energy and delay tradeoffs in WSN clusters

WSN Cluster Latency Analysis

WSN cluster formation process showing cluster head election, member node association, and resulting cluster topology

WSN Cluster Formation

Cluster head selection and rotation in a WSN showing how cluster head role rotates among nodes to balance energy consumption

WSN Cluster Head Selection

Decision framework for selecting WSN topology (star, tree, mesh, hybrid) based on deployment area, node density, latency requirements, and energy budget

WSN Topology Decision Framework

Point coverage model showing how sensor nodes are placed to monitor specific targets while minimizing total energy consumption

WSN Energy and Coverage Model

Layered WSN architecture showing physical layer, MAC layer, network layer, and application layer with energy management spanning all layers

WSN Layered Architecture

WSN fog node architecture showing local computation resources, storage, and communication interfaces enabling edge processing before cloud forwarding

WSN Node Architecture

Heterogeneous WSN landscape showing diverse sensor types, communication technologies, and network configurations coexisting in an IoT deployment

WSN Heterogeneous Landscape

20.9.4 Network Examples

WSN target tracking methodology showing vertical handoff between sensor clusters as a mobile target moves through the monitored area

WSN Tracking Methodology

20.9.5 Additional Figures

Decision framework for WSN design choices including protocol selection, duty cycle configuration, and deployment strategy based on application requirements

WSN Decision Framework

Machine-to-machine IP network diagram showing sensor nodes connected through gateway to IP backbone for cloud-based data collection and management

M2M IP Network Architecture

Edge and fog computing integration with WSN showing local processing at fog nodes reducing data volume and latency before cloud transmission

Edge-Fog Computing Integration

20.10 Knowledge Check

20.11 What’s Next

Topic Chapter Description
Coverage Fundamentals WSN Coverage Apply k-coverage analysis, OGDC, and optimal sensor activation strategies
Tracking Fundamentals WSN Tracking Implement target localization and tracking algorithms
Overview Review WSN Review Test your comprehensive understanding across all WSN topics