14  Energy Management and Duty Cycling

In 60 Seconds

Duty cycling is the primary WSN energy conservation technique, reducing power consumption by 90-99% by sleeping radios between transmissions. Synchronized sleep schedules (S-MAC, T-MAC) trade latency for energy savings; asynchronous protocols (B-MAC, WiseMAC) reduce coordination overhead.

Minimum Viable Understanding

• Radio communication dominates sensor node energy at 50-300 mW: The radio transceiver consumes 3-30x more power than sensing and processing combined, which is why every WSN protocol prioritizes minimizing radio on-time through duty cycling, aggregation, and local processing.
• Duty cycling at 1% extends battery life by 10-100x: A sensor node awake for only 10ms every 1000ms dramatically reduces average power consumption – S-MAC (synchronous) provides predictable communication windows with coordinated sleep schedules, while X-MAC (asynchronous) eliminates synchronization overhead using short preamble sampling.
• Choose your lifetime metric wisely: FND vs HND vs LND: First Node Death (FND) matters for coverage-critical applications like fire detection (any blind spot is unacceptable), while Half Nodes Dead (HND) suits applications tolerating graceful degradation – optimizing for FND requires balanced energy consumption across ALL nodes, not just average lifetime.

Sensor Squad: The Energy-Saving Challenge

Sammy the sound sensor looked at his battery gauge nervously. “At this rate, I’ll be dead in 4 days! My radio keeps chatting with everyone, and it uses 10 times more energy than my actual microphone!”

Lila the light sensor had a solution: “I’ve been experimenting with duty cycling! I sleep for 99 seconds, then wake up for just 1 second to check my surroundings and send data. My battery went from lasting 4 days to almost 2 YEARS!”

Max the motion sensor was impressed but had a concern: “How do you guys talk if you’re sleeping at different times?”

Bella the bio sensor explained two strategies: “Option 1 – S-MAC: We all agree to wake up at the same time, like a scheduled meeting. We exchange messages, then all go back to sleep. Option 2 – X-MAC: We sleep whenever we want, but when Max needs to send me a message, he taps my shoulder repeatedly (sends short preambles) until I wake up!”

Sammy added the math: “Here’s the crazy part – our radios use 50 to 300 milliwatts, but sleeping uses less than 0.1 milliwatts. That’s like the difference between running a hair dryer and a tiny LED. Sleeping MOST of the time is the single biggest energy saver!”

That is the core lesson of WSN energy management – the radio is the energy monster, and smart sleeping is the best way to tame it.

For Beginners: Why Battery Life Matters So Much

Imagine you plant 500 sensors across a forest to detect fires. You can’t visit every sensor to change batteries – some are on mountaintops, others are deep in the forest. If the batteries die, fires go undetected.

This is the fundamental challenge of wireless sensor networks:

Energy Consumer	Power Draw	Analogy
Radio (TX/RX)	50-300 mW	Running a hair dryer
Processing	1-10 mW	Running a small calculator
Sensing	< 1 mW	Running a tiny LED
Sleeping	< 0.1 mW	Running… almost nothing!

The solution? Sleep most of the time! Duty cycling means waking up briefly to sense and transmit, then sleeping again. At a 1% duty cycle, a sensor that would last 4 days on continuous operation can last over a year.

Why this matters: Energy management is THE most important design constraint in WSNs. Every protocol, algorithm, and architecture decision is shaped by the need to make batteries last months or years in remote deployments where battery replacement is impractical or impossible.

14.1 Learning Objectives

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

• Analyze energy consumption profiles: Quantify power draw across radio, sensing, processing, and sleep states
• Apply conservation strategies: Implement duty cycling, data reduction, and topology control techniques
• Compare MAC protocols: Evaluate S-MAC (synchronous) vs B-MAC/X-MAC (asynchronous) duty cycling
• Design energy-aware systems: Balance trade-offs between energy, latency, reliability, and throughput
• Calculate network lifetime: Use FND, HND, and LND metrics for deployment planning
• Evaluate energy harvesting: Determine when harvesting outperforms battery-only solutions

---

14.2 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.

14.2.1 System-Level Characteristics

Scalability is the ability of a sensor network to function effectively as it grows from tens to thousands of nodes. The core challenge is that routing complexity, data aggregation load, and network management overhead all increase with node count. A 50-node network might use flat routing where every node knows every other node, but a 5,000-node deployment would collapse under the control traffic this generates. The solution is hierarchical architecture: cluster heads aggregate data from their members and communicate with the gateway, turning an N-node routing problem into a much smaller cluster-to-cluster problem. Protocols like LEACH rotate the cluster head role to distribute energy consumption evenly.

Reliability means consistent operation despite the failures that are inevitable in large-scale outdoor deployments – nodes die from battery depletion, animal damage, or environmental extremes, and wireless links suffer from intermittent interference. Reliable WSNs achieve fault tolerance through redundancy (multiple sensors covering the same area so that one failure does not create a blind spot), multi-path routing (alternative communication paths that activate automatically when the primary route fails), and data validation at aggregation points to detect and discard corrupted readings.

Robustness extends reliability to unpredictable conditions: a WSN deployed in a forest must handle seasonal changes in foliage density that alter radio propagation, temperature swings that affect sensor calibration, and wildlife interference. Robust designs use adaptive protocols that adjust transmission power and routing based on measured link quality, environmental calibration routines that compensate for sensor drift, and graceful degradation strategies that maintain core functionality even when conditions exceed design parameters.

Latency – the time between an event occurring and the system responding – is shaped by every layer of the stack. Sensing frequency determines how quickly an event is detected (a 1-second sampling interval means up to 1 second of detection delay). Multi-hop routing adds per-hop forwarding delays (typically 5-50 ms per hop). Gateway processing and cloud transmission add further latency. For fire detection, sub-second end-to-end latency is critical. For soil moisture monitoring, minutes of delay are perfectly acceptable. The key design decision is matching your duty cycling and routing parameters to your application’s latency requirements.

Accuracy and precision determine the quality and consistency of measurements. Sensor readings drift over time as components age, and environmental factors (temperature, humidity, electromagnetic interference) introduce systematic errors. Data fusion – combining readings from multiple co-located sensors using techniques like weighted averaging or Kalman filtering – significantly improves accuracy beyond what any single sensor achieves. However, higher accuracy often demands more processing power and more frequent sampling, both of which consume energy. Designers must balance measurement quality against the energy budget available for each node’s expected lifetime.

14.2.2 Network Characteristics

The topology of a sensor network determines how data flows from sensing nodes to the gateway. In a star topology, every node communicates directly with the central gateway – simple and low-latency, but limited to short-range deployments (the gateway must be within radio range of every sensor). A tree or hierarchical topology introduces intermediate cluster heads that aggregate data before forwarding, extending the network’s reach at the cost of additional hop delays. Mesh topologies allow nodes to form multi-hop paths with redundant routes, providing resilience against individual link failures. Most real-world WSNs use hybrid approaches: a mesh backbone of mains-powered relay nodes with star-connected leaf sensors.

Density – the number of nodes per unit area – creates a fundamental trade-off. High density provides excellent coverage with overlapping sensing zones and redundant communication paths, but introduces radio interference between nearby nodes competing for the same channel. Low density conserves spectrum and energy but risks coverage gaps where events go undetected. A practical guideline for environmental monitoring is 2-4 sensors per expected communication radius to ensure single-point coverage with one level of redundancy.

Connectivity, measured by the average node degree (number of reachable neighbors) and network diameter (maximum hops between any two nodes), determines how efficiently data reaches the gateway. A well-connected network with an average node degree of 6-8 provides enough path diversity for fault tolerance without excessive interference. The network diameter sets the worst-case latency: a 10-hop diameter with 20 ms per-hop delay means 200 ms minimum for the farthest sensor’s data to reach the gateway.

Coverage defines the spatial extent of the network’s sensing capability. Area coverage ensures that every point in the monitored region falls within the sensing range of at least k sensors (k-coverage), where higher k means greater redundancy and reliability. Barrier coverage focuses on detecting intrusions crossing a perimeter – relevant for security applications where you need to detect anything entering a protected zone. Point coverage targets specific known locations of interest (equipment, critical infrastructure points) rather than blanketing an entire area. The coverage type you choose directly influences node placement strategy and the total number of sensors required.

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.

14.2.3 Data Characteristics

Data rates in sensor networks vary dramatically depending on the reporting model. Event-driven reporting produces bursty traffic – a fire detection network might be silent for weeks, then generate a flood of alerts when smoke is detected. Periodic reporting produces steady, predictable traffic at fixed intervals (e.g., temperature readings every 60 seconds). Query-driven reporting generates data only when the gateway requests it, useful for on-demand diagnostics. Most real-world WSNs combine these models: periodic baseline reporting with event-triggered bursts for anomalies.

Data aggregation is the single most effective technique for extending network lifetime. Rather than forwarding every raw sensor reading to the gateway (which wastes radio energy on redundant information), intermediate nodes combine data from their children before transmission. Compression reduces individual message sizes. Fusion combines readings from co-located sensors into a single, more accurate value. Summarization replaces a stream of 60 raw readings per minute with a single statistical summary (average, min, max, standard deviation) sent once per minute – reducing transmission volume by 60x while preserving the information needed for decision-making. In a 200-node forest monitoring network, in-network aggregation at cluster heads can reduce total radio transmissions by 90%, directly translating to 10x longer battery life for the relay nodes. Data quality depends on sensor calibration, handling of missing readings, outlier detection, and timestamp synchronization across nodes. Poor time synchronization can cause data fusion algorithms to combine readings from different moments, producing inaccurate results. Most WSN platforms include lightweight time sync protocols (e.g., FTSP) that maintain sub-millisecond accuracy across the network.

14.2.4 Security Characteristics

WSN security faces unique challenges because nodes are physically accessible to attackers (deployed in unattended outdoor locations), resource-constrained (limiting cryptographic complexity), and communicate wirelessly (vulnerable to eavesdropping). The primary threats include eavesdropping on wireless links, physical node capture and key extraction, denial of service through jamming or flooding, false data injection by compromised nodes, and routing attacks such as sinkhole or wormhole attacks that divert traffic through malicious nodes.

To counter these threats, WSN security must address four requirements: confidentiality (encrypting data so intercepted packets reveal nothing), integrity (detecting tampering through message authentication codes), authentication (verifying that data comes from legitimate nodes, not imposters), and availability (keeping the network operational despite attacks). Practical implementations use lightweight cryptography (AES-128 in hardware on modern sensor platforms like CC2538), pre-distributed key schemes suited to resource constraints, and anomaly-based intrusion detection that flags unexpected traffic patterns.

---

14.3 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.

14.3.1 Energy Consumption Profile

Radio Communication (Dominant Consumer):

• Transmission: 30-300 mW typical (depends on TX power setting and range)
• Reception: 30-100 mW (often comparable to transmission)
• Idle listening: 10-50 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

14.3.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

Quick Check: Energy Conservation Strategy Selection

Energy Harvesting: Supplementing battery power with ambient energy sources.

WSN Energy Harvesting

Figure 14.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.

14.3.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.

14.3.4 Energy-Aware Protocols

Figure 14.2: LEACH (Low-Energy Adaptive Clustering Hierarchy) protocol overview - distributed cluster-based routing

Figure 14.3: LEACH protocol operation showing cluster head selection and data aggregation

Figure 14.4: LEACH protocol rounds showing setup phase and steady-state data transmission phases

Figure 14.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

Academic Resource: Cambridge Mobile and Sensor Systems

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)

---

14.4 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.

14.4.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.

Putting Numbers to It

Average power consumption scales linearly with duty cycle:

\[P_{avg} = D \times P_{active} + (1-D) \times P_{sleep}\]

where \(D\) is duty cycle, \(P_{active}\) is active power, and \(P_{sleep}\) is sleep power.

Worked example: A node with 20 mA active, 10 μA sleep, comparing 100% vs 1% duty cycle: - 100% duty: \(P_{avg} = 1.0 \times 20 + 0 \times 0.01 = 20\) mA - 1% duty: \(P_{avg} = 0.01 \times 20 + 0.99 \times 0.01 = 0.21\) mA - Lifetime extension: \(20 / 0.21 = 95×\) longer battery life!

14.4.2 Interactive: Duty Cycle Calculator

Explore how duty cycle affects average current and battery lifetime:

viewof dutyCyclePct = Inputs.range([0.1, 100], {value: 1, step: 0.1, label: "Duty Cycle (%)"})

viewof activeCurrent_mA = Inputs.range([1, 100], {value: 20, step: 0.5, label: "Active Current (mA)"})

viewof sleepCurrent_uA = Inputs.range([0.1, 100], {value: 10, step: 0.1, label: "Sleep Current (μA)"})

viewof batteryCapacity_mAh = Inputs.range([100, 10000], {value: 3000, step: 100, label: "Battery Capacity (mAh)"})

dcFrac = dutyCyclePct / 100
sleepCurrent_mA = sleepCurrent_uA / 1000
avgCurrent = dcFrac * activeCurrent_mA + (1 - dcFrac) * sleepCurrent_mA
lifetimeHours = batteryCapacity_mAh / avgCurrent
lifetimeDays = lifetimeHours / 24
alwaysOnLifetime = batteryCapacity_mAh / activeCurrent_mA
extension = alwaysOnLifetime > 0 ? lifetimeHours / alwaysOnLifetime : 0

html`<div style="background: var(--bs-light, #f8f9fa); padding: 1rem; border-radius: 8px; border-left: 4px solid #3498DB; margin-top: 0.5rem;">
<p><strong>Average Current:</strong> ${avgCurrent.toFixed(4)} mA</p>
<p><strong>Battery Lifetime:</strong> ${lifetimeHours.toFixed(0)} hours (${lifetimeDays.toFixed(1)} days / ${(lifetimeDays / 30.44).toFixed(1)} months)</p>
<p><strong>Always-on Lifetime:</strong> ${alwaysOnLifetime.toFixed(0)} hours (${(alwaysOnLifetime / 24).toFixed(1)} days)</p>
<p><strong>Lifetime Extension:</strong> ${extension.toFixed(1)}x longer with ${dutyCyclePct}% duty cycle</p>
</div>`

Academic Resource: Dynamic Duty Cycling Strategies

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)

14.4.3 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

Figure 14.6: S-MAC protocol - synchronous duty cycling with coordinated sleep schedules for WSN energy conservation

Academic Resource: S-MAC Protocol Architecture

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)

14.5 S-MAC Protocol: Visual Operation

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

14.5.1 The S-MAC Cycle

Figure 14.7: Gantt chart showing S-MAC frame structure with Node A and Node B synchronized through SYNC, RTS/CTS, DATA, and SLEEP phases

14.5.2 Step-by-Step Operation

Figure 14.8: Flowchart showing S-MAC three-phase operation: synchronization with SYNC packets, listen period with RTS/CTS/DATA/ACK exchange, and sleep period with radio off.

14.5.3 Energy Savings

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

14.5.4 Key Insight

Nodes that hear the same SYNC adopt the same schedule, forming virtual clusters that can communicate efficiently. S-MAC provides predictable communication windows and is well-suited for scheduled traffic, but incurs synchronization overhead and may not adapt well to bursty, event-driven workloads.

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

Figure 14.9: Preamble sampling mechanism for asynchronous duty cycling - sender transmits long preamble until receiver wakes

Figure 14.10: X-MAC protocol - asynchronous duty cycling with short preambles and early acknowledgment for energy efficiency

Academic Resource: X-MAC Short Preamble Protocol

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

14.5.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

14.5.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

---

14.6 Knowledge Check

Test your understanding of WSN fundamental concepts with these questions covering architecture, sensor nodes, and network topologies.

Quiz 1: WSN Architecture Basics

Question: Which of the following best describes the three-tier architecture of a Wireless Sensor Network?

Answer

Correct Answer: C) Sensor Nodes → Gateway/Sink → Backend Systems

Explanation: The three-tier WSN architecture consists of:

1. Tier 1 - Sensor Nodes: Collect environmental data, perform local processing and filtering, and transmit data to nearby nodes or gateways. These are typically battery-powered with limited resources.

2. Tier 2 - Gateway/Sink Nodes: Aggregate data from multiple sensor nodes, provide protocol translation (e.g., 802.15.4 to Wi-Fi/Ethernet), perform edge processing and data fusion, and connect the sensor network to external networks.

3. Tier 3 - Backend Systems: Cloud or on-premise servers that store and analyze large-scale data, provide user interfaces and applications, and enable remote management and configuration.

This architecture enables efficient data collection from distributed sensors while managing the resource constraints (energy, bandwidth, processing) at each tier appropriately.

Quiz 2: Sensor Node Components

Question: A sensor node’s communication subsystem (radio transceiver) typically consumes what fraction of total power compared to sensing and processing combined?

Answer

Correct Answer: C) 3-30 times more (3:1 to 30:1 ratio)

Explanation: The communication subsystem is the dominant energy consumer in sensor nodes:

Subsystem	Typical Power Draw
Sensing Unit	< 1-10 mW
Processing Unit (MCU)	1-10 mW
Communication Unit (Radio)	50-300 mW

The radio transceiver typically consumes 3-30× more power than sensing and processing combined. This fundamental asymmetry drives nearly all WSN protocol design decisions:

• Duty cycling: Sleep the radio as much as possible
• Data aggregation: Process locally to reduce transmissions
• In-network processing: Compute at nodes rather than transmit raw data
• Transmission power control: Use minimum power needed

This is why the design principle “minimize radio usage” is paramount in WSN design. Every bit transmitted costs approximately 1000× more energy than computing locally.

Quiz 3: Network Topologies

Question: In a WSN deployment, you need to monitor a large agricultural field. Which topology would provide the best combination of energy efficiency, scalability, and fault tolerance?

Answer

Correct Answer: C) Cluster/Hierarchical topology - nodes grouped into clusters with rotating cluster heads

Explanation: For large agricultural deployments, cluster/hierarchical topology offers the best balance:

Topology	Pros	Cons
Star	Simple, low latency	Limited range, gateway bottleneck, single point of failure
Mesh	Redundant paths, fault tolerant	High overhead, routing complexity, energy-intensive
Cluster	Scalable, energy-efficient, reduces hotspots	Moderate complexity, cluster head burden
Linear	Simple for narrow areas	Poor fault tolerance, high latency

Why Cluster topology wins for agriculture:

1. Energy Efficiency: Only cluster heads perform long-range transmission to the gateway; regular nodes use short-range communication to their cluster head
2. Scalability: Can add clusters without affecting existing network structure
3. Load Balancing: Rotating cluster head roles (like LEACH protocol) distributes energy consumption evenly
4. Data Aggregation: Cluster heads aggregate data from members, reducing total transmissions by 70-90%
5. Fault Tolerance: If a cluster head fails, a new one can be elected from remaining members

For a 50-hectare vineyard with 200 sensors, hierarchical clustering with 10 clusters of 20 nodes each would reduce gateway traffic by 90% compared to flat routing.

Quiz 4: Multi-hop Communication

Question: Why does multi-hop routing typically save energy compared to direct transmission in WSNs, even though it requires more total transmissions?

Answer

Correct Answer: B) Radio transmission power scales with distance^n (where n=2-4), making multiple short hops more efficient

Explanation: Radio transmission follows the path loss model:

\[P_{tx} \propto d^n\]

where \(d\) is distance and \(n\) is the path loss exponent (typically 2-4 for wireless propagation).

Energy Comparison Example (100m to sink):

Approach	Calculation (n=4)	Relative Energy
Direct: 1 hop × 100m	\(100^4 = 100,000,000\)	Baseline
Multi-hop: 10 hops × 10m	\(10 × 10^4 = 100,000\)	1000× savings!

Key insight: Breaking a long transmission into multiple short hops dramatically reduces total energy because of the exponential relationship between distance and power.

However, multi-hop introduces trade-offs:

• Higher latency: Each hop adds 10-50ms delay
• Hotspot problem: Nodes near the sink relay all traffic, depleting faster
• Routing overhead: Maintaining routes consumes energy and bandwidth
• Reliability: More hops = more potential failure points

Design guideline: Use multi-hop strategically when nodes are beyond single-hop range, but avoid unnecessary hops. Deploy multiple sinks to keep average path length under 5 hops.

Quiz 5: Network Lifetime Metrics

Question: A WSN deployment in a forest fire detection system uses 500 nodes across 100 km². Network lifetime is defined as “time until first node dies” (FND). After 6 months, the first node fails and the network becomes disconnected. What does this scenario illustrate?

Answer

Correct Answer: D) FND metric is critical for coverage-dependent applications; alternative metrics may miss failures

Explanation: This illustrates why choosing appropriate lifetime metrics is critical.

Network lifetime metrics:

Metric	Definition	Best For
First Node Death (FND)	Time until ANY node dies	Full coverage required (fire detection, security)
Half Nodes Dead (HND)	Time until 50% nodes die	Applications tolerating graceful degradation
Last Node Death (LND)	Time until ALL nodes die	Less useful - network often dysfunctional before this
Network Partition Time (NPT)	Time until network splits	Connectivity-dependent applications

For fire detection: FND is appropriate because a single dead node creates a blind spot where fires could start undetected.

Solutions to extend network lifetime:

• Deploy redundant node coverage (2-3 nodes per area)
• Use mobile nodes to fill gaps when nodes fail
• Implement scheduled node replacement before battery exhaustion
• Add energy harvesting (solar) in accessible locations
• Use energy-aware routing to balance load across all nodes

Key insight: Metric choice affects design. Optimizing for FND requires balanced energy consumption across ALL nodes (avoid hotspots), while HND allows some nodes to die early.

14.7 Worked Example: Duty Cycle Design for Forest Fire Detection WSN

Worked Example: Calculating Optimal Duty Cycle for 1,000-Node Fire Detection Network

Scenario: A national park deploys 1,000 temperature/smoke sensors across 5,000 hectares of forest. Each node has a 3,000 mAh AA lithium battery (non-rechargeable, no solar under tree canopy). The network must operate for 3 fire seasons (18 months total, sensors sleep during winter). The radio (CC2420) consumes: 19.7 mA (receive), 17.4 mA (transmit), 0.001 mA (sleep). Target: detect fire within 5 minutes.

Step 1: Energy Budget

Parameter	Value
Total battery capacity	3,000 mAh
Required lifetime	18 months = 13,140 hours (active only, 548 days)
Maximum average current	3,000 mAh / 13,140 h = 0.228 mA

Step 2: Duty Cycle Options

Duty Cycle	Wake Interval	Active Time per Cycle	Avg Current	Battery Life	Fire Detection Latency
100% (always on)	Continuous	Continuous	19.7 mA	152 hours (6.3 days)	<1 sec
10%	10 sec	1 sec listen + transmit	1.97 mA	1,523 hours (63 days)	10 sec
1%	100 sec	1 sec	0.198 mA	15,152 hours (631 days)	100 sec (1.7 min)
0.5%	200 sec	1 sec	0.099 mA	30,303 hours (3.5 years)	200 sec (3.3 min)
0.1%	1,000 sec	1 sec	0.020 mA	150,000 hours (17 years)	1,000 sec (16.7 min)

Step 3: Select the Optimal Duty Cycle

The 5-minute detection requirement means fire detection latency must be <300 seconds. Working backwards:

• Maximum wake interval = 300 sec - processing time (0.5 sec) - multi-hop relay time (est. 30 sec for 10 hops) = 269 sec
• Round down to 200 sec wake interval for safety margin (0.5% duty cycle)
• Average current at 0.5% duty cycle: 0.099 mA
• Battery life: 3,000 / 0.099 = 30,303 hours = 3.5 years (exceeds 18-month requirement by 2.3x)

Step 4: Add Adaptive Duty Cycling

During high-risk periods (summer, wind >30 km/h, humidity <20%), reduce wake interval to 30 seconds (3.3% duty cycle). During low-risk periods (spring, rain), increase to 600 seconds (0.17% duty cycle).

Period	Days/Year	Duty Cycle	Avg Current	Energy Used
High-risk (60 days)	60	3.3%	0.66 mA	950 mAh
Normal (120 days)	120	0.5%	0.099 mA	285 mAh
Low-risk (90 days)	90	0.17%	0.034 mA	73 mAh
Winter sleep (95 days)	95	0%	0.001 mA	2.3 mAh
Annual total	365	Weighted avg	0.150 mA	1,310 mAh

Battery life with adaptive: 3,000 / 1,310 mAh/year = 2.3 years per battery (meets 18-month requirement with 53% margin)

Result: Adaptive duty cycling provides 3.3x better fire detection during high-risk periods (30 sec vs 200 sec latency) while extending battery life 23% beyond the uniform 0.5% duty cycle approach. The extra intelligence costs only 2 KB of flash for the risk assessment logic. At $3/battery for 1,000 nodes, the 18-month savings from not replacing batteries earlier = $3,000 in avoided truck rolls to remote forest locations.

14.8 Concept Relationships

Understanding how energy management concepts interconnect helps build a coherent mental model:

Concept	Builds On	Enables	Conflicts With	Complements
Duty Cycling	Sleep state hardware support	100x battery extension	Low-latency requirements	Data aggregation
S-MAC Protocol	Clock synchronization	Predictable communication windows	Asynchronous traffic patterns	TDMA scheduling
X-MAC Protocol	Preamble sampling	No synchronization overhead	High-frequency communication	Event-driven sensing
LEACH Clustering	Multi-hop routing, data aggregation	Balanced energy consumption	Single-sink deployments	Hierarchical topologies
Energy Harvesting	Ambient energy sources, MPPT circuits	Perpetual operation potential	Indoor/shaded deployments	Ultra-low duty cycles
FND Metric	Battery monitoring	Coverage-critical lifetime planning	Graceful degradation goals	Hotspot avoidance strategies
Network Lifetime	Duty cycling, routing, harvesting	Long-term deployment viability	High data rate requirements	Energy-aware protocols

14.9 How It Works: S-MAC Duty Cycling Protocol

S-MAC achieves energy efficiency through coordinated sleep schedules. Here’s the step-by-step mechanism:

Phase 1: Schedule Synchronization

1. Node powers on and listens for SYNC packets from neighbors
2. If SYNC received within timeout, adopt neighbor’s schedule (join virtual cluster)
3. If no SYNC heard, create own schedule and broadcast SYNC packet
4. Nodes hearing same SYNC form virtual clusters with synchronized wake times

Phase 2: Communication Window

1. All clustered nodes wake simultaneously at scheduled interval
2. Sender transmits RTS (Request To Send) to receiver
3. Receiver responds with CTS (Clear To Send)
4. Data packet transmitted, followed by ACK acknowledgment
5. Collision avoidance: nodes hearing RTS/CTS sleep until transmission complete

Phase 3: Sleep Period

1. After communication window closes, all nodes enter deep sleep
2. Radio transceiver powered down (1-20 mW → 0.001-0.1 mW)
3. Microcontroller in low-power mode with timer running
4. Sleep duration: 90-99% of total cycle time

Energy Savings Calculation:

• Wake period: 100ms @ 20 mA = 20 mA * (0.1s / 3600s) = 0.556 µAh
• Sleep period: 9,900ms @ 0.001 mA = 0.001 mA * (9.9s / 3600s) = 0.00275 µAh
• Total per 10s cycle: 0.559 µAh
• Average current: 0.559 µAh / (10s / 3600s) = 0.201 mA
• Lifetime: 2000 mAh / 0.201 mA = 9,950 hours = 415 days

Compare to always-on: 2000 mAh / 20 mA = 100 hours = 4.2 days (99x improvement)

14.10 Try It Yourself: Design a Duty-Cycled Fire Detection Network

Objective: Calculate optimal duty cycle parameters for a 200-node forest fire monitoring system.

Scenario Setup:

• Deployment area: 2,000 hectares (20 km²)
• Detection requirement: Fire temperature >60°C within 2 minutes
• Battery: 3,000 mAh lithium AA cells (non-rechargeable)
• Radio: 802.15.4 @ 19.7 mA RX, 17.4 mA TX, 0.001 mA sleep
• Target lifetime: 2 fire seasons (18 months)

Tasks:

1. Calculate Maximum Wake Interval:
   • Detection latency budget: 120 seconds
   • Subtract multi-hop relay time (estimate 20s for 5-hop network)
   • Subtract processing time (0.5s)
   • What’s the maximum sleep period between wake cycles?
2. Determine Duty Cycle:
   • Active time per cycle: 1 second (0.5s sense + 0.5s transmit)
   • Sleep time: [Your answer from Task 1]
   • Calculate duty cycle percentage: Active / (Active + Sleep)
3. Calculate Average Current:
   • Use formula: I_avg = (duty_cycle × I_active) + ((1 - duty_cycle) × I_sleep)
   • I_active = 18 mA (average of TX/RX), I_sleep = 0.001 mA
   • What’s the average current draw?
4. Estimate Battery Lifetime:
   • Capacity: 3,000 mAh
   • Average current: [Your answer from Task 3]
   • Lifetime (hours) = Capacity / Current
   • Convert to months – does it meet the 18-month target?
5. Adaptive Enhancement:
   • High-risk periods (summer, low humidity): Reduce wake interval to 30 seconds
   • Low-risk periods (spring, after rain): Increase to 10 minutes
   • Calculate weighted average battery life if high-risk = 60 days, low-risk = 90 days per year

What to Observe:

• How does wake interval affect both detection latency and battery life?
• At what duty cycle does sleep current become negligible vs dominant?
• What’s the trade-off between fire detection speed and network lifetime?

Extension Challenge: Design an adaptive algorithm that adjusts duty cycle based on: - Temperature trend (increasing = shorter interval) - Humidity level (low humidity = higher risk = shorter interval) - Wind speed (high wind = faster fire spread = shorter interval) - Battery level (low battery = extend interval to maintain connectivity)

What parameters would trigger each adjustment, and what’s the new wake interval for each condition?

Common Pitfalls

1. Setting Duty Cycle Without Measuring Actual Traffic

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.

2. Forgetting Synchronization Overhead in Sleep Scheduling

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.

3. Assuming All Nodes Need the Same Duty Cycle

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).

🏷️ Label the Diagram

Code Challenge

14.11 Summary

This chapter covered energy management and duty cycling in wireless sensor networks:

• Energy Consumption Profile: Radio communication dominates (50-300 mW), followed by processing (1-10 mW) and sensing (< 1-10 mW)
• Conservation Strategies: Duty cycling, data reduction, topology control, routing optimization, and energy harvesting
• Network Lifetime Metrics: FND (first node death), HND (half nodes dead), LND (last node death) for different application requirements
• Synchronous Duty Cycling: S-MAC coordinates sleep schedules through SYNC packets, enabling predictable communication windows
• Asynchronous Duty Cycling: B-MAC and X-MAC use preamble sampling, avoiding synchronization overhead but with variable latency
• Advanced Techniques: Adaptive, predictive, and hierarchical duty cycling; wake-on-radio for ultra-low power
• Trade-offs: Energy vs latency (sleeping increases delay), energy vs reliability (missed messages), energy vs throughput (limited active time)

Match: Energy Management Techniques

Order: S-MAC Protocol Operation

14.12 What’s Next

Topic	Chapter	Description
Coverage Fundamentals	WSN Coverage	Apply area, point, and barrier coverage theory to deployments
Tracking Fundamentals	WSN Tracking	Implement target localization and tracking algorithms
Advanced Duty Cycling	Duty Cycling and Topology	Explore advanced MAC protocol details and topology control
Overview Review	WSN Overview	Review all chapters in the WSN fundamentals series