CS718 — Final Term Summary (Lectures 23–44)

📘 Lecture 23 — WCDMA (Part III)

📖 Overview: This lecture covers the final aspects of WCDMA, focusing on compressed mode measurements for inter-frequency handovers, handover procedures across different modes and systems, and the mechanisms for packet data access. It also details the transport channels used for packet data and the scheduling algorithms that manage radio resources, which are critical for efficient network performance.

🗂️ Topics Covered

This lecture begins with compressed mode measurements, explaining the need for transmission gaps and methods for achieving them. It then covers handover measurements, including intra-mode, inter-mode, and inter-system handovers. The discussion moves to WCDMA packet data access, describing traffic classes and packet data characteristics. The lecture details transport channels for packet data, including common, dedicated, and shared channels. Finally, it covers packet scheduling algorithms, specifically time division, code division, and transmission power-based scheduling.

📝 Lecture Summary

Compressed Mode Measurements

Compressed mode is needed when a terminal, without a full dual receiver, must make measurements on another frequency. The goal is not to lose data but to compress it. Transmission and reception are halted for a short time to perform measurements on other frequencies. Three methods for compressed mode are: lowering the data rate from higher layers; increasing the data rate by changing the spreading factor; and reducing the symbol rate by puncturing at the physical layer multiplexing chain. More power is needed during compressed mode. No power control is active during the compressed frame; a large step size is used after the frame to allow the power level to converge quickly.

🔑 Definition — Transmission Gap Length (TGL): The duration of the measurement gap in slots. The specified TGLs are 3, 4, 7, 10, and 14 slots. TGLs of 3, 4, and 7 can be obtained with both single and double frame methods, while TGLs of 10 or 14 only use the double frame method to minimize impact during a single frame. Very short TGLs (1 or 2) are excluded because the hardware needs time to switch frequencies. 📌 Example: A terminal needing to measure a GSM cell on a different frequency would activate compressed mode, creating a transmission gap of, for example, 7 slots to perform the measurement. During this gap, its data transmission is halted and then resumed with higher power afterwards.

Handover measurements

Handover measurements are categorized into three types. Intra-mode handover includes soft handover, softer handover, and hard handover. Inter-mode handover is a handover to the UTRA TDD mode. Inter-system handover is a handover to another system, such as GSM.

💡 Why this matters: These categories define how a mobile device connects to different cells and technologies, which is fundamental for seamless mobility in a heterogeneous network.

Intra-Mode Handover

Intra-mode handover relies on Ec/No measurements performed from the CPICH. The quantities measured from the CPICH are: Received Signal Code Power (RSCP) , the received power on one code after de-spreading; RSSI, the wideband received power within the channel bandwidth; and Ec/No, which represents RSCP/RSSI. For soft handover, relative timing between cells is needed for coherent combining in the RAKE receiver. If cells are within a 10ms window, the relative timing can be found from the primary scrambling code phase; otherwise, terminals must decode the System Frame Number from the primary CCPCH. For hard handover, timing information is not needed, and different frequency measurements can be done with the aid of compressed mode.

🔑 Definition — Ec/No: A measure of signal quality, calculated as the ratio of the received signal code power (RSCP) to the total received power (RSSI). 📌 Example: A terminal monitoring its serving cell and a neighboring cell measures the CPICH Ec/No of both. If the neighboring cell's Ec/No exceeds a threshold relative to the serving cell's, the terminal triggers a measurement report to initiate a soft handover.

Packet Data Access

There are four basic types of traffic classes. Conversational class is real-time, for human-to-human interaction, with very low delay and near symmetry (e.g., speech). Streaming class is real-time, transferring data as a steady, continuous stream with low delay and asymmetry (e.g., video). Interactive class is non-real-time packet data where a response is requested, requiring reasonable round-trip delay (e.g., Web browsing). Background class is non-real-time packet data with no immediate action expected and is less sensitive to delivery time (e.g., e-mail).

🔑 Definition — Packet Data Traffic: Non-real-time packet services, including Interactive and Background traffic classes. Properties include bursty data, tolerance for longer delays, and the ability to allow high frame error rates with low transmission power due to retransmission services at the radio link control layer. 📌 Example: A user browsing the web generates interactive class traffic. When they click a link, a packet call is initiated, resulting in a burst of data transfer. After the page loads, a reading time begins, during which no data is sent, demonstrating the bursty nature of the traffic.

Transport Channels for Data Packet Access

Transport channels for packet data include common, dedicated, and shared channels. Common channels (RACH in uplink, FACH in downlink) have low setup time but no feedback channel, meaning no fast closed-loop power control or soft handover, which leads to poor link-level performance. They are suitable for small data amounts. Dedicated channels (DCH) use fast power control and soft handover, have a longer setup time, and can support up to 2 Mbps. They are suitable for large data amounts but not for bursty data, as the downlink orthogonal code is reserved according to the maximum bit rate. Shared channels allow a single orthogonal code to be shared with many packet users in a time-division manner, making it code-efficient. They allow fast allocation and rate modification on a frame-by-frame basis, are suitable for large and bursty data, and use fast power control but no soft handover.

💡 Why this matters: Choosing the correct transport channel is crucial for efficiently managing radio resources based on the traffic's characteristics, balancing speed, interference, and resource usage.

Packet Scheduling Algorithms

Packet scheduling in WCDMA can be done in a time or code division manner. Time division scheduling allocates a channel to one user at a time (e.g., one 10 ms frame), giving that user all available capacity for a high data rate for a short period. Code division scheduling allocates channels to many users simultaneously, giving each a low data rate for a long period.

Time Division Scheduling

Time division scheduling offers advantages such as requiring less energy per bit due to the high bit rate, generating less interference, and providing shorter delay.

🔑 Definition — Time Division Scheduling: A method where one user is allocated all available channel capacity at a time, resulting in high data rates for short periods. 📌 Example: In a system, User A receives data at 2 Mbps for 10 ms, followed by User B receiving data at 2 Mbps for the next 10 ms. This is efficient for users who can tolerate short bursts of high-speed data.

Code Division Scheduling

Code division scheduling allows resources to be in full usage due to longer transmission times and results in small variations in the interference level.

🔑 Definition — Code Division Scheduling: A method where many users are allocated channels simultaneously, each receiving a low data rate for a longer period. 📌 Example: Users A, B, and C each receive data at 0.67 Mbps simultaneously over a longer period. This is suitable for background traffic like email downloads.

Transmission Power-based Scheduling

Transmission power-based scheduling allocates resources based on user proximity to the base station. Users close to the BS require less transmission power and can get a higher bit rate, while users at the cell edge get a lower bit rate. Advantages include minimizing the average power sent per bit, less interference, and increased throughput. Disadvantages include the need for accurate power estimation and potentially unfair resource allocation.

🔑 Definition — Transmission Power-based Scheduling: A scheduling algorithm that allocates higher bit rates to users requiring less transmission power (typically those close to the base station), thereby optimizing overall system capacity. 📌 Example: A user near the cell center might be scheduled at 1 Mbps, while a user at the cell edge is scheduled at 128 kbps because the cell-edge user would require significantly more power to achieve a higher bit rate, creating more interference.

⭐ Key Takeaways

Students must understand that compressed mode is essential for inter-frequency measurements in terminals without dual receivers, using transmission gap lengths (TGLs) of 3, 4, 7, 10, or 14 slots. The three types of handover measurements—intra-mode (soft/softer/hard), inter-mode (FDD to TDD), and inter-system (to GSM)—are fundamental for mobility. Packet data traffic is bursty, delay-tolerant, and can be served by different transport channels; common channels are for small data, dedicated channels for steady large data, and shared channels for bursty large data. Finally, packet scheduling can be time-division (high rate, short time), code-division (low rate, long time), or transmission-power-based (prioritizes users with better channel conditions), each with distinct trade-offs for throughput, interference, and fairness.

🧠 Quick Revision Questions

1. What is the primary purpose of compressed mode in WCDMA, and name two methods used to achieve it?
2. How are intra-mode and inter-system handovers different in terms of the measurements required and the systems involved?
3. A user is downloading a large file and sending a short status email. Which transport channel (common, dedicated, or shared) is best suited for each activity, and why?
4. Explain the fundamental trade-off between time-division and code-division packet scheduling algorithms in terms of data rate, interference, and resource usage.
5. In transmission power-based scheduling, why is it advantageous to allocate high bit rates to users near the base station, and what is a key disadvantage of this approach?

📘 Lecture 24 — CDMA2000

📖 Overview: This lecture introduces CDMA2000, the 3G evolution of 2G CDMA technology, providing a seamless and cost-effective upgrade path. It covers the new MAC and physical layer features, physical channel structures, and the new network elements like PCF and PDSN required for packet data services. The lecture also details mobility management and handoff procedures specific to CDMA2000 networks.

🗂️ Topics Covered

The lecture begins with a review of compressed mode measurements, handover measurements, WCDMA packet data access, transport channels, and packet scheduling algorithms. It then introduces CDMA2000, explaining its 1xRTT and 3xRTT variants and comparing them to W-CDMA. New MAC and physical layer features such as link adaptation, hybrid ARQ, and turbo codes are discussed, followed by details of the physical layer, radio configurations, and reverse physical channels. New network elements including Packet Control Function (PCF), Packet Data Serving Node (PDSN), Home Agent, and AAA are explained, along with mobility management procedures and three types of handoff: Intra-PCF, Inter-PCF/Intra-PDSN, and Inter-PDSN.

📝 Lecture Summary

Last lecture review

The previous lecture covered compressed mode measurements and handover measurements including intra-mode, inter-mode, and inter-system handovers. It discussed WCDMA packet data access and transport channels for packet data (common, dedicated, and shared). Finally, packet scheduling algorithms were reviewed: time division scheduling, code division scheduling, and transmission power-based scheduling.

CDMA2000 Introduction

CDMA2000 provides a seamless and evolutionary upgrade path for 2G and 2.5G CDMA technology. It centers on the original 1.25 MHz radio channel, allowing CDMA operators to selectively upgrade without changing entire base station equipment. The first 3G CDMA standard is cdma2000 1xRTT, using a single channel (1x means multi-carrier).

🔑 Definition — cdma2000 1x: Supports data rates up to 307 kbps in packet mode and can support up to twice as many users as 2G CDMA. Cdma 1xEV-DO dedicates the channel strictly to data users and supports 2.4 Mbps per channel.

Cdma2000 3xRTT is the ultimate 3G solution relying on multicarrier that gangs adjacent channels together into 3.75 MHz. Three non-adjacent channels may be operated simultaneously and in parallel, providing data rates in excess of 2 Mbps, similar to W-CDMA. Advocates of cdma2000 claim their standard offers a much more seamless and less expensive upgrade path compared to W-CDMA.

The lecture provides a comparison table:

New MAC and Physical layer features

The new features and techniques include: Link adaptation based on adaptive modulation, coding and spreading; Physical layer fast hybrid ARQ; Enhanced channel coding and turbo codes; Space and antenna diversity; and Fast forward link power control and coherent uplink demodulation.

Physical Layer of cdma2000

The cdma2000 air interface is designed to provide a flexible framework for supporting voice and other circuit-switched data as well as bursty packet data bearer services with different QoS. It supports RF channel bandwidth of SR × 1.25 MHz, where currently SR = 1 and 3 are supported, extendable to 6, 9, and 12. A number of fixed and variable rate physical channels are defined with new variable-length spreading codes and PN codes.

🔑 Definition — Radio Configurations (RCs): Specify the data rate, channel encoding, and modulation parameters. For SR1 and SR3, there are 7 RCs for reverse link and 9 for forward link.

The table shows data rates for different RCs:

RC1 and RC2 are similar to Rate Set 1 and 2 in IS-95. RCs are chosen such that the base rate for forward and reverse links match. If RC3 is used on the reverse link, either RC3 or RC4 can be used on the forward link.

Reverse Physical Channels

Common Channels:

• Reverse Pilot Channel: An un-modulated SS signal sent by each MS, allowing the BS to detect the corresponding uplink channel. Max 1 for SR1, Max 1 for SR3.
• Reverse Access Channel: Used for backward compatibility, for uplink common control signaling. Max 1 for SR1, NA for SR3.
• Reverse Enhanced Access Channel: A new channel used by MS to initiate communication or respond to BS when no dedicated channel is assigned to the user. Max 1 for SR1, Max 1 for SR3.
• Reverse Common Control Channel: Used for short burst data and signaling messages when traffic channels are not in use. Max 1 for SR1, Max 1 for SR3.

Dedicated Channels:

• Reverse Dedicated Control Channel: Similar to before. Max 1 for SR1, Max 1 for SR3.
• Reverse Fundamental Channel: Basic traffic channel that carries voice, low-rate data, and associated signaling messages. Max 1 for SR1, Max 1 for SR3.
• Reverse Supplemental Code Channel: Fixed rate data-only channel to provide higher transmission rate. Max 7 for SR1, NA for SR3.
• Reverse Supplemental Channel: Variable rate packet data channel carrying only high-speed coded information. Max 2 for SR1, Max 2 for SR3.

New Network elements in cdma2000

• MS: Additional features to support data services and enhanced signaling messages for both circuit-switched and packet-switched services.
• BS (BTS & BSC): Enhanced radio interface with significant hardware and software changes to provide voice, data, and multimedia traffic support.

🔑 Definition — Packet Control Function (PCF): An entity that manages the buffering and relay of packets between the BS and PDSN. It maintains radio resource status (e.g., active, dormant) and collects radio link-related accounting information to be used by AAA.

🔑 Definition — Packet Data Serving Node (PDSN): A new network entity acting as a Foreign Agent (FA) by providing routing services (maintaining routing tables and route discovery) according to Mobile IP. It manages the radio-packet (R-P) interface and PPP sessions for the MS, initiates authentication, authorization, and accounting (AAA) for mobile users, and can establish tunnels through public data networks using Layer 2 Tunneling Protocol (L2TP) to a VPN gateway. PDSN may optionally use IPSec to further protect the tunnel.

• Home Agent (HA): A network element within the mobile's home network. Its two major functions are mobile IP registration and packet forwarding. The HA interacts with AAA to receive authenticated mobile IP registration requests and return registration responses. It also forwards IP packets to and from the current point of attachment through the FA.

🔑 Definition — AAA: Authentication, Authorization, and Accounting.

• Authentication: Verification of devices and subscribers for network access as well as user-based QoS requests.
• Authorization: Determines whether a user or device is authorized for a particular service with a specific QoS based on service profile. The requesting entity may cache authorization info.
• Accounting: Collecting and storing billing-related data concerning offered services, including session details (requested and offered QoS, duration of usage) and mobility records (dates and times of attach and detach).

Mobility Management for Packet Data Services

When an MS originates a call, messages are exchanged to establish and close an R-P connection between PCF/BSC and PDSN. Once a serial connection is established between MS and PDSN:

1. MS and PDSN negotiate an authentication protocol according to Challenge Handshake Authentication Protocol (CHAP) or Password Authentication Protocol (PAP).
2. PDSN sends authentication response to the AAA server, which decides whether to authenticate.
3. PDSN constructs a Network Access Identifier (NAI) of the form MSID@realm (where realm is the home network domain).
4. The user is identified as valid, and PDSN knows which IP service template to apply.
5. When the PPP session is established, PDSN assigns the mobile an IP address from a pool of IP addresses.
6. Routers in the packet network must route any packet with this IP to the PDSN serving the mobile.

Handoff

• Intra-PCF Handoff: Supported by A8/A9 interfaces carrying user traffic and signaling between BS and PCF.

• Inter-PCF and Intra-PDSN Handoff: Occurs when a location change causes the packet data session to divert from one R-P interface to another. A new R-P connection between the target PCF and serving PDSN is established, and the PPP session is moved. The previous R-P session is torn down. PCF-PCF handoff may occur while the MS is in active or dormant state. Dormant handoff is supported to maintain the PPP session while minimizing air-link resource usage. During an active session, PDSN supports low-latency handoff by bi-casting data to both the target and previous PCF.

• Inter-PDSN Handoff: A network based on simple IP does not support mobility beyond a PDSN coverage area because a new IP address will be acquired from the new PDSN, making traffic on the existing IP undeliverable. This requires support for fast handoff using Mobile IP.

• Inter-PDSN Fast Handoff: The target PDSN initiates establishment of a P-P session with the serving PDSN. The P-P interface is used to keep the PPP session anchored when PDSN-to-PDSN handoff is performed, allowing the existing PPP session to continue and reducing service interruption time and data loss.

⭐ Key Takeaways

CDMA2000 is a 3G evolution of 2G CDMA that operates on 1.25 MHz channels, with 1xRTT supporting up to 307 kbps and 1xEV-DO supporting 2.4 Mbps dedicated to data. The physical layer uses Radio Configurations (RCs) to define data rates and modulation, with 7 RCs for reverse link and 9 for forward link. New network elements include PCF for buffering and relaying packets, and PDSN acting as a foreign agent managing PPP sessions and mobile IP routing. Mobility management uses PPP sessions with CHAP/PAP authentication, and handoff occurs at three levels: Intra-PCF, Inter-PCF/Intra-PDSN using R-P interfaces with bi-casting for low latency, and Inter-PDSN requiring Mobile IP with P-P sessions to anchor PPP connections.

🧠 Quick Revision Questions

1. What are the data rate capabilities of cdma2000 1xRTT and cdma2000 1xEV-DO?
2. How many radio configurations exist for reverse and forward links in cdma2000, and what do they specify?
3. What are the four common reverse physical channels and their primary functions?
4. What are the three main functions of the AAA entity in cdma2000 networks?
5. How does Inter-PDSN fast handoff reduce service interruption time compared to simple IP-based handoff?

📘 Lecture 25 — 1st Review

📖 Overview: This lecture serves as a comprehensive review of the entire CS718 Wireless Networks course, covering foundational concepts from Lectures 1 through 24. It systematically revisits key topics including wireless transmission fundamentals, multiple access techniques, cellular evolution from 1G to 4G, cellular system design, and specific technologies like AMPS, GSM, GPRS, EDGE, IS-95, UMTS/WCDMA, and cdma2000.

🗂️ Topics Covered

This review covers all major topics from the course: wireless vision, transmission fundamentals, encoding/modulation, noises, multiplexing, propagation modes, error detection and correction codes (Parity, CRC, Hamming, BCH, Reed-Solomon), ARQ protocols, multiple access techniques (FDMA, TDMA, CDMA, ALOHA, CSMA/CA), spread spectrum, 1G/2G/2.5G/3G/4G evolution, specifications of 2.5G and 3G standards, cellular concepts (frequency reuse, handoff, interference, trunking, Erlang), AMPS, GSM architecture and mobility, GPRS architecture and protocols, IS-95 forward and reverse channels, EDGE modulation and coding, UMTS/WCDMA architecture, spreading, scrambling, handover measurements, packet scheduling, and cdma2000 network elements and handoff types.

📝 Lecture Summary

Lecture 1 — Introduction Part I

Wireless communication begins with The Wireless vision connecting people anywhere. Radio Waves are electromagnetic waves used for transmission. Channel Capacity refers to the maximum data rate a channel can support. Signal-to-Noise Ratio (SNR) is the ratio of signal power to noise power, directly affecting capacity. The EM Spectrum spans from radio waves to gamma rays, with different bands allocated for different wireless services.

Lecture 1 — Introduction Part II

Wireless Transmission involves a baseband signal (original information signal) modulated onto a carrier frequency (high-frequency signal for transmission). The fundamental frequency determines the signal's basic period. Antenna size must correspond to the signal's wavelength: a 1 MHz signal requires a few hundred meters high antenna, while a 1 GHz signal requires only a few centimeters high antenna. Encoding/Modulation converts digital data into analog signals for transmission. Noises include Thermal noise (random electron motion), Intermodulation noise (from nonlinearities), Crosstalk (interference from adjacent paths), and Impulse noise (sudden spikes). Losses/Gain refer to signal attenuation or amplification during propagation.

Lecture 3 — Introduction Part III

Multiplexing combines multiple signals for transmission over a single medium. Transmission Mediums are Guided (wired like coaxial cable, fiber) and Unguided (wireless). Propagation modes include Ground wave (follows earth's surface), Sky wave (reflects off ionosphere), and LOS (Line-of-Sight, direct path). Multi-path propagation occurs when signals take multiple paths due to Reflection (bouncing off surfaces), Diffraction (bending around obstacles), and Scattering (spreading by small objects). Fading is the variation of signal strength over time and distance due to multipath.

Lecture 4 — Error Part I

Transmission Errors occur when bits are altered during transmission. Parity Check adds an extra bit (parity bit) to make the total number of 1s even or odd for basic error detection. Cyclic Redundancy Check (CRC) treats data as a polynomial and divides by a generator polynomial; the remainder is appended as CRC code. Block Error Code adds redundant bits to blocks of data for error detection and correction.

Lecture 5 — Error Part II

Block Codes include Hamming codes (can correct single-bit errors and detect double-bit errors), BCH codes (generalization of Hamming codes, can correct multiple errors), and Reed-Solomon codes (subclass of non-binary BCH codes, good for burst errors). ARQ (Automatic Repeat reQuest) uses acknowledgments and retransmissions: Sliding window allows multiple frames in transit, and Go-back-N retransmits all frames from the lost frame onward.

Lecture 6 — Multiple Access (Part I)

FDMA (Frequency Division Multiple Access) assigns different frequency bands to different users. TDMA (Time Division Multiple Access) assigns different time slots to different users. CDMA (Code Division Multiple Access) uses unique codes to allow simultaneous transmission on same frequency. Random Access includes ALOHA (transmit anytime, collision detection) and Slotted ALOHA (transmit only at slot boundaries, reducing collisions) and Reservation-based ALOHA (reserve slots before transmission).

Lecture 7 — Multiple Access (Part II)

CSMA (Carrier Sense Multiple Access) listens before transmitting. Versions of CSMA include 1-persistent, non-persistent, and p-persistent. CSMA/CA (Collision Avoidance) uses RTS/CTS handshake to avoid collisions, common in wireless.

Lecture 8 — Evolution Part I

1G wireless cellular networks include NMT (Nordic Mobile Telephone), AMPS (Advanced Mobile Phone System), and TACS (Total Access Communication System). Spread Spectrum includes Frequency Hopping (pseudorandomly changes carrier frequency) and Direct Sequence (spreads signal over wide bandwidth using chip code). 2G cellular systems include GSM (Global System for Mobile), IS-136 (D-AMPS), PDC (Pacific Digital Cellular), and IS-95 (cdmaOne).

Lecture 9 — Evolution Part II

2.5G technologies include HSCSD (High-Speed Circuit-Switched Data, up to 57.6 kbps), GPRS (General Packet Radio Service, up to 171.2 kbps), EDGE (Enhanced Data rates for GSM Evolution, up to 384 kbps), and IS-95B (up to 64 kbps). 3G technologies include UMTS/W-CDMA (Universal Mobile Telecommunications System/Wideband CDMA, up to 2 Mbps) and CDMA2000 (including 1xRTT at 144 kbps).

Specifications of 2.5G and 3G Standards

The table summarizes key specifications:

• HSCSD: Channel BW 200 KHz, FDD duplex, Software upgrade at BS only, No new spectrum, New handsets providing 57.6 kbps on HSCSD and 9.6 kbps on GSM
• GPRS: Channel BW 200 KHz, FDD duplex, New packet overlay at routers and gateways, No new spectrum, New GPRS sets work at 171.2 kbps
• EDGE: Channel BW 200 KHz, FDD duplex, New TX/Rx at BS with software upgrade, No new spectrum, Tri-mode sets (EDGE 384 kbps / GPRS 144 kbps / GSM 9.6 kbps)
• W-CDMA: Channel BW 5 MHz, FDD duplex, Completely new BS, New spectrum required, New handsets at 2 Mbps in WCDMA
• IS-95B: Channel BW 1.25 MHz, FDD duplex, New software at BS, No new spectrum, IS-95B at 64 kbps
• Cdma2000 1xRTT: Channel BW 1.25 MHz, FDD duplex, New software at backbone, new channel cards at BS, new packet service node, No new spectrum, 1xRTT at 144 kbps
• Cdma2000 1xEV(DO/DV): Channel BW 1.25 MHz, FDD duplex, Software and card upgrade to 1xRTT, No new spectrum, 1xEV at 2.4 Mbps
• Cdma2000 3xRTT: Channel BW 3.75 MHz, FDD duplex, Backbone modifications and channel cards at BS, May require new spectrum, 3xRTT at 2 Mbps

💡 Why this matters: This table clearly shows the evolutionary path showing how 2.5G evolved from 2G through software/card upgrades while 3G required completely new infrastructure and spectrum.

Lecture 10 — Evolution III

Limitation of 3G includes limited data rates compared to emerging needs. 4G objectives include higher data rates, seamless mobility, and IP-based architecture. Issues include QoS (traffic from different services requires different cell loss rate, delay, and jitter guarantees — it is non-trivial across different networks), Security (involves authentication, confidentiality, integrity, authorization; heterogeneity complicates it; AAA protocols provide framework for control plane functions and installing security policies like encryption, decryption, and filtering), Multimedia Service, Applications, and Convergence of Cellular and WLAN with Billing Issue.

Lecture 11 — Cell Concept Part I

Cellular Concept divides coverage area into cells, each served by a base station with lower power. Frequency Reuse uses same frequencies in non-adjacent cells to increase capacity. Locating co-channel cells involves calculating distances between cells sharing same frequencies.

Lecture 12 — Cell Concept Part II

Channel Assignment Strategies include fixed and dynamic allocation. Handoff Strategies consider When to handoff (based on signal strength). In 1G, handoff is BS based (network decides). In 2G or today, handoff is Mobile-Assisted (mobile measures and reports). Prioritizing Handoff uses Guard channels concept (reserve channels for handoff) and Queuing handoff requests (delay if no channel available). Practical handoff considerations include Umbrella cell (large cell covering microcells) and Cell dragging (mobile holds signal too long).

Lecture 13 — Cell Concept Part III

Interference and system capacity includes Co-channel interference and capacity (caused by cells using same frequencies, reduces capacity) and Adjacent channel interference and capacity (caused by nearby frequencies leaking into desired channel). Channel Planning for Wireless System assigns frequencies to minimize interference.

Lecture 14 — Cell Concept Part IV

Trunking and Grade of Service involves Measuring Traffic Intensity (in Erlangs). Trunked Systems include Blocked Calls Cleared (lost call is dropped) and Blocked Calls Delayed (queued until channel available). Erlang Charts calculate probability of blocking/delay. Improving Coverage and Capacity uses Cell Splitting (divide cells into smaller cells), Sectoring (use directional antennas), Repeaters for Range Extension, and Microcell Zone Concept (central controller switches between microcell zones).

Lecture 15 — AMPS

AMPS (Advanced Mobile Phone System) is a 1G analog cellular system. System Overview uses FDMA/FDD. Call handling involves registration, paging, and channel assignment. Air interface specifies forward (base-to-mobile) and reverse (mobile-to-base) channels. Supervisory signals include SAT (Supervisory Audio Tone) and ST (Signaling Tone). N-AMPS is a narrowband version increasing capacity.

Lecture 16 — GSM

GSM (Global System for Mobile) is a 2G digital cellular standard. GSM System Architecture includes Mobile Station, Base Station Subsystem (BSS), Network and Switching Subsystem (NSS), and Operation Support Subsystem (OSS). GSM Network Areas include cell, location area, MSC area, and PLMN. Specifications include 200 KHz channel BW, 8 users per channel via TDMA. Subscriber Services include voice, SMS, and data. Mobility management uses HLR (Home Location Register) and VLR (Visitor Location Register).

Lecture 17 — GPRS (Part I)

GPRS (General Packet Radio Service) adds packet data to GSM. GPRS Architecture includes SGSN (Serving GPRS Support Node) and GGSN (Gateway GPRS Support Node). Registration and Session Management involves GPRS attach and PDP context activation. Routing Scenario in GPRS routes packets between MS and PDN. Channels Classification divides channels for signaling and traffic. PDP Context Activation establishes a packet data session with assigned IP address.

Lecture 18 — GPRS Part II

GPRS Protocol Architecture includes: MS – BSS (Um interface, radio protocols), BSS – SGSN (Gb interface), SGSN – GGSN (Gn interface), and GGSN – PDN (Gi interface). GPRS Air Interface uses packet data channels (PDCH). Data Routing and Mobility tracks mobile location. Uplink Data Transfer uses USF (Uplink State Flag) for contention resolution. Downlink Data Transfer uses polling method. QoS in GPRS defines reliability, delay, and throughput classes.

Lecture 19 — IS-95

IS-136 is a TDMA-based 2G standard (D-AMPS). CDMA/IS-95 is a 2G CDMA-based standard. Advantages include Higher capacity (soft capacity), Improved voice quality (new vocoder), Less power consumption (6-7 mW), Privacy (spreading codes), Graceful degradation (more users = gradual quality reduction, not hard blocking). Drawbacks include Self-jamming (interference from own cell users) and Near-far problem (strong signals from near users drown out far users). IS-95 Forward Channels include Pilot Channel (for synchronization and channel estimation), Sync Channel (for system timing), Paging Channel (for overhead and paging messages), and Traffic Channels (for user data). IS-95 Reverse Channels include access and traffic channels.

Lecture 20 — EDGE

EDGE (Enhanced Data rates for GSM Evolution) uses 200 KHz channels. Modulation and Coding Schemes (MCS-1 to MCS-9) use GMSK or 8-PSK modulation with different coding rates. Link Adaptation dynamically selects best MCS based on channel quality. Incremental Redundancy retransmits with different coding to combine for better decoding. Capacity Planning calculates throughput based on modulation and coding.

Lecture 21 — UMTS/WCDMA Part I

UMTS (Universal Mobile Telecommunications System) is a 3G standard. Service Classes include Conversational (real-time voice), Streaming (video), Interactive (web browsing), and Background (email, downloads). UTRAN Architecture includes Node B (base station) and RNC (Radio Network Controller) with two types: Serving RNC (controls the connection) and Drifting RNC (provides diversity handover support). Radio Interface Protocol Architecture has three layers: Physical, Data Link, and Network. Protocol Models for UTRAN define interfaces between network elements. Logical Channels are mapped to transport channels then to physical channels.

Lecture 22 — WCDMA Part II

Spreading and Scrambling uses channelization codes (for user separation) and scrambling codes (for cell/sector separation). Channel Concept has three layers: Logical Channels (RLC layer) → Transport Channels (MAC layer) → Physical Channels (Physical layer). Physical Layer Procedures include RACH Operation (mobile sends preamble of 16 symbols, waits for ACK on AICH - Acquisition Indicator Channel), Cell Searching uses 256 chip primary synchronization code and 15 secondary synchronization codes (SSCs), and Power Control uses Fast Closed Loop (1500 Hz TPC - Transmit Power Control commands, 1500 updates per second) and Closed Loop power control.

Lecture 23 — WCDMA Part III

Compressed mode measurements allow measuring other frequencies without dual receiver. Handover measurements include Intra-mode (same frequency), Inter-mode (different frequency in same system), and Inter-system (between UMTS and GSM). WCDMA packet data access uses shared channels for efficiency. Transport channels for packet data include Common (RACH, FACH), Dedicated (DCH), and Shared (DSCH, HS-DSCH) channels. Packet scheduling algorithms include Time division scheduling (assigns time slots), Code division scheduling (assigns spreading codes), and Transmission Power-based scheduling (allocates based on power budget).

Lecture 24 — CDMA2000

New MAC and Physical layer features improve data rates and efficiency. Physical layer of cdma2000 uses 1.25 MHz channels with QPSK/BPSK modulation. Reverse Physical channels include access, control, and traffic channels. New Network elements include Packet Control Function (PCF) (manages packet data connections at the BS) and Packet Data Serving Node (PDSN) (acts as gateway for packet data traffic). Mobility Management tracks mobile location across network. Handoff includes Intra-PCF (within same PCF), Inter-PCF/Intra-PDSN (between PCFs but same PDSN), and Inter-PDSN (between different PDSNs, requires mobile IP).

⭐ Key Takeaways

The course covers the complete evolution of wireless networks from 1G analog systems (AMPS) through 2G digital (GSM, IS-95), 2.5G packet data (GPRS, EDGE), to 3G wideband systems (UMTS/WCDMA, CDMA2000). Fundamental concepts like cellular frequency reuse, handoff strategies, trunking theory with Erlang calculations, and multiple access techniques (FDMA, TDMA, CDMA, CSMA/CA) form the backbone of all cellular system design. Error control through block codes (Hamming, BCH, Reed-Solomon) and ARQ protocols ensures reliable transmission, while spread spectrum and CDMA principles enable higher capacity and graceful degradation. The transition from circuit-switched to packet-switched architecture (GPRS, cdma2000) with nodes like SGSN, GGSN, PCF, and PDSN marks the path toward all-IP 4G networks.

🧠 Quick Revision Questions

1. What is the difference between antenna size requirements for a 1 MHz signal versus a 1 GHz signal, and why?
2. Compare the infrastructure changes required for upgrading from GSM to GPRS versus upgrading from GSM to W-CDMA.
3. What are the three handoff types in cdma2000, and what distinguishes Inter-PCF/Intra-PDSN from Inter-PDSN handoff?
4. How does the Guard Channels concept differ from Queuing handoff requests in prioritizing handoffs, and which trunking model (Blocked Calls Cleared or Delayed) does each relate to?
5. Explain the difference between Spreading and Scrambling in WCDMA, including what each code type is used for.

📘 Lecture 26 — Wireless LAN / IEEE 802.11

📖 Overview: This lecture provides a comprehensive introduction to IEEE 802.11 wireless LANs, covering their standardization, architectural components, and services. It also delves into the Medium Access Control (MAC) protocols, specifically the Distributed Coordination Function (DCF) and Point Coordination Function (PCF), which are fundamental for understanding how wireless devices share the communication medium.

🗂️ Topics Covered

The lecture begins with an overview of the IEEE 802.11 committee and its goals, then outlines the requirements for WLANs. It introduces various IEEE 802.11 protocols (a, b, d, e, etc.) and explains the architecture including BSS, AP, DS, ESS, and IBSS. The 802.11 services for message distribution (Distribution, Integration) and association (Association, Re-association, Disassociation) are detailed, alongside access and privacy services (Authentication, De-authentication, Privacy). The lecture concludes with a focus on the MAC layer, specifically the DCF using CSMA/CA with IFS and backoff mechanisms.

📝 Lecture Summary

Overview of IEEE 802.11

The IEEE 802.11 committee, formed in 1990, standardized wireless networks. It supports multiple Physical Layers, including Frequency Hopping Spread Spectrum (FHSS) , Direct Sequence Spread Spectrum (DSSS) , and Infrared. It operates in the 2.4GHz Industrial, Scientific & Medical (ISM) shared unlicensed band (2.4 to 2.4835GHz). Initial data transfer rates were 2Mb/s & 1Mb/s. The standard was adopted in 1997. The primary goals are to deliver services akin to wired networks, achieve high throughput and highly reliable data delivery, and maintain continuous network connection.

💡 Why this matters: This establishes the foundational technology that most modern Wi-Fi is built upon, and the use of the unlicensed ISM band is why Wi-Fi is free to use without a license.

WLAN Requirements

A Wireless LAN (WLAN) must meet several requirements for practical use. These include Throughput, Number of Nodes/Scalability, Connection to Backbone LAN, a Service Area of 100 to 300 meters, and low Power Consumption. It must also ensure Transmission Robustness and Security, allow for Collocated network Operation (multiple networks in the same area), be License-free, support Handoff/Roaming, and offer Dynamic Configuration.

IEEE 802.11 Protocols

The IEEE 802.11 standard has multiple amendments for different physical and MAC layers.

• IEEE 802.11a: PHY Standard using OFDM, providing 8 channels at 54 Mbps in the 5 GHz band.
• IEEE 802.11b: PHY Standard using FHSS, DSSS, with 3 channels at 11 Mbps in the 2.4 GHz band.
• IEEE 802.11d: MAC Standard for operation at variable power levels.
• IEEE 802.11e: MAC Standard for QoS support using EDCF.
• IEEE 802.11f: Inter-Access Point Protocol (2002).
• IEEE 802.11h: Supplementary MAC Standard, an enhanced version of 802.11a for European regulation providing TPC (Transmit Power Control) and DFS (Dynamic Frequency Selection) .
• IEEE 802.11i: Supplementary MAC Standard offering an Alternative to WEP (Wired Equivalent Privacy).
• IEEE 802.11n: Enhancement to 802.11g providing 100+ Mbps using MIMO (Multiple-Input Multiple-Output) .
• IEEE 802.11s: Mesh networking extension.

🔑 Definition — EDCF: Enhanced Distributed Coordination Function, a MAC standard for QoS support. 🔑 Definition — MIMO: Multiple-Input Multiple-Output, a technology using multiple antennas to increase data throughput.

IEEE 802.11 Architecture

An 802.11 WLAN is based on a cellular architecture. Each cell is a Basic Service Set (BSS) , controlled by a base station called an Access Point (AP) . These APs are connected to a backbone network called the Distribution System (DS) . The entire interconnected WLAN (multiple BSSs connected via DS) forms an Extended Service Set (ESS) , which appears as a single layer to the OSI model. A Mobile Station (MS) in a BSS with no connection to other BSSs forms an Independent BSS (IBSS) , which is typically an ad hoc network where stations communicate directly.

🔑 Definition — BSS: Basic Service Set, a single cell in a WLAN controlled by an access point. 🔑 Definition — AP: Access Point, the base station that controls a BSS. 🔑 Definition — DS: Distribution System, the backbone network connecting multiple APs. 🔑 Definition — ESS: Extended Service Set, a set of interconnected BSSs forming a larger network. 🔑 Definition — IBSS: Independent Basic Service Set, an ad hoc network with no connection to other BSSs.

802.11 Services

IEEE 802.11 defines nine services. Three are for WLAN access and confidentiality, and six support the delivery of MAC Service Data Units (MSDUs) between stations.

Messages Distribution in ESS Two services are involved in distributing messages within the DS.

• Distribution: This is the primary service for exchanging MAC frames between stations in two different BSSs. A source station sends a frame to its AP, which forwards it to the DS. The DS then sends it to the AP of the destination station. The transport of the message within the DS itself is beyond the scope of the 802.11 standard.
• Integration: This service enables data transfer between a station on an 802.11 LAN and a station on an integrated 802.x LAN (Wired LAN) . It handles any necessary address translation and media conversion logic.

💡 Why this matters: The DS is the 'backbone' that allows devices in different parts of a building (different BSSs) to communicate with each other and with the wired internet. The Access Point functions as a bridge and a relay point. To integrate 802.11 with a wired LAN (802.2), a portal (e.g., a bridge or router) is used.

Association-Related Services Three services manage the connection between a station and an AP.

• Association: Establishes the initial association between a station and an AP. The AP then communicates its identity to other APs within the ESS to facilitate routing and delivery of addressed frames.
• Re-association: Enables an established association to be transferred from one AP to another (e.g., during roaming).
• Disassociation: A notification from either a MS or an AP that an existing association has been terminated.

Access and Privacy Services

• Authentication: Establishes the identity of stations. IEEE 802.11 requires a mutually acceptable, successful authentication before association can occur.
• De-authentication: Invoked to terminate an existing authentication.
• Privacy: The standard provides optional use of encryption to assure the privacy of data.

IEEE 802.11 Medium Access Control (MAC)

The MAC Layer provides three primary functions: Reliable data delivery, Medium access control, and Security.

Reliable Data Delivery Reliability is handled at the MAC layer rather than the TCP layer because TCP timers introduce significant delays. The MAC provides a "quick fix" by using a hop-by-hop ACK (Acknowledgement) as an atomic operation.

MAC Protocol There are two types of medium access control algorithms:

• Distributed access protocol: The decision to transmit is distributed among all stations (e.g., in an IBSS).
• Centralized control: A central point (e.g., the AP in an ESS) controls access, which is better when APs are connected to a DS.

Distributed Coordination Function (DCF)

The DCF sublayer uses a CSMA (Carrier Sense Multiple Access) algorithm. Because collision detection (as in Ethernet) is not possible in wireless communication, it implements Collision Avoidance (CA) . It uses a set of delays of different periods called Inter-Frame Space (IFS) .

CSMA/CA

• A station willing to transmit first senses the medium.
• If the medium is busy, the station defers.
• If the medium is idle, the station waits for a Distributed Inter-Frame Space (DIFS) period. If the medium remains idle, the station transmits.
• If a collision occurs (or after a busy period), a station uses an exponential backoff algorithm to minimize the chance of another collision.

CSMA/CA Algorithm Example

• Station A is transmitting a frame when stations B, C, and D sense the channel and want to transmit.
• B, C, and D each run a random number generator to obtain a backoff time.
• Station C draws the smallest number, followed by D, then B.
• After A finishes transmitting:
  1. B, C, and D wait for the IFS period and then start their backoff counters.
  2. C's counter finishes first, so it checks the medium (idle) and starts transmitting.
  3. B and D freeze their counters.
  4. After C finishes, B and D wait for the IFS period and then (re-)start their counters from where they left off.

🔑 Definition — DCF: Distributed Coordination Function, the fundamental MAC protocol using CSMA/CA. 🔑 Definition — CSMA/CA: Carrier Sense Multiple Access with Collision Avoidance, the protocol used by DCF. 🔑 Definition — IFS: Inter-Frame Space, a set of delay periods between frames. 🔑 Definition — DIFS: Distributed Inter-Frame Space, the specific IFS period used before transmission in DCF. 🔑 Definition — Backoff: A random time a station must wait before attempting to transmit again after a collision or busy period.

⭐ Key Takeaways

The IEEE 802.11 standard defines the architecture and protocols for wireless LANs, forming the basis for all Wi-Fi technology. The network is cellular, built from BSSs controlled by APs, which are connected via a DS to form an ESS. The MAC layer's DCF is the primary access method, using CSMA/CA to avoid collisions by incorporating a random backoff timer and IFS delays. Understanding the roles of Distribution, Integration, and Association services is critical for grasping how data is routed and connections are managed within a WLAN.

🧠 Quick Revision Questions

1. What is the difference between a BSS, an ESS, and an IBSS in an 802.11 network?
2. Which two services are involved in the distribution of messages within the Distribution System (DS)?
3. What is the primary function of the DCF sublayer, and what algorithm does it use to achieve this?
4. In the CSMA/CA example, why do stations B and D "freeze" their counters when station C starts transmitting?
5. What is the purpose of the Inter-Frame Space (IFS) in the 802.11 MAC protocol?

📘 Lecture 27 — WLAN Part II

📖 Overview: This lecture addresses key problems in the DCF protocol—namely the Hidden Node and Exposed Node problems—and introduces the RTS/CTS virtual carrier sensing mechanism to mitigate them. It also covers interframe spacing priorities, the Point Coordination Function for contention-free access, fragmentation and reassembly, the detailed IEEE 802.11 MAC frame format, and the physical media defined in the original standard.

🗂️ Topics Covered

The lecture reviews last lecture's content, then presents the problems with DCF including Hidden Node and Exposed Node problems. It introduces the RTS/CTS Protocol as a virtual carrier sensing technique, explains different Interframe Spacing intervals (SIFS, PIFS, DIFS, EIFS), describes the Point Coordination Function (PCF) as a centralized access method, covers Fragmentation and Reassembly of MSDUs, details the IEEE 802.11 MAC Frame Format including frame control fields and address types, enumerates Control, Data, and Management Frame Subtypes, and summarizes the physical media defined by the original 802.11 standard along with 802.11a and 802.11b enhancements.

📝 Lecture Summary

Last Lecture

The previous lecture covered an overview of IEEE 802.11, its protocols, architecture, and services. It introduced the WLAN MAC protocols: DCF (Distributed Coordination Function) and PCF (Point Coordination Function).

Problems with DCF

The Hidden Node Problem occurs when two stations are out of range of each other but both are within range of a third station (e.g., an AP). If both transmit simultaneously, a collision occurs at the receiver. The Exposed Node Problem occurs when a station overhears a transmission and defers its own transmission unnecessarily, even though its transmission would not cause a collision at the intended destination.

RTS/CTS Protocol

The RTS/CTS Protocol is a Virtual Carrier Sense technique used to mitigate the Hidden Node and Exposed Node problems. The source sends a Request-to-Send (RTS) beacon, and the destination, if free, responds with a Clear-to-Send (CTS) beacon. After receiving CTS, the source transmits the data packet, and the destination sends an ACK if the packet is received successfully. The RTS frame includes source, destination ID, and the duration of the following transaction. This duration information allows stations hearing the RTS to protect the transmission from collision on the transmitter side. The CTS response also includes the same duration amount, helping overcome the hidden terminal problem. All stations hearing RTS/CTS set their Network Allocation Vector (NAV) to the given duration, effectively reserving the medium. Since RTS/CTS frames are shorter than MSDU, collision is detected quickly. If the MSDU is smaller than the RTSThreshold, the standard allows skipping RTS/CTS.

💡 Why this matters: The NAV mechanism provides a virtual carrier sense that prevents hidden nodes from interfering, significantly reducing collision probability.

Interframe Spacing

The IEEE 802.11 standard defines four interframe space (IFS) intervals to prioritize access:

• Short Interframe Space (SIFS): Used for highest-priority transmissions, such as RTS/CTS frames and positive acknowledgments.
• PCF Interframe Space (PIFS): Used by the PCF during contention-free operation. Stations with data to transmit in the contention-free period can transmit after PIFS has elapsed, pre-empting contention-based traffic.
• DCF Interframe Space (DIFS): The minimum medium idle time for contention-based services. Stations may have immediate access to the medium if it has been free for a period longer than DIFS.
• Extended Interframe Space (EIFS): Not a fixed interval; used only when there is an error in frame transmission.

Point Coordination Function (PCF)

PCF provides centralized access to the medium. It is implemented on top of DCF. The Access Point (AP) issues polls to the mobile stations (MS) in a round-robin fashion. PIFS is used between polling intervals.

Fragmentation and Reassembly

In Ethernet, a MAC frame can be up to 1518 bytes long. IEEE 802.11 cannot support such large frames due to: higher bit error rate (corruption of a large frame incurs high overhead), and the fact that on Frequency Hopping (FH) , the medium is interrupted periodically (every 20ms), so a smaller packet results in a smaller chance of postponing transmission. Therefore, segmentation/reassembly is added to support Ethernet frames. Each MSDU is divided into several frames/segments. All segments are transmitted after SIFS of ACK reception. Segments are reassembled to the MSDU in the order they were transmitted.

IEEE 802.11 MAC Frame Format

The MAC frame format includes the following fields:

• Frame Control: Contains frame type and control information.
• Duration/Connection ID: Indicates channel allocation time.
• Addresses: Context-dependent; types include source and destination.
• Sequence Control: Used for numbering and reassembly.
• Frame Body: Contains the MSDU or a fragment of an MSDU.
• Frame Check Sequence: A 32-bit CRC for error detection.

Addresses

Four address fields are defined, depending on context:

• Destination Address: The 48-bit IEEE MAC identifier corresponding to the final recipient (the station that will hand the frame to higher protocol layers).
• Source Address: The 48-bit IEEE MAC identifier identifying the source of the transmission. The Individual/Group bit is always 0 to indicate an individual station.
• Receiver Address: A 48-bit IEEE MAC identifier indicating which wireless station should process the frame. If it is a wireless station, the receiver address is the destination address.
• Transmitter Address: A 48-bit IEEE MAC address identifying the wireless interface that transmitted the frame onto the wireless medium.

Frame Control Fields

The Frame Control field contains:

• Protocol version: IEEE 802.11 version
• Type: Control, management, or data
• Subtype: Identifies the function of the frame
• To DS: 1 if destined for the Distribution System (DS)
• From DS: 1 if leaving the DS
• More fragments: 1 if fragments follow
• Retry: 1 if retransmission of a previous frame
• Power management: 1 if the transmitting station is in sleep mode
• More data: Indicates that the station has more data to send
• WEP: 1 if Wired Equivalent Protocol is implemented
• Order: 1 if any data frame is sent using the Strictly Ordered service

Control Frame Subtypes (Type 01)

Control frames include: Power Save-Poll (PS-Poll), Request to Send (RTS), Clear to Send (CTS), Acknowledgment, Contention-Free (CF)-end, and CF-end + CF-ack.

Data Frame Subtypes (Type 10)

Data-carrying frames include: Data, Data + CF-Ack, Data + CF-Poll, Data + CF-Ack + CF-Poll. Subtypes that don't carry user data include: Null Function, CF-Ack, CF-Poll, and CF-Ack + CF-Poll.

Management Frame Subtypes (Type 00)

Management frames include: Association request, Association response, Reassociation request, Reassociation response, Probe request, Probe response, Beacon, Announcement Traffic Indication Message (ATIM) , Dissociation, Authentication, and Deauthentication.

Physical Media Defined by Original 802.11 Standard

The original standard defined three physical media:

• Direct-Sequence Spread Spectrum (DSSS) : Operating in the 2.4 GHz ISM band at data rates of 1 and 2 Mbps.
• Frequency-Hopping Spread Spectrum (FHSS) : Operating in the 2.4 GHz ISM band at data rates of 1 and 2 Mbps.
• Infrared: Data rates of 1 and 2 Mbps using wavelengths between 850 and 950 nm.

IEEE 802.11a and IEEE 802.11b

• IEEE 802.11a: Uses the 5-GHz band, provides rates of 6, 9, 12, 18, 24, 36, 48, 54 Mbps, uses Orthogonal Frequency Division Multiplexing (OFDM) , and subcarriers are modulated using BPSK, QPSK, 16-QAM, or 64-QAM.
• IEEE 802.11b: Provides data rates of 5.5 and 11 Mbps using Complementary Code Keying (CCK) modulation.

⭐ Key Takeaways

The RTS/CTS mechanism with virtual carrier sensing using NAV is essential for mitigating the Hidden Node problem, though RTS/CTS can be skipped for small frames below the RTSThreshold. Interframe spaces (SIFS, PIFS, DIFS, EIFS) establish a priority hierarchy, with SIFS used for the highest-priority frames. Fragmentation is used because wireless links have higher error rates and periodic interruptions, and each fragment is acknowledged independently. The MAC Frame Format includes four address fields (destination, source, receiver, transmitter) and a Frame Control field with type/subtype to distinguish control, data, and management frames. The original 802.11 physical media were DSSS, FHSS, and Infrared at 1-2 Mbps, with subsequent 802.11a and 802.11b offering higher rates using OFDM and CCK respectively.

🧠 Quick Revision Questions

1. Explain how the RTS/CTS protocol solves the Hidden Node Problem. Include the role of the Network Allocation Vector (NAV) .
2. List the four interframe space intervals in order from highest priority to lowest, and state which protocol uses PIFS.
3. Why does IEEE 802.11 use fragmentation and reassembly? How is an MSDU divided and transmitted?
4. Describe the purpose of each of the four address fields in the IEEE 802.11 MAC frame (Destination, Source, Receiver, Transmitter).
5. Name the three original physical media defined by IEEE 802.11 and their data rates. What modulation does IEEE 802.11b use to achieve 5.5 and 11 Mbps?

📘 Lecture 28 — Mobile Ad hoc Network

📖 Overview: This lecture introduces Mobile Ad hoc Networks (MANETs), which are infrastructureless, self-creating, and self-organizing networks of mobile nodes. It explains their characteristics, compares them with cellular networks, discusses key challenges, and provides a taxonomy and overview of common routing protocols like DSDV, AODV, DSR, ZRP, and TORA.

🗂️ Topics Covered

The lecture covers the introduction to Mobile Ad hoc Networks including what an ad hoc network is, its characteristics, comparison with cellular networks, applications, and challenges. It then dives into routing protocols — expected properties, a taxonomy based on communication model, structure, state information, and scheduling — and surveys several common protocols: DSDV, AODV, DSR, TORA, OLSR, and ZRP.

📝 Lecture Summary

Introduction

A Mobile Ad hoc Network (MANET) is a group of mobile, wireless nodes that cooperatively and spontaneously form a network independent of any fixed infrastructure or centralized administration. A node communicates directly with nodes within wireless range and indirectly with all other destinations using a dynamically determined multi-hop route through other nodes in the MANET. The term "ad hoc" means for a specific purpose or occasion.

🔑 Definition — Ad hoc network: a network composed solely of stations within mutual communication range via wireless media, forming an independent basic service set without fixed infrastructure.

The characteristic of ad hoc networks

Ad hoc networks are heterogeneous, self-creating (not relying on pre-existing fixed infrastructure), self-organizing (no predetermined topology), and self-administering (no central control). They create a network “on the fly.” Ad hoc networks are infrastructureless, multiple hop (due to radio power limitation, channel utilization, and power-saving concerns), and use DCF (Distributed Coordination Function). In contrast, cellular networks are infrastructure-based, one hop (uplink or downlink), and use PCF (Point Coordination Function).

💡 Why this matters: Understanding the fundamental difference between infrastructure-based and infrastructureless networks is crucial because it dictates all design choices — from MAC protocols to routing algorithms.

Challenges

Key challenges for ad hoc networks include: 1) Spectrum allocation, 2) Self-configuration, 3) Medium access control (MAC), 4) Energy efficiency, 5) TCP Performance, 6) Mobility management, 7) Security & privacy, 8) Routing protocols, 9) Multicasting, 10) Quality of Service (QoS), and 11) Service Location, Provision, and Access.

Expected Properties of Routing

An ideal ad hoc network routing protocol should: be distributed (to increase reliability), assume routes as unidirectional links, be power efficient, consider its security, be hybrid protocols, and be aware of Quality of Service.

Taxonomy

The taxonomy for routing protocols in Mobile ad hoc networks includes: Reactive (On-demand) routing protocols, Proactive (Table-driven) protocols, Hybrid protocols, Hierarchical protocols, and Geographical protocols. The taxonomy is based on: Communication model (multi-channel vs. single channel), Structure (are all nodes treated uniformly?; how are distinguished nodes selected?), State information (is network-scale topology obtained at each node?), and Scheduling (is route information continually maintained for each destination — proactive or reactive?).

DSDV

DSDV (Destination-Sequenced Distance-Vector) is based on the Bellman-Ford routing algorithm. Every mobile station maintains a routing table that lists: all available destinations, the number of hops to reach the destination, and the sequence number assigned by the destination node. A station transmits its routing table periodically or if a significant change has occurred in its table from the last update sent. Routing table updates can be sent in two ways: full dump (entire table) or incremental update (only changed entries).

AODV

AODV (Ad hoc On-demand Distance Vector) borrows the basic on-demand mechanism of route discovery and route maintenance from DSR, and the use of hop-by-hop routing, sequence numbers, and periodic beacons from DSDV. A node periodically broadcasts hello information to maintain local connectivity. It only supports the use of symmetric links.

TORA

TORA (Temporally-Ordered Routing Algorithm) is based on the concept of link reversal. It finds multiple routes from a source node to a destination node. The control messages are localized to a very small set of nodes near the occurrence of a topological change.

DSR

DSR (Dynamic Source Routing) is an on-demand protocol where a node maintains route caches containing the source routes it is aware of. Route discovery uses route request packets containing the source address, destination address, and a unique identification number. Route replies are generated by the destination or an intermediate node with current information about the destination. Route maintenance uses route error packets generated when the data link layer encounters a fatal transmission problem, and acknowledgments, including passive acknowledgments.

OLSR

OLSR (Optimized Link State Routing) requires only multipoint relays (MPRs) to forward link state updates. It is particularly suited for dense networks. In sparse networks, every neighbor becomes a multipoint relay, and OLSR reduces to a pure link-state protocol.

ZRP

ZRP (Zone Routing Protocol) is a hybrid routing protocol that combines both proactive and on-demand routing strategies. Each node has a predefined zone. Inside zones: proactive routing is used. Outside zones: on-demand routing is used. ZRP provides more flexibility.

⭐ Key Takeaways

MANETs are infrastructureless, self-creating, self-organizing, and self-administering networks that use multi-hop DCF-based communication, unlike infrastructure-based cellular networks. The eleven major challenges include routing, energy efficiency, security, and QoS. Routing protocols are classified as proactive (table-driven like DSDV), reactive (on-demand like AODV and DSR), hybrid (ZRP), and others (TORA with link reversal, OLSR with MPRs). DSDV uses Bellman-Ford with sequence numbers and routing tables; AODV combines DSR's on-demand discovery with DSDV's hop-by-hop routing; DSR uses source routing with route caches; TORA uses link reversal for multiple routes; and ZRP combines proactive intra-zone with reactive inter-zone routing.

🧠 Quick Revision Questions

1. What are the four key characteristics of ad hoc networks?
2. How does an ad hoc network differ from a cellular network in terms of infrastructure, hops, and MAC protocol?
3. What is the main difference between a proactive (table-driven) and a reactive (on-demand) routing protocol?
4. Which protocols does AODV borrow ideas from, and what are the two key features it takes from each?
5. In ZRP, what routing strategy is used inside a zone and what is used outside a zone?

📘 Lecture 29 — Security in IEEE 802.11

📖 Overview: This lecture provides a comprehensive overview of security mechanisms in IEEE 802.11 wireless networks. It begins by classifying types of attacks, then explains the goals of 802.11 security, details the Wired Equivalent Privacy (WEP) protocol and its authentication process, analyzes critical security flaws, and introduces the 802.1x security framework and the Independent Basic Service Set (IBSS) security model.

🗂️ Topics Covered

The lecture covers types of attacks (passive, active, dictionary building), goals of 802.11 security (access control, data integrity, confidentiality), the WEP protocol (encapsulation, authentication), security flaws in original 802.11 (physical threats, impersonation, known plaintext attacks, denial of service, dictionary attacks), the 802.1x security framework with Authentication Server (AS) and Pre-Shared Key (PSK) operations, and the IBSS security model.

📝 Lecture Summary

Types of Attack

Passive attacks aim to decrypt traffic based on statistical analysis of captured data. Active attacks inject new traffic from authorized mobile stations based on known plaintext. A second type of active attack tricks the access point to decrypt traffic. Dictionary building attacks allow real-time automated decryption of all traffic by precomputing possible key streams.

Goals of 802.11 Security

The three primary goals are:

• Access Control: Ensure that your wireless infrastructure is not used by unauthorized entities.
• Data Integrity: Ensure that your data packets are not modified in transit.
• Confidentiality: Ensure that the contents of your wireless traffic is not learned by eavesdroppers.

802.11 security consists of two subsystems:

1. A data encapsulation technique called Wired Equivalent Privacy (WEP)
2. An authentication algorithm called Shared Key Authentication

WEP

Wireless connections have important security issues to keep intruders from accessing, reading, and modifying network traffic, but mobile systems need to be connected. An algorithm is needed that provides the same level of security that a physical wire does. WEP is used to:

• Protect wireless communication from eavesdropping
• Prevent unauthorized access to wireless network (a feature, though not an explicit goal in the 802.11 standard)

WEP relies on a secret key shared between the sender (mobile station, e.g., laptop) and receiver (access point, e.g., base station). The secret key is used to encrypt packets before transmission, and an Integrity Check ensures packets are not modified in transit. The standard does not discuss how the shared key is established; in practice, most installations use a single key shared between all mobile stations and access points.

🔑 Definition — WEP (Wired Equivalent Privacy): An algorithm designed to provide a level of security equivalent to that of a wired LAN by encrypting data and authenticating devices using a shared secret key.

WEP Protocol

To send a message M:

1. Compute a checksum c(M) (which is not dependent on the secret key k)
2. Pick an IV (Initialization Vector) v and generate a keystream RC4(v, k)
3. XOR the message with its checksum <M, c(M)> with the keystream to get the ciphertext
4. Transmit v and the ciphertext over a radio link

When a message is received:

1. Use the transmitted v and the shared key k to generate the keystream RC4(v, k)
2. XOR the ciphertext with RC4(v, k) to get <M', c'>
3. Check if c' = c(M')
4. If it matches, accept M' as the transmitted message

📐 Formula: Ciphertext = <M, c(M)> ⊕ RC4(v, k) → The message and its checksum are XORed with the RC4 keystream generated from the IV and shared key.

Defense of WEP

• Integrity Check (IC) field: Used to ensure that a packet has not been modified in transit.
• Initialization Vector (IV): Used to avoid encrypting two ciphertexts with the same key stream; it is used to augment the shared key and produce a different RC4 key for each packet to avoid statistical attacks.

WEP Authentication

WEP Encapsulation Summary:

• Encryption Algorithm = RC4
• Per-packet encryption key = 24-bit IV concatenated to a pre-shared key
• WEP allows IV to be reused with any frame
• Data integrity provided by CRC-32 of the plaintext data (the "ICV")
• Data and ICV are encrypted under the per-packet encryption key

802.11 Authentication Summary:

• Authentication key distributed out-of-band
• Access Point generates a "randomly generated" challenge
• Station encrypts the challenge using the pre-shared secret

🔑 Definition — IV (Initialization Vector): A 24-bit value concatenated to the pre-shared key to create a unique per-packet RC4 key, intended to prevent identical ciphertexts from identical plaintexts.

Security Flaws

• Physical threat: A user loses their 802.11 NIC and doesn’t report it; an attacker with physical possession may access the network.
• Impersonation: 802.11 does not identify users, only NICs. Problems include: a MAC may represent more than one user, multi-user machines are common, users may move between machines, and machines may allow logins by other users within the domain.
• Mutual Authentication: 802.11 shared authentication is not mutual — the client authenticates to the Access Point but the AP does not authenticate to the client. This enables rogue access points and denial of service attacks. Solution: Mutual authentication requiring both sides to demonstrate knowledge of the key.
• Known Plaintext Attack: WEP supports per-packet encryption and integrity but not per-packet authentication. Given a known packet (ARP, DHCP, TCP ACK), it is possible to recover the RC4 stream, enabling spoofing of packets until the IV changes. An attacker can insert a packet, calculate ICV, and encrypt with the known RC4 stream. Solution: Add a keyed message integrity check and change the IV every packet.
• Denial of Service: Disassociation Attacks: 802.11 associate/disassociate messages are unencrypted and unauthenticated, enabling forging of disassociation messages and creating vulnerability to denial of service.
• Dictionary Attacks: WEP keys are derived from passwords, making it much easier to break keys by brute force. An attacker uses a large list of words to guess a password and derive the key.

How to address these issues

Adding new 802.11 authentication methods requires hardware changes for each new method, creating incentive to limit the number of methods supported and making new methods optional. This results in no upgrade path to extended authentication. "Hard coding" authentication methods makes it difficult to respond to security vulnerabilities. The solution is a flexible security framework implemented in upper layers, enabling plug-in of new authentication and key management methods without changing the NIC or Access Point.

How 802.1x Addresses Security Issues of 802.11

802.1x addresses these issues through:

• EAP Framework: Extensible Authentication Protocol
• User Identification & Strong authentication
• Dynamic key derivation
• Mutual authentication
• Per-packet authentication
• Dictionary attack precautions

The system setup and operation of a Robust Security Network (RSN) is described in two cases: when an IEEE 802.1X Authentication Server (AS) is used and when a Pre-Shared Key (PSK) is used. For an ESS (Extended Service Set), the AP includes an Authenticator, and each associated STA includes a Supplicant.

🔑 Definition — 802.1X: An IEEE standard created to control access to any 802 LAN, used as a transport for the Extensible Authentication Protocol (EAP, RFC 2284).

Terminology:

• Supplicant: The entity seeking access (e.g., a wireless station)
• Authenticator: The entity controlling access (typically the AP)
• Authentication Server (AS): The entity that verifies credentials

AKM Operation with AS

Prior to any use of 802.1X, 802.11 assumes the Authenticator and AS have established a secure channel. A STA discovers the AP's security policy through passively monitoring Beacon frames or through active probing. If 802.1X authentication is used, the EAP authentication process starts when the AP's Authenticator sends the EAP-Request or the STA's Supplicant sends the EAPOL-Start message. EAP authentication frames pass between the Supplicant and AS via the Authenticator and Supplicant's Uncontrolled Ports. The Supplicant and AS authenticate each other and generate a PMK (Pairwise Master Key). The PMK is sent from the AS to the Authenticator over the secure channel.

A 4-Way Handshake utilizing EAPOL-Key frames is initiated by the Authenticator to:

1. Confirm that a live peer holds the PMK
2. Confirm that the PMK is current
3. Derive a fresh pairwise transient key (PTK) from the PMK
4. Install the pairwise encryption and integrity keys into IEEE 802.11
5. Transport the group temporal key (GTK) and GTK sequence number from Authenticator to Supplicant and install them in the STA and AP
6. Confirm the cipher suite selection

Upon successful completion, the Authenticator and Supplicant have authenticated each other, and the 802.1X Controlled Ports are unblocked to permit general data traffic.

🔑 Definition — PMK (Pairwise Master Key): A key generated during the EAP authentication process between the Supplicant and AS, which is then sent to the Authenticator to derive session keys.

🔑 Definition — PTK (Pairwise Transient Key): A fresh key derived from the PMK during the 4-Way Handshake, used for encrypting unicast data frames.

Operation of AKM with PSM

When the PMK is a PSK (Pre-Shared Key):

1. A STA discovers the AP's security policy through passively monitoring Beacon frames or active probing
2. A STA associates with an AP and negotiates a security policy
3. The PMK is the PSK
4. The 4-Way Handshake using EAPOL-Key frames is used just as with 802.1X authentication
5. The GTK and GTK sequence number are sent from the Authenticator to the Supplicant, just as in the AS case

IBSS Key usage Model

In an IBSS (Independent Basic Service Set), unicast data frames between two STAs are protected with a pairwise key, which is part of the PTK derived during a 4-Way Handshake. Broadcast/multicast data frames are protected by a key named B1, generated by the STA transmitting the frame. To allow other STAs to decrypt broadcast/multicast frames, B1 must be sent to all other STAs in the IBSS. B1 is sent in an EAPOL-Key frame, encrypted under the EAPOL-Key encryption key (KEK) portion of the PTK, and protected from modification by the EAPOL-Key confirmation key (KCK) portion of the PTK. In an IBSS, a STA's SME (Station Management Entity) responds to Deauthentication frames from a STA by deleting the PTK SA (Security Association) associated with that STA.

🔑 Definition — IBSS (Independent Basic Service Set): A wireless network mode where stations communicate directly with each other without an access point, also known as ad hoc mode.

⭐ Key Takeaways

The most critical points from this lecture are the classification of attacks (passive, active, dictionary building) and the three security goals of 802.11 (access control, data integrity, confidentiality). Students must thoroughly understand the WEP protocol — how it uses RC4 with an IV and shared key for encryption, the authentication challenge-response mechanism, and its critical flaws including IV reuse, lack of mutual authentication, susceptibility to known plaintext attacks, and dictionary attacks. The 802.1x framework with its components (Supplicant, Authenticator, AS), the 4-Way Handshake for deriving PTK from PMK, and the distinction between AS and PSK modes are essential for exam preparation. Finally, the IBSS security model with pairwise keys for unicast and group keys for broadcast/multicast completes the security overview.

🧠 Quick Revision Questions

1. What are the three primary goals of 802.11 security, and how does WEP attempt to achieve each?
2. Describe the WEP encryption process step-by-step. What is the role of the Initialization Vector (IV)?
3. List at least four security flaws in the original 802.11 standard, and explain one solution for each.
4. In the 802.1x framework, what is the difference between AKM operations with an Authentication Server (AS) and with a Pre-Shared Key (PSK)?
5. How does the 4-Way Handshake derive the PTK and GTK, and what is the purpose of each in securing data transmission?

📘 Lecture 30 — QoS in WLAN / Mobile IP

📖 Overview: This lecture addresses the Quality of Service (QoS) limitations inherent in legacy IEEE 802.11 WLANs and introduces the 802.11e standard designed to overcome them through new mechanisms like EDCF and HCF. The second half covers the fundamentals of Mobile IP, enabling seamless mobility for hosts across networks while maintaining their permanent IP addresses.

🗂️ Topics Covered

The lecture begins with QoS limitations of the original 802.11 DCF and PCF modes, then provides an overview of the 802.11e standard including Traffic Categories (TCs) and Access Categories (ACs). It details the Enhanced Distributed Coordination Function (EDCF) and Hybrid Coordination Function (HCF) mechanisms. The second half introduces Mobile IP basics, care-of addresses, the three protocol capabilities (discovery, registration, tunneling), IP-in-IP tunneling, triangle routing inefficiencies, route optimization, and Mobile IPv6 roaming.

📝 Lecture Summary

Last Lecture

The previous lecture covered types of attacks and the goals of 802.11 security including access control, data integrity, and confidentiality. It discussed the WEP Protocol, WEP Authentication, and security flaws in original 802.11. Additional topics included 802.1x Security with AKM operations using both AS and PSK, and the IBSS Security model.

QoS Limitations of 802.11

DCF (Distributed Coordination Function) only supports best-effort services with no guarantee in bandwidth, packet delay, or jitter. It suffers from throughput degradation under heavy load. PCF (Point Coordination Function) has an inefficient central polling scheme with unpredictable beacon frame delay due to incompatible cooperation between Contention Period (CP) and Contention Free Period (CFP) modes. The transmission time of polled stations is unknown.

Overview of 802.11e

The 802.11e task group formed in September 1999, with the QoS baseline document approved in November 2000. The standard aims to support both IntServ and DiffServ models. New QoS mechanisms include EDCF (Enhanced DCF) and HCF (Hybrid Coordination Function). 802.11e is backwardly compatible with DCF and PCF.

💡 Why this matters: 802.11e introduced the first standardized QoS framework for Wi-Fi, enabling networks to prioritize voice and video traffic over data traffic.

QoS is realized by introducing Traffic Categories (TCs) . MSDUs are delivered through multiple backoff instances running as virtual stations, each parameterized with TC-specific parameters: AIFS, CWmin, CWmax, and Persistence Factor (PF) . For legacy DCF, AIFS=DIFS, PF=2, and CWmin<15. The new CW calculation: CWnew[TC] = (CWold[TC]+1) x PF -1.

Rules for Access Categories (ACs) with indices i and j where 0 ≤ i ≤ j ≤ 3: CWmin[i] ≥ CWmin[j], CWmax[i] ≥ CWmax[j], and AIFS[i] ≥ AIFS[j].

Priority Access Gateway Designation:

EDCF (Enhanced DCF)

EDCF is an enhanced version of DCF that supports bursting and uses different parameters for different TC/AC. It replaces DIFS with AIFS (Arbitration Interframe Space) , where AIFS ≥ DIFS. AIFS is shorter for audio and video traffic: Audio = Video < Data. For CWmin and CWmax: Audio < Video < Data. Different Persistence Factor (PF) values are used. For EDCF: AIFS ≥ DIFS, PF ranges from 1 to 16, and CWmin ranges from 0 to 255.

HCF (Hybrid CF)

HCF provides policing and deterministic channel access by controlling the channel through the HC (Hybrid Coordinator) . It can operate in both CFP and CP modes. The HC detects the channel as being idle for PIFS, which is shorter than DIFS, giving the HC high priority over EDCF. The HCF model can provide Guaranteed Services with a much higher probability than pure EDCF. A signaling protocol can be used to facilitate admission control and specify service rate requirements.

Mobile IP: Basics

Mobile IP was proposed by the IETF (Internet Engineering Task Force) , the standards development body for the Internet. Mobile IP allows a mobile host to move about without changing its permanent IP address. Each mobile host has a home agent on its home network. The mobile host establishes a care-of address when it's away from home.

A correspondent host is a host that wants to send packets to the mobile host. The correspondent host sends packets to the mobile host's permanent IP address. These packets are routed to the mobile host's home network. The home agent forwards IP packets for the mobile host to the current care-of address. The mobile host sends packets directly to the correspondent, using its permanent home IP as the source IP.

🔑 Definition — Mobile IP: A protocol that allows mobile hosts to move between networks while maintaining the same permanent IP address.

Mobile IP: Care-of Addresses

Whenever a mobile host connects to a remote network, two choices exist for the care-of address:

1. The address of a foreign agent on the remote network, where the foreign agent delivers packets forwarded from the home agent to the mobile host.
2. A temporary, foreign IP address obtained through DHCP, where the home agent tunnels packets directly to the temporary IP address.

Regardless of the choice, the care-of address must be registered with the home agent.

📌 Example: A mobile node moves from its home network (192.168.1.0/24) to a foreign network (10.0.0.0/24). It acquires a care-of address of 10.0.0.5 (either from a foreign agent or via DHCP) and registers this with its home agent (192.168.1.1). Packets sent to the mobile's permanent address (192.168.1.100) are intercepted by the home agent and tunneled to 10.0.0.5.

Protocol

Mobile IP includes three capabilities:

1. Discovery: Mobile Agents send ICMP router advertisements with mobility agent advertisement extensions periodically, informing mobile nodes of their presence. The mobile node is responsible for the discovery process and may optionally request an advertisement from an agent.

2. Registration: The mobile node recognizes it is on a foreign network, acquires a Care-of-Address, and requests its home agent to forward its data packets to the foreign agent. Registration requires 4 steps:

   • Mobile node sends registration request to the foreign agent
   • Foreign agent relays request to the home agent
   • Home agent accepts or denies and sends registration reply to the foreign agent
   • Foreign agent relays reply to the mobile node

3. Tunneling: After registration, an IP tunnel is set up between the home agent and the care-of address. The home agent broadcasts a gratuitous ARP request causing all nodes in the subnet to update their ARP caches to map the mobile node's IP address to the home agent's link-level address. The home agent forwards packets to the foreign agent through the IP tunnel. In the foreign network, decapsulation is done by the foreign agent or the mobile node itself. The correspondent node assumes replies come from the home network and continues sending packets to the home agent.

IP-in-IP Tunneling

The packet to be forwarded is encapsulated in a new IP packet. In the new header:

• Destination = care-of address
• Source = address of home agent
• Protocol number = IP-in-IP

📐 Formula: IP-in-IP Encapsulation: Original IP packet → new IP header (dest: COA, src: HA) + original IP packet → tunneled to care-of address.

Triangle Routing (Mobile IPv4)

Triangle routing occurs when packets from the correspondent host go through the home agent, which then tunnels them to the mobile node's care-of address, while the mobile node sends replies directly back to the correspondent. This creates routing inefficiency, as packets must travel an extra hop through the home network.

💡 Why this matters: Triangle routing introduces unnecessary delay and network load, especially when the correspondent and mobile node are geographically close while the home agent is far away.

Routing Inefficiency

The triangle routing problem creates significant inefficiency because:

• Packets travel longer paths than necessary
• The home agent becomes a bottleneck
• Latency increases for all communications

Route Optimizations

Possible Solution: The home agent sends the current care-of address to the correspondent host, which caches the care-of address. Future packets are tunneled directly to the care-of address. However, this introduces a cache consistency problem — the cached care-of address becomes stale when the mobile host moves. Additionally, there are potential security issues with providing the care-of address to the correspondent host.

Mobile IPv6 Roaming

Mobile IPv6 provides improved mobility support compared to MIPv4, with better route optimization built into the protocol design rather than as an add-on. IPv6's larger address space and built-in security features help address some of the limitations found in Mobile IPv4.

⭐ Key Takeaways

Students must understand that legacy 802.11 DCF and PCF have fundamental QoS limitations — DCF only provides best-effort service with no guarantees, while PCF suffers from inefficient polling and unpredictable delays. The 802.11e standard addresses these issues through EDCF (prioritized channel access using AIFS, CWmin/max, and PF parameters per traffic category) and HCF (deterministic channel access via the Hybrid Coordinator using PIFS). For Mobile IP, the three core protocol capabilities are discovery (agent advertisements), registration (four-step process via foreign agent), and tunneling (IP-in-IP encapsulation). Triangle routing is a key inefficiency in Mobile IPv4, where packets go through the home agent even when the correspondent could send directly, and route optimization attempts to solve this but introduces cache consistency and security challenges.

🧠 Quick Revision Questions

1. What are the three QoS limitations of DCF and the three limitations of PCF in legacy 802.11?
2. What are the four Access Categories in 802.11e and what are their relative priorities for AIFS, CWmin, and CWmax?
3. Describe the formula for calculating CWnew[TC] in 802.11e and explain the role of the Persistence Factor.
4. What are the four steps involved in the Mobile IP registration process, and which entities participate in each step?
5. Explain triangle routing in Mobile IPv4 and identify two problems with the route optimization solution that caches care-of addresses at correspondent hosts.

📘 Lecture 31 — Wireless Mesh Networks

📖 Overview: This lecture introduces Wireless Mesh Networks (WMNs), a self-organizing, self-configuring network architecture that extends wireless coverage and integrates with existing networks. It covers WMN characteristics, compares WMNs with MANETs, explains the three primary architectures (infrastructure, client, hybrid), and discusses applications and critical performance factors.

🗂️ Topics Covered

The lecture begins with an introduction to WMN components and characteristics, then contrasts WMNs with MANETs across key dimensions like backbone structure and mobility. It details the three WMN architectures—infrastructure/backbone, client, and hybrid—and explores applications including broadband home, community, and enterprise networking. The lecture concludes with critical factors influencing WMN performance such as radio techniques, scalability, and security.

📝 Lecture Summary

Introduction

Wireless Mesh Networks (WMNs) are comprised of mesh routers and mesh clients. Mesh clients not only work as hosts but also perform routing for multi-hop destinations. Mesh routers support bridge/gateway functionalities, enabling integration of WMNs with existing wireless networks such as cellular, WSN, WiMAX, etc. A WMN is dynamically self-organized and self-configured. Conventional nodes (e.g., PC, PDA, PocketPC, phones) equipped with a wireless NIC can connect directly to mesh routers; without a wireless NIC, an Ethernet connection is also possible. Thus, WMN will allow always-on-line anywhere anytime. It is gaining interest as a possible way for ISPs and can be deployed incrementally as needed. Deploying WMN is not difficult because most components/protocols are readily available (e.g., IEEE 802.11, WEP), however, scalability in existing protocols is a great concern.

Characteristics

WMNs have several key characteristics:

• Multi-hop: To extend the coverage range of wireless networks without sacrificing channel capacity and for non-line-of-sight.
• Support for ad hoc networking: Due to flexible architecture, easy deployment and configuration, fault tolerance, and mesh connectivity. This includes low up-front investment requirements.
• Mobility dependence on type of mesh nodes: Mesh routers usually have minimal mobility, while mesh clients can be stationary or mobile.
• Multiple type of network access: Both backhaul access to the internet and P2P communication are supported. Integration of WMN with other wireless networks allows end-users access to WMN.
• Dependence of power-consumption constraints on the type of mesh nodes.
• Compatibility and interoperability with existing wireless networks: A WMN based on IEEE 802.11 should support both mesh clients and Wi-Fi clients and be interoperable with other networks.

WMNs vs MANET

WMNs are considered ad hoc due to lack of infrastructure (AP/BS). Although ad hoc techniques like MANET are required, WMNs require more sophisticated algorithms and design principles. WMN diversifies the capabilities of ad hoc, making MANET a subset of WMNs. Differences include:

• Wireless Backbone: Mesh routers form a wireless backbone providing more coverage, connectivity, and robustness. In MANET, individual nodes are routers, making the network unreliable.
• Integration: WMN supports clients that use the same radio technology, accomplished through a host-routing function in the mesh router. Users of one network can enjoy services of another network.
• Dedicated routing and configuration: In MANET, each host performs routing and configurations; in WMN, this is done by mesh routers, decreasing the load on end-users.
• Multiple radios: WMNs use two radios—one for routing/configuration between mesh routers, and a second for network access by end-users. In MANET, these functions are performed on the same channel, significantly degrading performance.
• Mobility: Hosts working as routers in MANET make it more challenging, whereas the mobility of mesh routers is very limited.

🔑 Definition — MANET subset of WMNs: MANETs are a subset of WMNs because WMNs require more sophisticated algorithms and have diversified capabilities beyond simple ad hoc networking.

Architecture

Mesh Router

A mesh router supports routing functions for mesh networking in addition to conventional gateway/repeater functions. It is equipped with multiple interfaces built on either the same or different wireless access technologies. It achieves the same coverage as other wireless routers with less energy consumption through multi-hop routing. MAC protocols are enhanced with better scalability in a multi-hop mesh environment. Examples of mesh routers are based on embedded systems like PowerPC and Advanced Risc Machines (ARM).

Mesh Clients

Mesh clients also have necessary functions for routing in mesh networking; however, gateway or bridge functions do not exist. They usually have a single interface. Examples of mesh clients include laptops, PDAs, Wi-Fi IP Phones, and Wi-Fi RFID Readers.

Infrastructure/Backbone WMNs

This architecture is built using various wireless technologies in addition to 802.11. With gateway functions, a mesh router can connect to the internet. Infrastructure meshing allows integration of different networks. If a client has a different technology, it can connect through a BS, and the BS connects via Ethernet. This is the most common type. For example, community and neighborhood networks can be built where mesh routers are placed on rooftops, serving as access points for users inside houses and along roads. They typically have two types of radios: one long-range for the backbone and one short-range for end-users.

Clients WMNs

Client meshing provides a P2P network among client devices. No mesh router is required. Clients in this architecture require more functionalities for configuration and routing. It is typically formed using a single radio.

Hybrid WMNs

This is a combination of infrastructure and client meshing and is the most applicable/practical scenario.

Application scenario

Research and development in WMNs is motivated by several applications:

• Broadband home networking: A WLAN is not practical because an AP leaves dead zones, and multiple APs require a backbone network or access hub. Dead zones can be eliminated with multiple routers and adjusting their transmission power.
• Community and neighborhood networking: The common architecture uses cable or DSL through the internet, which has drawbacks: all traffic must flow through the internet, dead zones exist, services between end-users cannot be shared, and there is a single path for internet and neighborhood users.
• Enterprise networking: WMNs are scalable with enterprise growth.
• Other applications: Transportation systems (extending access into buses, trains, ferries; remote monitoring of in-vehicle security video), building automation, health and medical systems, and security surveillance systems.

Critical factors influencing network performance

• Radio techniques: Includes directional and smart antennas, MIMO systems, multi-radio chipsets, and more advanced techniques like reconfigurable and cognitive radios. These require revolutionary design changes in higher layers.
• Scalability: Multihop routing is common in WMN, which degrades performance. IEEE 802.11 MAC is not scalable, and throughput significantly reduces as the number of hops increases to 4 or higher.
• Mesh connectivity: Network self-organization and topology control algorithms are needed.
• Broadband and QoS: Most applications of WMN are broadband services with various QoS requirements, which differs from ad hoc networks.
• Compatibility and inter-operability: Network access must be provided to both conventional and mesh clients.
• Security: There is no centralized control.
• Ease of use.

⭐ Key Takeaways

WMNs use mesh routers as a dedicated wireless backbone to enhance coverage, robustness, and reliability, unlike the unreliable node-based routing in MANETs. The architecture can be infrastructure-based (most common, using two radios for backbone and users), client-based (P2P, no routers), or hybrid. WMNs provide significant advantages over basic WLANs by eliminating dead zones and supporting incremental deployment, but they face critical challenges including poor scalability of IEEE 802.11 MAC (throughput drops significantly beyond 4 hops), the need for advanced radio techniques, and security concerns due to no centralized control.

🧠 Quick Revision Questions

1. What are the two main components of a Wireless Mesh Network, and what are their key roles?
2. How does mobility differ between mesh routers and mesh clients in a WMN?
3. List three key differences between WMNs and MANETs regarding backbone, routing, and radios.
4. What are the three types of WMN architectures, and which is the most practical?
5. Name three critical factors that influence the performance of a Wireless Mesh Network.

📘 Lecture 32 — Wireless Mesh Networks Part II

📖 Overview: This lecture continues the study of Wireless Mesh Networks (WMNs), focusing on the critical challenges and solutions at the MAC and Network layers. It examines scalability issues, single versus multi-channel MAC protocols, routing requirements and optimization criteria, cross-layer design, fairness problems, and existing WMN standards, providing a comprehensive view of how these networks operate efficiently.

🗂️ Topics Covered

The lecture covers MAC layer challenges including scalability, single channel and multi-channel approaches, and open research issues. It then delves into the network layer, discussing routing protocols, a wish list for ideal routing, optimization criteria, fairness, and cross-layer design. Finally, it addresses QoS support required at every layer and presents WMN standards like IEEE 802.16a and 802.11s.

📝 Lecture Summary

MAC Layer

The MAC layer for WMNs must handle more than one-hop communication in a distributed and cooperative manner, supporting multipoint-to-multipoint communication. Network self-organization is needed, and mobility affects performance. Scalability can be addressed by either enhancing single-channel approaches to increase end-to-end throughput or allowing multiple channels per node. 🔑 Definition — Scalability: The ability of a MAC protocol to maintain performance as the number of nodes in the network increases.

Basic MAC techniques are divided into Scheduled (e.g., fix scheduled TDMA, polling) which are often impractical due to lack of central coordination and time synchronization, and Random Access (e.g., CSMA, RTS/CTS). Channels can be implemented via FDMA, CDMA (where code assignment is an issue), SDMA with directional antennas, or combinations thereof.

Single channel MAC

Approaches to improve single-channel MAC include: modifying parameters of CSMA/CA based MACs like contention window size and backoff procedures for multi-hop; cross-layer design with advanced physical layers like directional antenna and power control; and innovative new solutions like TDMA or CDMA based MACs. Compatibility, cost, and complexity are key design factors. Contention-based approaches are not scalable, and throughput degrades with increased contention.

MAC – Multichannel

Multi-channel approaches increase network capacity by using multiple channels of bandwidth B. A Multi-Channel Coordination Layer (MCCL) can be introduced between the MAC and Network layers to work within 802.11 constraints and increase capacity.

Three types of multi-channel MAC exist:

1. Multi-channel single transceiver: One active channel at a time; coordination is required as different nodes may operate on different channels at different times.
2. Multi-channel multi-transceiver: A single radio has multiple parallel RF chips and baseband modules to support several simultaneous channels, with a single MAC coordinating operations.
3. Multi-radios MAC: A node has multiple radios, each with its own MAC and physical layer; a virtual MAC protocol like Multi-radio Unification Protocol (MUP) coordinates communication among all.

MMAC functions include: maintaining a data structure of all channels (classified by allocation status), negotiating channels during the Ad hoc Traffic Indication Message (ATIM) window on a predefined common channel, and selecting the channel with the lowest count of source-destination pairs.

Multi-radio Unification Protocol (MUP) functions include: discovering neighbors and classifying them as MUP-enabled or legacy; selecting a NIC based on one-hop round trip time (RTT) measurements (choosing the shortest RTT); utilizing the selected NIC for a random period (10-20 seconds); and switching channels after that period if another NIC shows a certain quality improvement.

Open research issues remain: scalability in multi-hop ad hoc networks is unsolved; CSMA/CA solves only partial problems; a distributed TDMA or CDMA MAC may be a solution; mesh routers and clients have different characteristics (mobility, power); a single solution may not work for both; bridging functions are needed for routers integrating multiple technologies; and MAC must be developed with QoS metrics for broadband multimedia communication.

Network Layer

WMNs are tightly coupled with the internet, but their routing differs from IP and cellular routing.

Routing finds and maintains routes for data flows. The entire performance of the WMN depends on the routing protocol, which may be the main product of a mesh company.

🔑 Routing – Wish List: An ideal routing protocol should include scalability (low overhead, especially in mobile WMNs), fast route discovery and rediscovery (essential for reliability), mobile user support (seamless handover), flexibility (work with/without gateways and different topologies), QoS support (satisfying specified criteria), and multicast support (important for applications like emergency response).

Existing Routing Protocols include Internet routing protocols (e.g., OSPF, BGP, RIPv2) which are well-known but assume seldom link changes and are unsuitable without modifications. Ad-hoc routing protocols (e.g., DSR, AODV, OLSR, CBR, TORA) are designed for high rates of link changes and perform well on WMNs, but may be further optimized.

Routing - Optimization Criteria

Routes can be optimized based on several criteria, individually or in combination: 📐 Formula: Minimum Hops → shortest path 📐 Formula: Minimum Delays → path with least latency 📐 Formula: Maximum Data Rates → path with highest bandwidth 📐 Formula: Minimum Error Rates → path with fewest errors 📐 Formula: Maximum Route Stability → path that is likely to last longest 📐 Formula: Power Consumption → path that uses least energy Other criteria include use of multiple routes to the same gateway or use of multiple gateways.

Routing – Cross-Layer Design

Cross-layer design integrates routing with other layers:

• Routing – Physical: Link quality feedback helps select stable, high-bandwidth, low-error routes. Fading signal strength can signal a link about to fail, enabling preemptive route requests. Cross-layer design is essential for smart antennas.
• Routing – MAC: Feedback on link loads can avoid congested links, enabling load balancing. Channel assignment and routing depend on each other. MAC detection of new neighbors and failed routes improves routing performance.
• Routing – Transport: Choosing low-error-rate routes improves TCP throughput, especially with multiple routes. Freezing TCP when a route fails is helpful.
• Routing – Application: Especially important for satisfying QoS constraints.

Network Layer - Fairness

Fairness provides an equal share of resources to all participants and is a special case of priority-based QoS.

• Horizontal fairness (between nodes 1 and 2): Ensured by the MAC layer.
• Vertical fairness (between nodes 3 and 4, where node 3 is further from the gateway): The MAC layer is no longer sufficient because nodes closer to the gateway have an inherent advantage. 💡 Why this matters: In a multi-hop WMN, nodes closer to the gateway can starve nodes farther away, as local MAC fairness does not account for multi-hop traffic flows.

Fairness Problem: Nodes closer to the gateway (e.g., node 2) get excessive throughput, while node 3, which is one hop further, gets very little throughput, even though the MAC layer appears fair.

QoS Support required at every layer

QoS must be supported at every layer:

• Physical Layer: Requires robust modulation and link adaptation.
• MAC Layer: Must offer priorities and guarantees (bandwidth, delay).
• Network Layer: Must select "good" routes, offer priorities, and reserve resources for guarantees.
• Transport: Attempts end-to-end recovery when possible.
• Application: Negotiates end-to-end and with lower layers, adapting to changes in QoS.

WMNs Standards

Key standards include:

• WPAN: Bluetooth, Zigbee
• WiFi: 802.11a, b, g, n
• WiMAX: 802.16

IEEE 802.16a WMAN Mesh: Defines a "mesh mode" in addition to point-to-multipoint (PMP) mode. It operates in licensed and unlicensed frequencies of 2–11 GHz, allows non-line-of-sight (NLOS) communications, and spans up to a 50 km range, supporting multihop communications.

802.11s WLAN Mesh: Extends the MAC layer to a wireless Distribution System (DS) to support broadcast/multicast, adds multi-hop capability to 802.11g/a/b, and features auto-configuration on power up, multi-channel multi-radio operation, topology discovery, MAC path selection protocol, and modified forwarding for QoS and mesh control.

802.11s MCF Sublayer: The Mesh Coordination Function (MCF) sublayer is part of the 802.11s standard.

⭐ Key Takeaways

The critical points from this lecture are that WMN MAC protocols face scalability issues, which can be addressed through single-channel enhancements or multi-channel approaches like MMAC and MUP. Network layer routing must be optimized not just for hops but for cross-layer metrics like link quality and load, and must ensure both horizontal and vertical fairness, as nodes closer to gateways can starve others. Finally, QoS must be supported at every layer from physical to application, and protocols like 802.16a and 802.11s are key standards for implementing WMNs.

🧠 Quick Revision Questions

1. What are the two main approaches to addressing scalability in the MAC layer for WMNs?
2. Describe the three different types of multi-channel MAC architectures (single transceiver, multi-transceiver, multi-radio) and a key challenge for each.
3. What is the "fairness problem" in WMNs and why is the MAC layer alone insufficient to solve it?
4. List the five layers at which QoS support is required in a WMN and give one example of a QoS mechanism for each.
5. What is the role of the Multi-radio Unification Protocol (MUP) and how does it select a Network Interface Card (NIC)?

📘 Lecture 33 — TCP over Wireless Networks

📖 Overview: This lecture addresses the fundamental challenges of running TCP over wireless networks, where packet loss is often due to transmission errors or mobility rather than congestion. It explores various TCP variants designed to improve performance in wireless environments and categorizes the primary approaches for adapting TCP to heterogeneous wireless networks.

🗂️ Topics Covered

The lecture covers the motivation for TCP modifications in wireless networks, details of TCP variants including Slow Start and Fast Retransmit/Recovery (TCP Reno), the specific issues in heterogeneous wireless networks, and four major categories of TCP schemes for wireless: Pure Link-level Approaches, Soft-state Transport Layer Caching Approaches (including Snooping TCP), Soft-state Cross Layer Signaling Approaches (including ECN, EBSN, ELN), and Hard-state Transport Layer Approaches (including Indirect TCP, Mobile TCP, Wireless TCP, ATP, and ATCP).

📝 Lecture Summary

Motivation

Traditional TCP was designed for fixed, wired networks with characteristics including window-based control, slow-start, loss-based congestion indication, and dependence on ACKs. Wireless networks present fundamentally different conditions: lack of infrastructure in ad hoc networks, mobility, shared channels, and limited bandwidth. Packet loss in fixed networks is typically due to overload and detected via retransmission timeout (RTO), three duplicate ACKs, or ICMP source quench messages. Routers discard packets when buffers are full, and TCP recognizes congestion only indirectly through missing acknowledgements. Retransmissions during congestion worsen the problem.

💡 Why this matters: Directly applying wired TCP to wireless networks causes severe performance degradation because TCP misinterprets wireless transmission errors as congestion signals.

🔑 Definition — TCP congestion control: A mechanism where the sender detects packet loss (assumed due to congestion) and reacts by reducing its transmission rate.

TCP Slow Start

The sender calculates a congestion window for a receiver. The process begins with a congestion window size equal to one segment, then an exponential increase of the congestion window up to the congestion threshold, followed by a linear increase. A missing acknowledgement causes reduction of the congestion threshold to one half of the current congestion window. The congestion window then starts again with one segment.

📐 Formula (implicit): Congestion window (cwnd) increases exponentially until threshold, then linearly; on loss, threshold = cwnd/2, cwnd = 1.

📌 Example: If cwnd starts at 1 segment and threshold is 16, the sender sends 1 segment, then 2, then 4, then 8, then 16 (exponential increase). After reaching 16, it increases linearly (17, 18, etc.). If a loss occurs at cwnd=20, threshold becomes 10 and cwnd resets to 1.

TCP Fast Retransmit/Recovery (TCP Reno)

TCP sends an acknowledgement only after receiving a packet. If a sender receives several acknowledgements for the same packet, this indicates a gap in received packets at the receiver. The receiver has received all packets up to the gap and is still receiving packets, so packet loss is not due to congestion. When packet loss occurs, congestion window size is reduced: due to timeout, cwnd = 1 and enter slow start; due to duplicate ACKs, cwnd = cwnd/2 + 3 × segment_size. Congestion window size is increased when data is successfully acknowledged.

🔑 Definition — Fast Retransmit/Recovery: A TCP mechanism that detects packet loss via duplicate ACKs (not timeout) and reduces the congestion window less drastically than slow start (halving rather than resetting to 1).

Issues in Heterogeneous Wireless Networks

Key challenges include:

• Bit Error Rate (BER): 10⁻³ or worse possible upon change in wireless environment
• Bandwidth: Very less compared to wired networks; TCP underestimates bandwidth in wireless networks
• Round Trip Time (RTT): Wireless media exhibits longer latencies due to long distances or NLOS path; large variation in RTT
• Mobility: Addition of mobile devices introduces huge amounts of indeterminate delay
• Power consumption

Influences of BER/mobility on TCP: TCP assumes congestion if packets are dropped, which is typically wrong in wireless networks where packet loss is often due to transmission errors. Mobility itself can cause packet loss when a mobile node roams between access points with packets still in transit. The performance of unchanged TCP degrades severely. However, TCP cannot be changed fundamentally due to the large base of installation in the fixed network.

💡 Why this matters: Distinguishing between congestion loss, error loss, delay beyond retransmission timer threshold, and out-of-order delivery beyond the three DUPAK threshold is critical for wireless TCP performance.

TCP Schemes for Wireless — Classification

The various approaches revolve around distinguishing between:

• Congestion loss
• Error loss
• Delay beyond the retransmission timer threshold
• Out-of-order delivery beyond the three DUPAK threshold

Classification categories: Pure Link-level Approaches, Soft-state Transport Layer Caching Approaches, Soft-state Cross Layer Signaling Approaches, and Hard-state Transport Layer Approaches.

Pure Link-level Approaches

These approaches aim at hiding the unwanted characteristics of the wireless links from the higher layers. Reliable link-level protocols are implemented on the wireless link which perform local retransmissions independent of the higher-level protocols. These protocols employ techniques such as forward error correction (FEC) for error control and automatic repeat request (ARQ) for retransmission of lost packets. The timeout value for local retransmissions is of major concern — interaction between link-level retransmission timeouts and transport-level timeouts can lead to degraded performance if not properly selected.

🔑 Definition — Pure Link-level Approaches: Methods that hide wireless link characteristics from higher layers by implementing reliable local retransmissions at the link level.

Soft-state Transport Layer Caching Approaches — Snooping TCP

Snoop involves modification of the network layer (IP) software at the base station (BS) by adding a module called snoop. It provides transparent extension of TCP within the BS/FA with buffering of packets sent to the mobile host. Lost packets on the wireless link (both directions) will be retransmitted immediately by the mobile host or foreign agent (local retransmission). The foreign agent "snoops" the packet flow and recognizes acknowledgements in both directions, filtering ACKs.

Data transfer to the mobile host: FA buffers data until it receives ACK of the MH; FA detects packet loss via duplicated ACKs or time-out with fast retransmission possible, transparent for the fixed network.

Data transfer from the mobile host: FA detects packet loss on the wireless link via sequence numbers; FA answers directly with a NACK to the MH; MH can retransmit data with very short delay.

Advantages: Maintains end-to-end semantics, no change to correspondent node, no major state transfer during handover.

Problems: Snooping TCP does not isolate the wireless link well; snooping might be useless depending on encryption schemes.

🔑 Definition — Snooping TCP: A soft-state approach where a base station module buffers packets and performs local retransmissions transparently to the fixed network.

Soft-state Cross Layer Signaling Approaches

• Explicit Congestion Notification (ECN): Extension to Random Early Detection (RED); marks a packet instead of dropping when the average queue size is between minth and maxth. Upon receipt of a congestion-marked packet, the TCP receiver informs the sender about incipient congestion, triggering the congestion avoidance algorithm.
• Explicit Bad State Notification (EBSN): Proposes a mechanism to update the TCP timer at the source to prevent the source from decreasing its congestion window. EBSNs are sent to the source after every unsuccessful attempt by the base station to transmit packets over the wireless link. EBSN cancels previous timeouts and puts new timeouts in place based on existing estimates of RTT and variance.
• Explicit Loss Notification (ELN): Adds an ELN option to TCP ACKs. When a packet is dropped on wireless networks, future cumulative acknowledgements corresponding to the lost packet are marked to identify that a non-congestion-related loss has occurred.

🔑 Definition — Explicit Congestion Notification (ECN): A signaling mechanism where routers mark packets instead of dropping them to indicate incipient congestion.

Hard-state Transport Layer Approaches — Indirect TCP (I-TCP)

Indirect TCP or I-TCP segments the connection. No changes to the TCP protocol for hosts connected to the wired Internet; optimized TCP protocol for mobile hosts. The splitting of the TCP connection occurs at the foreign agent into 2 TCP connections, with no real end-to-end connection any longer. Hosts in the fixed part of the net do not notice the characteristics of the wireless part.

Advantages: No changes in the fixed network necessary; all current optimizations to TCP still work; transmission errors on the wireless link do not propagate into the fixed network; simple to control; mobile TCP is used only for one hop between foreign agent and mobile host; very fast retransmission possible.

Disadvantages: Loss of end-to-end semantics — an acknowledgement to a sender no longer means a receiver really got a packet; foreign agents might crash; higher latency possible due to buffering and forwarding to a new foreign agent.

Wireless TCP (WTCP)

Preserves the end-to-end semantics. This protocol tries to distinguish random losses from congestion losses by measuring packet inter-arrival time with packet inter-departure time. WTCP uses rate-based rather than window-based transmission control, shaping its data traffic and never allowing a burst of packet transmissions. It is fair when competing connections have different round-trip times.

Mobile TCP (M-TCP)

Special handling of lengthy and/or frequent disconnections with low BER links. M-TCP splits as I-TCP does: unmodified TCP from fixed network to supervisory host (SH), optimized TCP from SH to MH. The supervisory host monitors all packets, no caching, no retransmission. If disconnection is detected, it sets the sender window size to 0, causing the sender to automatically go into persistent mode. Old or new SH reopen the window.

Advantages: Maintains semantics, supports disconnection, no buffer forwarding. Disadvantages: Loss on wireless link propagated into fixed network; adapted TCP on wireless link.

Ad Hoc Transport Protocol (ATP)

Features include: layer coordination using feedback from network nodes for congestion detection, avoidance, and control; rate-based transmissions to avoid the impact of bursty traffic; decoupling of congestion control and reliability (congestion control uses network feedback, reliability uses receiver feedback and selective ACK); assisted congestion control adapting sending rate based on feedback from intermediate nodes; TCP friendliness and fairness achieved through feedback, though fairness remains an issue.

ATCP Approach

ATCP utilizes network layer feedback from intermediate nodes to take appropriate actions. Network feedback includes: ICMP (Destination Unreachable message indicates route disruption) and ECN (indicates network congestion). With ECN enabled, timeout and 3 duplicate ACKs are assumed to no longer be due to congestion.

Transport Layer Challenges

New transport layer protocols need to be developed that avoid the shortcomings of TCP while being compatible with it. Transport layer protocols for supporting real-time traffic in wireless meshes are desirable. Integration of transport layer with other layers is needed, as is inferring and reacting with respect to observations at other layers. The impact of mobility on transport layer must be addressed.

⭐ Key Takeaways

The single most critical concept is that standard TCP assumes all packet loss is due to congestion, which is fundamentally wrong in wireless networks where loss comes from transmission errors and mobility. Students must understand the four categories of wireless TCP schemes: Pure Link-level (hiding wireless characteristics), Soft-state Caching (snooping approaches maintaining end-to-end semantics), Soft-state Cross Layer Signaling (ECN, EBSN, ELN for explicit notification), and Hard-state (I-TCP splitting the connection, sacrificing end-to-end semantics). The key trade-off is between maintaining end-to-end semantics and effectively isolating the wireless link. Snooping TCP and I-TCP represent opposite ends of this spectrum. Finally, the lecture emphasizes that any solution must remain compatible with the existing TCP installed base in the fixed Internet.

🧠 Quick Revision Questions

1. Why does standard TCP perform poorly in wireless networks, and what specific characteristics of wireless networks cause this degradation?
2. What is the difference between TCP Slow Start and Fast Retransmit/Recovery in terms of congestion window adjustment after packet loss?
3. How does Snooping TCP maintain end-to-end semantics while performing local retransmissions at the base station?
4. What are the three explicit notification mechanisms (ECN, EBSN, ELN) and how does each help distinguish congestion loss from error loss?
5. What is the fundamental trade-off between Indirect TCP (I-TCP) and approaches that maintain end-to-end semantics?

📘 Lecture 34 — Wireless Sensor Networks Part I

📖 Overview: This lecture introduces Wireless Sensor Networks (WSNs), a class of ad hoc networks composed of densely deployed, self-organizing sensor nodes. It covers the fundamental architecture, key applications across military, environmental, health, and commercial domains, the critical factors influencing WSN design (fault tolerance, scalability, power, cost), and the unique protocol stack challenges that differentiate WSNs from traditional networks.

🗂️ Topics Covered

This lecture begins with an introduction to WSNs, defining a sensor node and comparing sensor networks to traditional ad hoc networks. It then explores diverse applications in military, environmental, health, home, and commercial settings. Core design factors such as fault tolerance, scalability, production costs, hardware constraints, topology, and power consumption are detailed. The communication architecture, including the protocol stack and the roles of the application, transport, network, and data link layers, is explained. Finally, the lecture outlines major challenges in WSNs, including cross-layer design, topology control, and data aggregation, before introducing TinyOS as a simulation and development platform.

📝 Lecture Summary

Introduction to WSNs

A sensor network is composed of a large number of sensor nodes densely deployed either inside the phenomenon or very close to it. Its key features are random deployment, self-organizing capabilities, cooperative capabilities, and local computation.

A sensor is a small-sized, low-power, low-cost Micro-Electro-Mechanical Systems (MEMS) device capable of sensing, computing, and communicating. A typical sensor node might have an 8 MHz processor, 512K bytes of flash, 8k bytes of SRAM, a radio frequency of 916 MHz/2.4 GHz (ISM band), a data rate of 40 Kbits/Sec, a radio range of 100 feet, and power from 2 AA batteries. 💡 Why this matters: These severe hardware constraints define every aspect of WSN protocol design.

Sensor networks VS ad hoc networks

Key differences include:

• Scalability: The number of nodes in a sensor network can be several orders of magnitude higher than in an ad hoc network.
• Deployment: Sensor nodes are densely deployed.
• Failure Rate: Sensor nodes are prone to failures.
• Highly Dynamic topology: Topology changes very frequently.
• Communication Paradigm: Sensor nodes mainly use broadcast, while most ad hoc networks are based on point-to-point (p2p) communication.
• Power Limitation: Sensor nodes are severely limited in power, computational capacities, and memory.
• Unique IDs: Sensor nodes may not have a global ID.

Applications of sensor networks

• Military: Monitoring friendly forces, battlefield surveillance, reconnaissance, battle damage assessment, and nuclear/biological/chemical attack detection.
• Environmental: Forest fire detection, biocomplexity mapping, flood detection, and precision agriculture.
• Health: Telemonitoring of physiological data, tracking patients/doctors in hospitals, and drug administration.
• Home: Home automation and smart environments.
• Commercial: Environmental control in buildings, interactive museums, inventory control, vehicle tracking, and car theft detection.

Factors influencing sensor network design

• Fault tolerance: The ability to sustain network functionalities without interruption due to sensor node failures.
• Scalability: Measures the density of sensor nodes. The formula is: 📐 Formula: Density = μ(R) = (NπR²)/A, where N is the number of nodes, R is the radio range, and A is the area.
• Production costs: The cost of a single node is critical to justify the overall network cost.
• Hardware constraints: Nodes have limited computational capacity, memory, and power.
• Sensor network topology: Consists of three phases: pre-deployment/deployment, post-deployment, and re-deployment of additional nodes.
• Power consumption: A fundamental constraint. Communication is the most energy-intensive activity. 📌 Example: 3000 instructions can be executed for the same energy cost of sending a bit 100m by radio.
• Environment: WSNs must operate in diverse and harsh environments like busy intersections, oceans, tornados, or chemically contaminated fields.

Communication architecture of sensor networks

• Protocol Stack: The stack is managed by three planes:
  • Power Management Plan: Turns off the receiver after a message to avoid duplicates and conserve energy; informs neighbors of low battery.
  • Mobility Management Plan: Detects and registers node movement to maintain routes and track neighbors.
  • Task Management Plan: Balances and schedules sensing tasks in a region to conserve power.
• Application layer: Uses protocols like Sensor Management Protocol (SMP), Task Assignment and Data Advertisement Protocol (TADAP), and Sensor Query and Data Dissemination Protocol (SQDDP).
• Transport layer: Needed for Internet/external network access, but remains an open research area with few proposed schemes.
• Network layer: Focuses on power efficiency, data-centric routing, attribute-based addressing, and location awareness. Routing protocols include:
  • Maximum Available Power (PA) route: Route 2
  • Minimum Energy (ME) route: Route 1
  • Minimum Hop (MH) route: Route 3
  • Maximum minimum PA node route: Route 3
  • Minimum longest edge route: Route 1
• Data link layer: Responsible for Medium Access Control (MAC) and error control.
  • MAC creates the network infrastructure and shares resources fairly.
  • Power saving modes are energy efficient only if the time spent in that mode exceeds a threshold.
  • Error control uses Forward Error Correction (FEC) (low-complexity codes preferred) and Automatic Repeat Request (ARQ).

Challenges in WSN

• Cross-layer approach: A grand challenge, as the traditional layered approach is good for abstraction but bad for energy efficiency and performance in WSNs.
• Topology Control
• Coverage
• Data Aggregation
• Temporal/Spatial Correlation
• Localization / Synchronization
• Energy Efficient Data Dissemination
• QoS Framework
• Network Monitoring and Management
• Integration into Next-Generation Wireless Internet (NGWI)

Simulation for Sensor Networks

Simulation provides a controlled, reproducible testing environment and is a cost-effective alternative for exploring and improving design space.

TinyOS

TinyOS is an open-source operating system designed for WSNs. It promotes reliable application development by providing a convenient and safe abstraction of hardware resources. Key components include:

• NesC: A programming language and model for TinyOS.
• TOSSIM: A simulator for TinyOS.
• TinyDB: A sensor database for TinyOS.

⭐ Key Takeaways

Wireless Sensor Networks are fundamentally different from ad hoc networks due to their extreme constraints in power, cost, and computational capacity, requiring specialized protocols. The most critical design factors are power consumption (communication is far more expensive than computation), scalability (high node density, formula μ(R) = NπR²/A), and fault tolerance. The protocol stack must be managed by cross-layer planes (power, mobility, task) to maximize efficiency. Routing is data-centric and must balance metrics like maximum available power, minimum energy, and minimum hops. A grand challenge is moving away from a strict layered architecture toward a cross-layer approach to improve energy efficiency and performance.

🧠 Quick Revision Questions

1. What are the key differences between sensor networks and traditional ad hoc networks in terms of scalability, communication paradigm, and unique IDs?
2. Explain the formula for node density and its significance in a WSN.
3. Why is the transport layer in a WSN considered a challenging open research area?
4. List and distinguish the three management planes (Power, Mobility, Task) in the WSN protocol stack.
5. What is the "3000 instructions" metric, and what does it illustrate about power consumption in WSNs?

📘 Lecture 35 — MAC Protocols for WSN Part II

📖 Overview: This lecture continues the exploration of MAC protocols for Wireless Sensor Networks, focusing on energy-efficient designs that address the unique challenges of WSNs. It covers several specific MAC protocols including S-MAC, T-MAC, DS-MAC, TRAMA, DMAC, and contention-free approaches, explaining their mechanisms, advantages, and limitations.

🗂️ Topics Covered

This lecture covers challenges in WSNs, important attributes of MAC protocols, and an overview of MAC protocol categories (contention-based and contention-free). It then delves into energy efficiency in MAC design, followed by detailed examination of specific protocols: S-MAC with its periodic listen/sleep mechanism, T-MAC with adaptive duty cycling, DS-MAC for dynamic duty cycle adjustment, TRAMA for traffic-adaptive scheduling, DMAC for convergecast communication, and ASAND for asynchronous contention-free slot assignment.

📝 Lecture Summary

Challenges in WSNs

Wireless Sensor Networks face multiple challenges including power consumption, fault tolerance, scalability, topology changes, and cost constraints. These challenges directly influence the design of MAC protocols, which must balance energy efficiency with other performance metrics.

Attributes of MAC Protocol

Important attributes of MAC protocols include collision avoidance as the basic task of medium access control, energy efficiency, scalability and adaptivity as the number of nodes changes over time, latency, fairness, throughput, and bandwidth utilization.

Overview of MAC protocols

Contention-based protocols include CSMA (Carrier Sense Multiple Access) used in Ethernet, though it is insufficient for wireless due to collision at the receiver. MACA (Multiple Access with Collision Avoidance) uses RTS/CTS to address the hidden terminal problem with RTS/CTS/DATA exchange. MACAW improves over MACA by adding RTS/CTS/DATA/ACK for fast error recovery at the link layer, and IEEE 802.11 DCF is largely based on MACAW.

Protocols from voice communication include TDMA (low duty cycle, energy efficient), FDMA (each channel has different frequency), and CDMA (frequency hopping or direct sequence).

Energy Efficiency in MAC

Energy is the primary concern in sensor networks. Causes of energy waste include collisions, control packet overhead, overhearing unnecessary traffic, overemitting, and long idle time which is dominant in sensor nets due to bursty traffic. Idle listening consumes 50-100% of the power for receiving.

TDMA vs. contention-based protocols: TDMA can easily avoid or reduce energy waste from all sources, while contention protocols need to work hard in all directions. However, TDMA has limited scalability and adaptivity—it is hard to dynamically change frame size or slot assignment when new nodes join, and it restricts direct communication within a cluster. Contention protocols easily accommodate node changes and support multi-hop communications.

S-MAC: Periodic Listen & Sleep

S-MAC (Sensor-MAC) uses a periodic listen and sleep mechanism. A frame consists of a listen interval and a sleep interval. Duty cycle is defined as (Listen Interval / Frame Length). Nodes are free to choose their own listen/sleep schedule, but neighboring nodes must synchronize together. They exchange schedules periodically using SYNC packets during the synchronization period (SP). Nodes communicate in receivers' scheduled listen times.

Frame Schedule Maintenance involves three scenarios:

1. Choosing a schedule: Listen to the medium for at least SP; if nothing heard, choose a schedule and broadcast a SYNC packet
2. Following a schedule: If a schedule is received before choosing/announcing, follow that schedule and broadcast a SYNC packet
3. Adopting multiple schedules: If a schedule is received after choosing/announcing, either discard or follow both schedules (suffering more energy loss)

Once RTS/CTS is established, data is sent in the sleep interval. Adaptive Listening allows overhearing nodes to wake up at the end of the current transmission using the duration field in RTS/CTS.

Drawbacks of S-MAC: The active (Listen) interval is long enough to handle the highest expected load, so if message rate is lower, energy is still wasted in idle-listening. S-MAC's fixed duty cycle is NOT OPTIMAL. It also suffers from high latency and synchronization maintenance issues. Clock drifts are not a major concern since listen time (0.5s) is 10⁵ times longer than typical drift rates, but long-term drifts require schedule updating using SYNC packets (sender ID, its next scheduled sleep time—relative). The listen interval is split into two parts—for SYNC and RTS/CTS.

🔑 Definition — Duty Cycle: (Listen Interval / Frame Length) — the proportion of time a node is actively listening versus sleeping

📐 Formula: Duty Cycle = Listen Interval / Frame Length → The fraction of time the radio is on and ready to receive

T-MAC: Preliminaries

T-MAC (Timeout-MAC) uses an adaptive duty cycle. A node remains in active mode until no activation event occurs for time TA. Activation events include periodic frame timer event, receive, carrier sense, send-done, and knowledge of other transmissions ending. Communication and frame schedule maintenance are similar to S-MAC/802.11.

Choosing TA: The requirement is that a node should not sleep while its neighbors are communicating (potential next receiver). TA > C+R+T, where C = contention interval length, R = RTS packet length, T = turn-around time (time between end of RTS and start of CTS). TA is set to 1.5 * (C+R+T).

Pros: Performs better under variable traffic load. Cons: Higher overheads than S-MAC to maintain variable wakeup schedule, unfairness and unpredictable delay.

💡 Why this matters: T-MAC solves S-MAC's problem of wasting energy during idle listening under low traffic by dynamically adjusting the active period based on actual activity.

Dynamic Sensor-MAC (DSMAC)

DSMAC provides a simple solution to static duty cycle. All nodes start with the same duty cycle. If one-hop latency is observed higher by the receiver, it doubles its duty cycle. Nodes share their one-hop latency values with neighbors during the SYNC period. The transmitter also doubles its duty cycle if the destination reported higher one-hop latency. This change does not affect the schedule of other neighbors. TMAC improves latency in S-MAC at the cost of complexity, while DSMAC provides a simpler solution.

Traffic-Adaptive MAC (TRAMA)

TRAMA (Traffic-Adaptive MAC) divides time into random-access and scheduled-access (transmission) periods. The random-access period establishes two-hop topology information. The MAC layer can calculate the needed transmission duration (SCHEDULE_INTERVAL). The node calculates the number of slots for which it will have the highest priority among two-hop neighbors and announces the slots it will use (with intended receivers) as well as slots it has highest priority for but will not use, using a schedule packet. The schedule packet indicates intended receivers using a bitmap whose length equals the number of its neighbors.

Advantages: Higher percentage of sleep time and less collision probability compared to CSMA-based protocols. Since intended receivers are indicated by a bitmap, less communication is performed for multicast and broadcast communication patterns.

Disadvantages: Transmission slots are set to be seven times longer than the random-access period, meaning the duty cycle is at least 12.5% (idle time) without considering transmissions and receptions.

DMAC

DMAC supports the convergecast communication model where a data-aggregation tree is formed from sources to the sink node. It is an improved slotted ALOHA algorithm. Slots are allotted according to the level of the tree from leaf to root. It incurs low latency but has no collision avoidance for nodes at the same level.

A minimum period u consists of one packet transmission and reception. The wakeup period in the tree is skewed depending on depth d, so du is the wakeup time. A node at a higher layer will be in receive state when lower layer nodes are in transmit state. Nodes on the path wake up sequentially to forward packets to the next hop, achieving low latency with efficient energy consumption.

Contention-Free MAC protocols

Asynchronous Slot Assignment is used in contention-free MAC protocols. Each node locally discretizes its local time. The number of slots in a time frame (frame size, denoted by Λ) is set to 2δ². Having the same frame size at all nodes ensures that overlapping time slots remain the same.

ASAND Protocol (Asynchronous Slot Assignment and Neighborhood Discovery): A node first discretizes its local time into equal-sized frames of Λ slots. Each node selects a conflict-free time slot in its frame. Initially, node i is nonready and selects randomly and uniformly a slot σi in its frame. In slot σi, node i broadcasts a "beacon" message mi to its neighborhood. In all other slots, it listens and marks each slot where a garbled signal is received. In the next frame, i transmits in all slots that were marked in the previous frame—this is called conflict reporting, which forces hidden terminals to refrain from obtaining overlapping time slots.

If node i's initial broadcast in slot σi was collision-free, it concludes that none of its neighbors has selected an overlapping time slot. It broadcasts a second time in slot σi in the next frame. If this is also collision-free, it concludes that none of its 2-hop neighbors selected a conflicting time slot, and i becomes ready. Otherwise, when i detects a collision in either broadcast, it goes back to the initial state and tries a new random slot.

Conflict Reporting: When 2-hop neighbors u and v are unaware they have selected conflicting time slots (their transmissions collide on w), node w observes the collision at local time t and transmits at time t+Λ, creating a spurious conflict with both u and v. This reduces a conflict between hidden terminals to a conflict between neighbor nodes. After t+Λ, u and v will be forced to select new slots. Node i reports each collision exactly Λ slots after it happened.

This basic approach brings up fundamental issues—it is usually not possible to detect collisions for a wireless device during its own transmission. A novel collision detection scheme based on a special modulation scheme utilizing unique IDs of nodes is proposed.

🔑 Definition — Conflict Reporting: A technique where a node that observes a collision between two hidden terminals transmits at a later time to force both terminals to detect a conflict and select new slots

📐 Formula: Λ = 2δ² → Frame size equals twice the square of the maximum node degree δ

⭐ Key Takeaways

The most critical concepts from this lecture are the five main MAC protocols for WSNs and their energy-saving mechanisms. S-MAC uses periodic listen/sleep with fixed duty cycles, requiring neighbor synchronization but wasting energy under variable loads. T-MAC improves upon S-MAC with adaptive duty cycling where nodes sleep after TA time without activity, performing better under variable traffic but adding complexity. DSMAC provides a simpler solution by allowing nodes to double their duty cycle based on observed one-hop latency. TRAMA uses traffic-adaptive scheduling with random-access and scheduled-access periods, achieving higher sleep time but with minimum 12.5% idle duty cycle. DMAC supports convergecast by skewing wakeup times based on tree depth for low-latency data forwarding to sinks. The primary energy waste sources are collisions, control overhead, overhearing, overemitting, and especially idle listening—which dominates in sensor networks due to bursty traffic patterns.

🧠 Quick Revision Questions

1. What are the five main causes of energy waste in WSN MAC protocols, and which one is considered dominant?
2. How does S-MAC's frame structure work, and what is the difference between a node choosing a schedule versus following one?
3. What is the formula for TA in T-MAC, and why is TA set to 1.5 times the sum of C, R, and T?
4. How does DMAC achieve low latency for convergecast communication using skewed wakeup times?
5. Explain the conflict reporting mechanism in ASAND—what problem does it solve and how does it force hidden terminals to reselect slots?

📘 Lecture 36 — Routing in WSN Part III

📖 Overview: This lecture continues the study of routing in Wireless Sensor Networks by examining key routing challenges and design issues, then presenting a comprehensive survey of major routing protocols. It covers flat, hierarchical, location-based, and QoS-based protocols including SPIN, Directed Diffusion, ACQUIRE, LEACH, TEEN/APTEEN, GAF, GEAR, and SPEED, explaining their mechanisms, advantages, and limitations for exam-relevant comparison.

🗂️ Topics Covered

The lecture begins with routing challenges and design issues including node deployment, data routing methods, heterogeneity, fault tolerance, network dynamics, transmission media, connectivity, coverage, data aggregation, and QoS. It then categorizes and explains routing protocols: flat protocols (SPIN, Directed Diffusion, ACQUIRE), hierarchical protocols (LEACH, TEEN/APTEEN), location-based protocols (GAF, GEAR), and real-time protocols (SPEED). Each protocol is detailed with its operation, pros, cons, and comparisons.

📝 Lecture Summary

Routing challenges and design issues

Routing in WSNs faces multiple design challenges. Node deployment can be manual (predetermined path) or random (requires optimal clustering for connectivity and energy-efficiency, multi-hop routing). Data routing methods are application-specific: time-driven (periodic monitoring), event-driven (respond to sudden changes), query-driven (respond to queries), or hybrid. Node/link heterogeneity means homogeneous sensors vs. heterogeneous nodes with different roles, e.g., cluster heads with more energy handle transmissions to BS. Fault tolerance addresses sensor failure from power loss, damage, or interference — solutions include adjusting transmission power, changing sensing rate, or rerouting through regions with more power. Network dynamics considers mobile nodes, mobile events (target tracking), and reactive vs. periodic reporting. Transmission media is wireless with limited bandwidth (1–100Kbps); MAC can be contention-free (TDMA, CDMA) or contention-based (CSMA, MACA, 802.11). Connectivity depends on high density and random deployment; sensors may die after battery depletion. Coverage is limited per sensor, making area coverage an important design factor. Other issues include data aggregation and Quality of Service (bounded delay, energy efficiency for longer network lifetime).

💡 Why this matters: These design issues directly determine which routing protocol is suitable for a given WSN application — a key exam topic.

Routing Protocols in WSNs

Protocols are categorized into four types: I. Flat, II. Hierarchical, III. Location-based, IV. QoS-based. Flooding is a baseline but suffers from too much waste, implosion (node D receives duplicate copies from multiple neighbors), and overlap (two sensors covering overlapping region send same data). Data-centric routing uses naming based on data attributes with no globally unique ID — examples include SPIN and Directed Diffusion.

SPIN (Sensor Protocols for Information via Negotiation)

SPIN solves flooding inefficiencies using negotiation. Before transmitting data, a node advertises data via an ADV message. Interested neighbors respond with a REQ message, and only then does the source send the actual DATA. This negotiation reduces energy consumption compared to flooding. Pros: Each node only needs to know its one-hop neighbors; significantly reduces energy consumption compared to flooding. Cons: Data advertisement cannot guarantee delivery; if interested nodes are far from the source, data will not be delivered; not suitable for applications requiring reliable data delivery (e.g., intrusion detection).

Direct Diffusion: Motivation and Elements

Directed Diffusion is data-centric with no central authority, resource-constrained nodes, ties to physical locations, and generally stationary nodes that may not know topology. It has four key elements:

• Naming: Data is named using attribute-value pairs (content-based naming). Example: animal tracking — Interest: Type = four-legged animal, Interval = 20 ms, Duration = 1 minute, Location = [-100, -100; 200, 400]; Reply (Node data): Type = four-legged animal, Instance = elephant, Location = [125, 220], Confidence = 0.85, Time = 02:10:35.

• Interests: A sink requests data by sending interests for named data. The sink periodically broadcasts interest messages to neighbors. Each node maintains an interest cache — each item corresponds to a distinct interest; allows interest aggregation for identical type and overlapping rectangles. Each cache entry has fields: Timestamp (last received matching interest) and several gradients (data rate, duration, direction).

• Gradients: Gradients are set up within the network to "draw" events (data matching the interest). The user requests low-data-rate events; interest is sent and propagated (black arrow); gradients are set up (blue arrow); events are sent along gradients (red arrow, thin for low data rate).

• Reinforcement: The sink reinforces particular neighbors to draw higher quality events (higher data rate). The user reinforces the best path in terms of delay (green arrow); thick red arrow shows high data rate. If a node fails, no high-data-rate events are received; the sink reinforces a low-data-rate path to recover.

Data propagation: Sensor node computes the highest requested event rate among all its outgoing gradients. When a node receives data, it finds matching interest entry, examines gradient list, sends data by rate; cache keeps track of recent data items for loop prevention; data messages are unicast individually to relevant neighbors.

Pros of Directed Diffusion: Data-centric with neighbor-to-neighbor communication, no node addressing mechanism needed; each node can do aggregation and caching. Cons: On-demand, query-driven — inappropriate for applications requiring continuous data delivery (e.g., environmental monitoring); attribute-based naming scheme is application dependent and must be defined a priori, causing extra processing overhead.

ACQUIRE (Active Query forwarding In sensoR nEtworks)

ACQUIRE views a WSN as a distributed database. The base station (BS) sends a complex query. Each node tries to answer the query using precached info and forwards the query to another node. If cached info is not fresh, the node gathers info from neighbors within a lookahead of d hops. Once the query is resolved completely, it is sent back to BS via reverse path or shortest path. ACQUIRE can deal with complex queries — Directed Diffusion cannot due to too much flooding. ACQUIRE can adjust d for efficient query processing: if d = network diameter, ACQUIRE becomes similar to flooding; if d is too small, queries travel more. Provides mathematical modeling for optimal d in a grid, but no experiments performed.

LEACH (Low Energy Adaptive Clustering Hierarchy)

LEACH is a cluster-based protocol. Each node randomly decides to become a cluster head (CH). CH chooses the code for CDMA between clusters. CH broadcasts Adv; each node decides its cluster based on received signal strength. CH creates a TDMA transmission schedule in the cluster — nodes can sleep when not their turn to transmit. CH compresses data from cluster nodes and sends aggregated data to BS. CH is rotated randomly.

🔑 Definition — Cluster Head (CH): A node elected to coordinate a cluster, aggregate data from member nodes, and communicate with the base station.

📐 Formula: CH rotation is random per round → ensures energy load distribution across all nodes.

Pros: Distributed, no global knowledge required; energy saving due to aggregation by CHs. Shortcomings: LEACH assumes all nodes can transmit with enough power to reach BS if necessary (e.g., elected as CHs); each node should support both TDMA and CDMA. Extension of LEACH adds high-level negotiation (similar to SPIN) — only data providing new info is transmitted to BS.

TEEN (Threshold sensitive Energy Efficient Network protocol)

TEEN is a reactive, event-driven protocol for time-critical applications. A node senses the environment continuously but turns radio on and transmits only if sensor value changes drastically — no periodic transmission, saving energy when data is not critical. CH sends members a hard threshold and a soft threshold:

• Hard threshold: Member sends data to CH only if data values are in the range of interest.
• Soft threshold: Member sends data only if its value changes by at least the soft threshold.

Every node in a cluster takes turns to become CH for a cluster period. Supports hierarchical clustering (multi-level).

📌 Example: In a fire detection sensor network, hard threshold = temperature above 50°C; soft threshold = temperature change of at least 5°C since last report. A node at 48°C won't report; if it jumps to 55°C, it reports; then it reports again only if temperature changes by another 5°C (e.g., to 60°C).

Pros: Good for time-critical applications; significant energy saving (less than proactive approaches); soft threshold can be adapted; hard threshold can be adapted depending on applications. Cons: Inappropriate for periodic monitoring (e.g., habitat monitoring); ambiguity between packet loss and unimportant data (no drastic change).

APTEEN (Adaptive Threshold sensitive Energy Efficient Network protocol)

APTEEN extends TEEN to support both periodic sensing and reacting to time-critical events. Unlike TEEN, a node must sample and transmit data if it has not sent data for a time period equal to CT (count time) specified by CH. Compared to LEACH, TEEN and APTEEN consume less energy (TEEN consumes the least). Network lifetime: TEEN ≥ APTEEN ≥ LEACH. Drawbacks: Overhead and complexity of forming clusters in multiple levels and implementing threshold-based functions.

GAF (Geographic Adaptive Fidelity)

GAF is an energy-aware location-based protocol mainly designed for MANET. Each node knows its location via GPS and associates itself with a point in a virtual grid. Nodes associated with the same grid point are considered equivalent in terms of packet routing cost. For example, if Node 1 can reach any of nodes 2, 3, and 4, then nodes 2, 3, and 4 are equivalent — any two can sleep without affecting routing fidelity. GAF has three states: Discovery (determine neighbors in a grid), Active, and Sleep. Each node estimates its time of leaving the grid and sends it to neighbors; sleeping neighbors adjust their sleeping time to keep routing fidelity.

GEAR (Geographic and Energy Aware Routing)

GEAR restricts the number of interest floods in Directed Diffusion by considering only a certain region of the network rather than flooding the entire network. Each node keeps an estimated cost and a learning cost of reaching the sink through its neighbors.

📐 Formula: Estimated cost = f(residual energy, distance to the destination)

Learned cost is propagated one hop back every time a packet reaches the sink, allowing route setup adjustment for the next packet.

Phase 1 — Forwarding packets towards the region: Forward a packet to the neighbor minimizing cost function f (closest to sink and highest remaining energy). If all neighbors are further than itself, there is a hole — pick a neighbor based on learned cost.

Phase 2 — Forwarding within the target region: Apply either recursive forwarding (divide region into four subareas, send four copies of packet, repeat until regions with only one node are left) or restricted flooding (when node density is low). GEAR delivers significantly more packets than GPSR (Greedy Perimeter Stateless Routing).

SPEED: A real-time routing protocol for WSN

SPEED ensures real-time routing in WSNs. It guarantees single-hop delay D and end-to-end deadline is D × (L/K + 1) where L is path length and K is some constant. Cons: No energy consideration; per-hop delay differs greatly; coordination challenges.

⭐ Key Takeaways

The most critical concepts from this lecture are the routing challenges (deployment type determines clustering needs, heterogeneity allows specialized roles, fault tolerance requires adaptive mechanisms) and the comparative understanding of major routing protocols. SPIN uses negotiation to reduce flooding waste but cannot guarantee delivery. Directed Diffusion uses interests, gradients, and reinforcement for on-demand data-centric routing, but is unsuitable for continuous monitoring. ACQUIRE treats the network as a distributed database with adjustable lookahead d for complex queries. LEACH uses randomized cluster head rotation with TDMA/CDMA for energy-efficient aggregation. TEEN and APTEEN use thresholds for event-driven and adaptive sensing, with TEEN being most energy-efficient but unsuitable for periodic monitoring. Location-based protocols GAF and GEAR use geographic information to reduce energy waste, while SPEED provides real-time delay guarantees. The key exam comparisons are: flooding vs. SPIN vs. Directed Diffusion, LEACH vs. TEEN vs. APTEEN, and the role of thresholds, gradients, and reinforcement in protocol operation.

🧠 Quick Revision Questions

1. What are the four key elements of Directed Diffusion, and how does reinforcement recover from node failure?
2. Compare SPIN and Directed Diffusion in terms of data advertisement, energy efficiency, and suitability for continuous data delivery applications.
3. How does ACQUIRE differ from Directed Diffusion in handling complex queries, and what is the role of lookahead d?
4. Explain the difference between hard threshold and soft threshold in TEEN, and why TEEN is unsuitable for periodic monitoring.
5. How does GEAR reduce flooding compared to Directed Diffusion, and what happens when a hole is encountered in Phase 1?

📘 Lecture 37 — Transport Protocols/Security in WSN Part IV

📖 Overview: This lecture explores transport protocols specifically designed for Wireless Sensor Networks, explaining why traditional TCP/UDP are unsuitable. It covers three key protocols—PSFQ, ESRT, and CODA—for reliable transport and congestion control, then transitions into security threats and the TinySec link-layer security framework for WSNs.

🗂️ Topics Covered

The lecture covers transport protocols for WSN including PSFQ (Pump Slow Fetch Quickly) for sink-to-node reliable transport, ESRT (Event-to-Sink Reliable Transport) for event-driven reliability with congestion control, and CODA (Congestion Detection and Avoidance) for managing congestion. It then discusses security threats unique to WSNs, motivations for link-layer security, and the TinySec design goals including security properties, performance considerations, and ease of use.

📝 Lecture Summary

Transport Protocols for WSN

The lecture categorizes WSN transport protocols by communication direction. Sink-to-Node(s) Transport includes PSFQ (Pump Slow Fetch Quickly), RMST (Reliable Multi-Segment Transport), and Garuda. Nodes-to-Sink Transport includes ESRT (Event-to-Sink Reliable Transport) and End-to-End Reliable Event Transfer in WSNs. Congestion Control protocols include CODA (Congestion Detection and Avoidance), Mitigating Congestion in WSNs, TEEN/APTEEN, GAF, GEAR, and SPEED.

Why not TCP or its variants for WSN?

TCP is unsuitable for WSN due to several critical reasons. Higher overheads exist for short data transmissions. Flow and congestion control cause unfair bandwidth allocation for farther nodes. Throughput degrades under wireless conditions due to higher packet losses. End-to-end congestion needs longer time to mitigate, causing more congestion to occur. End-to-end reliability consumes more energy and bandwidth than hop-by-hop approaches. TCP provides packet-based reliability, which is not required for event-driven applications.

Why not UDP?

UDP has lower overheads but lacks essential features: no congestion control, no flow control, and no reliability.

Pump Slowly, Fetch Quickly (PSFQ)

PSFQ is designed for application reprogramming or re-tasking of sensor networks. Nodes broadcast fragments in-sequence to the next hop, which stores and forwards. If a node detects a gap, it broadcasts a NACK (Negative Acknowledgment). The protocol operates on a hop-by-hop store and forward mechanism.

Features: NACK-based recovery, in-sequence caching, assumes loss due to transmission drops not congestion, hop-by-hop error recovery.

Goals: Operate under high error rates with minimum support from underlying layers, low latency, and minimize number of transmissions for lost detection and recovery.

Messages: Pump, Fetch, and Report messages.

PSFQ Operations:

• Pump Operation: A user node broadcasts a packet to its neighbors every Tmin. It decrements the TTL and schedules a transmission where Tmin < Ttransmit < Tmax. If a node hears the same transmission four times before Ttransmit, it cancels its own transmission.
• Fetch Operation: When a sequence number gap is detected, the node sends a NACK message upstream (scope is 1 hop). NACKs are generated every Tr (where Tr << Tmax). NACKs can be cancelled if neighbors have sent similar NACKs. The node enters 'proactive fetch' mode if the last segment hasn't been received and no packet has been delivered after Tpro = a * (Smax - Smin) * Tmax.
• Report Operation: Used as a feedback/monitoring mechanism.

Problems with PSFQ:

• Uniformly distributed channel error model
• Need fine tuning of timers for good results (Tmin, Tmax, Tr)
• First Packet Delivery issues
• Cache size limitation

Event-to-Sink Reliable Transport (ESRT) for Wireless Sensor Networks

ESRT provides event-to-sink reliability with self-configuration, energy awareness (low power consumption requirement), and congestion control. It features variation in complexity at source and sink.

ESRT's Definition of Reliability:

• Reliability is measured in terms of the number of packets received, or reporting frequency (number of packets per decision interval).
• Observed reliability: number of received data packets in a decision interval at the sink.
• Desired reliability: number of packets required for reliable event detection.
• Normalized reliability = observed / desired.

📐 Formula: Normalized Reliability = Observed Reliability / Desired Reliability → This ratio tells us whether the sink is receiving enough packets to reliably detect an event.

Algorithm for ESRT:

• If congestion and low reliability: decrease reporting frequency aggressively (exponential decrease).
• If congestion and high reliability: decrease reporting to relieve congestion, no compromise on reliability (multiplicative increase).
• If no congestion and low reliability: increase reporting frequency aggressively (multiplicative increase).
• If no congestion and high reliability: decrease reporting slowly (half the slope).

💡 Why this matters: The ESRT algorithm dynamically adjusts the reporting frequency of sensor nodes based on both congestion and reliability conditions, balancing energy consumption with reliable event detection.

Drawback: Event-based reporting frequency is not good for all nodes.

CODA: Congestion Detection and Avoidance

CODA addresses that the transport of event impulses is likely to lead to varying degrees of congestion. CODA uses channel sampling to detect congestion and broadcasts this information to upstream nodes.

General Purpose: Event-to-sink applications.

Features: Uses buffer occupancy and channel sampling to detect congestion, assumes event occurrence as source of congestion (not wireless links or interference).

Goals: Minimize congestion, both transient and persistent.

Description: Open-loop hop-by-hop backpressure, Closed-loop multi-source regulation.

CODA Components:

• Congestion Detection: Accuracy and efficiency are important. Buffer queue length or buffer occupancy is not a good measure of congestion. Channel loading – sample channel at appropriate time to detect congestion.
• Open loop, hop-by-hop backpressure: A node broadcasts backpressure messages to upstream nodes as long as it detects congestion. An upstream node decides whether to further propagate the message or not, depending on its own local network condition.
• Closed-loop, multi-source regulation: When a source event rate is greater than some maximum theoretical throughput, it is more likely to contribute to congestion, so it enters sink regulation. The sink sends ACKs at some predefined rate or a certain number of ACKs over a predefined period. If the source does not receive necessary ACKs, it decreases its rate.

Security threats in Sensor Networks

The use of wireless communications means adversaries can easily eavesdrop on, intercept, inject, and alter transmitted data. Adversaries can interact with networks from a distance using inexpensive radio transceivers and powerful workstations. Resource consumption attacks allow adversaries to repeatedly send packets to drain nodes' batteries and waste network bandwidth, and they can steal nodes. However, these threats are not all addressed; the focus is on guaranteeing message authenticity, integrity, and confidentiality.

TINYSEC

TinySec is a lightweight and efficient link-layer security package designed as a research platform that is easily extensible and has been incorporated into higher-level protocols. Developers can easily integrate it into sensor network applications.

Motivation for Link layer security in Sensor Networks

End-to-end security mechanisms are suitable only for conventional networks using end-to-end communications where intermediate routers only need to view message headers. They are not suitable for sensor networks because if message integrity is checked only at the destination, the network may route packets injected by an adversary many hops before they are detected, wasting precious energy. In sensor networks, in-network processing is done to avoid redundant messages, requiring intermediate nodes to have access to whole message packets, not just headers. A link-layer security mechanism can detect unauthorized packets when they are first injected onto the network.

Design Goals – Security Goals

A link-layer security protocol should satisfy three basic security properties:

• Access control and Message integrity: prevent unauthorized parties from participating.
• Confidentiality: keeping information secret from unauthorized parties.
• Explicit omission: Replay protection: an adversary eavesdropping a legitimate message sent between two authorized parties replays it at some time later.

Design goals – Performance goals

A system using cryptography will incur increased overhead in message length. Overhead limitations are REQUIRED. Increased message length results in decreased message throughput, increased latency, and increased power consumption (especially in sensor networks). It is necessary to carefully tune the strength of security mechanisms for reasonable security while limiting overheads.

Design Goals – Ease of Use

• Security Platform: Higher-level security protocols can use TinySec to create secure pairwise communication between neighboring nodes.
• Transparency: Application programmers are unsure of security parameters and can disable if standardized APIs are not provided. It should be transparent to the user.
• Portability: Should fit into the radio stack so that porting the radio stack from one platform to another (ATmel, Intel, X86, etc.) is a simple job.

⭐ Key Takeaways

Students must remember that traditional TCP is unsuitable for WSN due to high overhead, unfair bandwidth allocation, energy-expensive end-to-end reliability, and packet-based reliability being unnecessary for event-driven applications. PSFQ uses hop-by-hop NACK-based recovery with Pump, Fetch, and Report operations to achieve reliable sink-to-node transport under high error rates. ESRT defines reliability as normalized reliability (observed/desired) and adjusts reporting frequency based on congestion and reliability states using four algorithms. CODA detects congestion through channel sampling rather than buffer occupancy and uses open-loop backpressure and closed-loop source regulation. TinySec provides lightweight link-layer security addressing access control, message integrity, confidentiality, and replay protection while balancing security strength with performance overhead.

🧠 Quick Revision Questions

1. What three main reasons make TCP unsuitable for Wireless Sensor Networks, and why is packet-based reliability problematic for event-driven applications?
2. In PSFQ, what triggers a NACK message during the Fetch operation, and how does the 'proactive fetch' mode work?
3. How does ESRT calculate normalized reliability, and what four actions does it take based on congestion and reliability conditions?
4. What two methods does CODA use for congestion detection, and how do open-loop backpressure and closed-loop source regulation differ?
5. What three security properties does TinySec aim to provide, and why is link-layer security preferred over end-to-end security in sensor networks?

📘 Lecture 38 — Security/Extensions of WSN Part V

📖 Overview: This lecture covers security primitives in TinySec, encryption schemes, and keying mechanisms for wireless sensor networks. It then introduces Wireless Multimedia Sensor Networks (WMSN) and Wireless Sensor and Actor Networks (WSAN), discussing their architectures, applications, advantages, and design challenges.

🗂️ Topics Covered

Security primitives in TinySec including message authentication codes and initialization vectors, TinySec design options for authentication encryption and authentication only, IV format design, symmetric key encryption schemes including stream ciphers and CBC mode, keying mechanisms from per-link to group and single network keys, then Wireless Multimedia Sensor Networks architecture, advantages, design considerations, and deployed examples, followed by Wireless Sensor and Actor Networks motivations, comparison with WSN, architecture types, and key issues.

📝 Lecture Summary

Security Primitives

Message Authentication code (MAC) is a cryptographic secure checksum for checking message integrity. Computing a MAC requires authorized senders and receivers to share a secret key, and this key is part of the input to a MAC computation. If an adversary alters a valid message or injects a bogus message, she cannot compute the corresponding MAC value.

🔑 Definition — MAC: a cryptographic secure checksum for checking the message integrity, computed using a shared secret key between authorized sender and receiver.

Initialization vector (IV) is used to achieve semantic security — encrypting the same plaintext two times should give two different ciphertexts. A common technique for achieving semantic security is to use a unique initialization vector (IV) for each invocation of algorithm. The IV is a side input to the encryption algorithm.

🔑 Definition — IV: a unique side input to the encryption algorithm that ensures the same plaintext produces different ciphertexts each time it is encrypted.

TINYSEC-DESIGN

TinySec offers 2 Security Options:

• Authentication Encryption (Tinysec-AE): TinySec encrypts the data payload and authenticates the packet with a MAC. The MAC is computed over the encrypted data and the packet header.
• Authentication only (Tinysec-Au): TinySec authenticates the entire packet with a MAC, but the data payload is not encrypted.

Encryption requires semantically secure design, which typically requires two design decisions: specifying the IV format and selecting an encryption scheme.

Tinysec IV format

If the IV is too long, it adds unnecessary bits to the packet. If too short, there is a risk of repetition. An n-bit IV will repeat after 2^n + 1 uses. If we use an n-bit counter, repetitions will not happen before that point. Pseudorandom IV would repeat with probability of 2^(n/2).

Encryption Schemes

Symmetric key encryption schemes fall into two classes:

Stream ciphers: A stream cipher typically uses a key K and IV as a seed and stretches it into a large pseudorandom keystream GK(IV). The keystream is then XORed against the message. Stream ciphers have a devastating failure mode: if the same IV is ever used to encrypt two different packets, then it is often possible to recover both plaintexts.

Modes of operation using block ciphers: A block cipher is a keyed pseudorandom permutation over small bit strings, typically 8 or 16 bytes. CBC (Cipher Block Chaining) is the most appropriate scheme for sensor networks because it works better with repeated IVs.

CBC

In CBC mode, the IV is XORed with the first data block before it is encrypted. The result of encryption is fed back into the encryption of the next block. The plaintext is XORed with the previous ciphertext block before it is encrypted. The encryption of each block depends on all the previous blocks. This requires that the decryption side processes all encrypted blocks sequentially.

An error in an encrypted block causes the block with the error to be completely garbled. The subsequent block will have bit errors at the same positions as the original erroneous block. The blocks following the second block will not be affected by the error. Hence, CBC is self-recovering.

Keying Mechanism

Several keying options exist:

• Per-link keying: Use a separate TinySec key for each pair of nodes wishing to communicate. Drawback: Key distribution becomes a challenge.
• Group keying: Allow a group of nodes to share a TinySec key rather than each pair. Group keying provides an intermediate level of resilience.
• Single network key: The simplest mechanism uses a single key for the entire network, preloaded before deployment. The adversary can compromise one node and get the key.

The appropriate keying mechanism for a particular network depends on several factors. A TinySec key consists of a pair of Skipjack keys — one for authentication, one for encryption.

Wireless Multimedia Sensor Networks

WMSN are networks of wirelessly interconnected devices that allow retrieving video and audio streams, still images, and scalar sensor data. They are able to store, process in real-time, correlate, and fuse multimedia data originated from heterogeneous sources.

Reference Architecture of WMSN

[Reference architecture diagram shown in lecture includes multimedia sensor nodes with cameras and microphones, interconnected through a wireless network, with a sink/base station connected to a central processing/storage system, and potentially connected to the internet or other networks.]

Advantages

• Enlarging the Views: Provide multiple disparate viewpoints to overcome occlusion effects.
• Enhancing the Views: Redundancy provides enhanced quality.
• Enabling Multi-resolution Views: Heterogeneous media streams with different granularity can be acquired from the same point of view.

Design Considerations

• Application-specific QoS requirements for snapshot and streaming multimedia.
• Flexible architecture to support heterogeneous applications.
• Multimedia source coding including intra-frame/inter-frame and distributed source coding.
• Multimedia in-network processing.
• Multimedia coverage model development.
• Power consumption.

Examples of Deployed WMSN

SensEye performs three tasks: object detection, recognition, and tracking. Its objective is to demonstrate that a camera sensor network containing heterogeneous elements provides numerous benefits over traditional homogeneous sensor networks.

New Applications include: Storage and Retrieval of Interesting Activities (e.g., IrisNet, 2004), Traffic congestion avoidance and enforcement systems, Smart parking advice system (2005), Automated Assistance for the elderly and family monitors (2005), Manufacturing process control for semiconductor chip, food or pharmaceutical products.

Application Layer

The services offered by the application layer include:

• Providing traffic management and admission control functionalities.
• Performing source coding according to application requirements and hardware constraints, using advanced multimedia encoding techniques.
• Developing flexible OS and Middleware to make functional abstractions and information gathered by the scalar and multimedia sensors available to higher layer applications.

Traffic Management and Admission Control

Tasks include: Prevent applications from establishing data flows when the network resources needed are not available; provide traffic classes for differentiated service between real-time and delay-tolerant applications, and loss-tolerant and loss-intolerant applications.

Related work: An application admission control algorithm (2003) whose objective is to maximize network lifetime subject to bandwidth and reliability constraints. Another method (2003) determines admissions based on added energy load and application rewards.

Transport Layer

Regarding TCP or UDP for WMSN: For real-time applications like streaming media, UDP seems preferred over TCP due to effect of dropping packets in UDP and support for traffic heterogeneity. However, TCP with appropriate modifications is preferable over UDP for WMSNs, if standardized protocols are to be used.

Non-Standard Protocols

Focusing on reliability:

• Reliable Multi-Segment Transport (RMST) (2004) or Pump Slowly Fetch Quickly (PSFQ) protocol (2005): Loss-intolerant packets are separated and ensured to be successfully transmitted. Loss-intolerant packets are buffered at intermediate nodes, allowing for faster retransmission in case of packet loss. Other packets are transmitted in UDP manner. No congestion avoidance.
• Event-to-Sink Reliable Transport (ESRT) protocol (2005): Not best-effort but reliable requirement-based rate control with congestion detection and avoidance.

Using Multiple Paths

• Regulating streaming through multiple TCP connections (2005): Sender sends desired streaming rate and allows throughput reduction to the receiver. Receiver measures actual throughput, controls the rate within allowed bounds by using multiple TCP connections and dynamically changing its TCP window size for each connection.
• Splitting a large burst of data into several smaller bursts using Multi-flow Real-time Transport Protocol (MRTP) (2006).
• Allows the sink to regulate multiple sources associated with a single event using Congestion Detection and Avoidance (CODA) protocol (2003).

WSAN: I. Motivations

Environmental Applications: Detecting and extinguishing forest fire. Distributed Robotics & Sensor Networks: Mobile robots dispersed throughout the field in sensor networks, e.g., mines detection and destruction. Structure health monitoring and control: Sensors to observe seismic excitation in bridges/buildings; actors to reduce deflections. Surveillance/Emergency handling: Immediate alerts of changes in patient status; relay data to hospital, correlate with patient records. Battlefield applications: Sensors detect explosive materials or weapons; actors annihilate them or function as tank. Microclimate controls in smart buildings: In case of very low or high temperature/gas leakages, trigger the alarms or corresponding controller.

WSAN: II. Wireless Sensor Actor Networks

Sensors: Passive nodes sensing from the environment with limited energy, processing, and communication capabilities. Actors: Active nodes acting on the environment with higher processing and communication capabilities, less-constrained energy resources, and mobile capability. WSAN = WSN + Actors.

WSANs vs. Wireless Sensor Networks

• Real-time requirements for timely actions: Rapidly respond to sensor input (e.g., in battlefield). To perform right action, sensor data must be valid at the time of action.
• Heterogeneous Nodes: Sensors (densely deployed) with heterogeneity for multiple events detection or multi-level energy sources; Actors (loosely deployed) with different action capabilities.
• Distributed local coordination requirements: Sensor-Actor coordination and Actor-Actor coordination.
• Nodes mobility: Specially actor nodes such as robots, ambulance, tank.

WSAN Architecture

Semi-automated architecture: Sensors communicate with a central controller which then coordinates actors. Automated architecture: Sensors communicate directly with actors, which coordinate among themselves without central control.

WSAN: III. Issues

• Self-configuration of sensor nodes.
• Energy conservation is the primary concern as in WSNs.
• Localization of sensor nodes relative to actors.
• Real-time routing — Is it possible with highly dynamic topology?
• Aggregation — It might affect in-time data delivery.
• Coordination.
• Redundancy — Exploit spatial or temporal correlation.

💡 Why this matters: WMSN and WSAN represent advanced extensions of WSN that support multimedia and actuation capabilities, enabling real-world applications like surveillance, disaster response, and smart environments. Understanding their security, architecture, and protocol challenges is essential for designing robust systems.

⭐ Key Takeaways

TinySec provides two security options — authentication encryption (AE) which encrypts payload and authenticates with MAC, and authentication only (AU) which only authenticates without encryption. The IV format design is critical: too long wastes bits, too short risks repetition. CBC is the preferred encryption mode for sensor networks because it self-recovers from errors and works better with repeated IVs compared to stream ciphers which have devastating failures if IV repeats. WMSN enables video/audio streaming with advantages of enlarged, enhanced, and multi-resolution views but faces challenges in QoS, source coding, and power consumption. WSAN extends WSN with actors that can act on the environment, introducing real-time requirements, heterogeneous nodes, distributed coordination, and mobility issues.

🧠 Quick Revision Questions

1. What are the two security options in TinySec, and what does each encrypt/authenticate?
2. Why is CBC mode preferred over stream ciphers for sensor network encryption?
3. What are the three keying mechanisms discussed for TinySec, and what is the drawback of each?
4. What three advantages does WMSN offer over traditional WSN?
5. How does WSAN differ from WSN in terms of node types, real-time requirements, and coordination?

📘 Lecture 39 — Bluetooth/Wireless Personal Area Networks (WPAN)

📖 Overview: This lecture introduces Bluetooth technology as a low-cost, low-power, short-range wireless solution for ad-hoc communication of voice and data. It covers Bluetooth’s technical features, architecture, core protocols, packet formats, and link connection types, explaining how devices form piconets and scatternets for wireless personal area networking.

🗂️ Topics Covered

This lecture covers Bluetooth introduction and definition, application areas, technical features including frequency hopping and time-division duplex, radio specifications and transmitter classes, Bluetooth topology including piconets and scatternets, standards documents and profiles, protocol architecture with core protocols (Radio, Baseband, LMP, L2CAP, SDP), packet format and access codes, inquiry and page procedures, link manager protocol functions, connection states, L2CAP services, and the two types of links between master and slave (SCO and ACL).

📝 Lecture Summary

What is Bluetooth?

Bluetooth wireless technology is an open specification for a low-cost, low-power, short-range radio technology designed for ad-hoc wireless communication of voice and data anywhere in the world. It serves as the ultimate headset and cordless computer connection.

Bluetooth Application Areas

Bluetooth has three main application areas: Data and voice access points for real-time voice and data transmissions, Cable replacement which eliminates the need for numerous cable attachments for connection, and Ad hoc networking where a device with Bluetooth radio can establish connection with another when in range.

Time-Division Duplex Scheme

The channel is divided into consecutive slots, each 625 μs long. One packet can be transmitted per slot. Subsequent slots are alternatively used for transmitting and receiving with strict alternation of slots between the master and the slaves. The master can send packets to a slave only in EVEN slots, and the slave can send packets to the master only in ODD slots.

Overview of Bluetooth History

Bluetooth is a short-range wireless communications technology. The name was taken from the 10th century Danish King Harald Blatand who unified Denmark and Norway. In 1994, Ericsson began a study on a wireless technology to link mobile phones and accessories. Five companies joined to form the Bluetooth Special Interest Group (SIG) in 1998, and the first specification was released in July 1999.

Technical features

Radio Specification

There are three classes of transmitters: Class 1 outputs 100 mW for maximum range with mandatory power control, providing the greatest distance. Class 2 outputs 2.4 mW at maximum with optional power control. Class 3 has a nominal output of 1 mW, the lowest power.

Typical Bluetooth Scenario

Bluetooth supports wireless point-to-point and point-to-multipoint (broadcast) between devices in a piconet. In a Point to Point Link, there is a master-slave relationship where Bluetooth devices can function as masters or slaves. Each piconet has a maximum capacity of 1 Mbps. A Piconet is the network formed by a master and one or more slaves (maximum 7). Each piconet is defined by a different hopping channel to which users synchronize. All devices in the piconet hop together. The master’s ID and master’s clock determine the frequency hopping sequence and phase. The hopping sequence is shared with all devices on the piconet. Bluetooth devices use Time Division Duplex (TDD), and the access technique is TDMA — specifically FH-TDD-TDMA.

Ad-hoc Network – the Scatternet

A Scatternet enables inter-piconet communication. Up to 10 piconets can exist in a scatternet, and multiple piconets can operate within the same physical space. This is an ad-hoc, peer-to-peer (P2P) network.

Bluetooth Standards Documents

The Core specifications provide details of various layers of Bluetooth protocol architecture, including core protocols, cable replacement and telephony control protocols, and adopted protocols. Profile specifications define the use of Bluetooth technology to support various applications.

Profiles

Bluetooth profiles include: Generic Access Profile, Service Discovery Application Profile, Cordless Telephony Profile, Intercom Profile, Serial Port Profile, Headset Profile, Dial-up Networking Profile, Fax Profile, LAN Access Profile, Generic Object Exchange Profile, Object Push Profile, File Transfer Profile, and Synchronization Profile.

Architecture

The Bluetooth architecture consists of Core protocols (Radio, Baseband, Link Manager Protocol LMP, Logical Link Control and Adaptation Protocol L2CAP, Service Discovery Protocol SDP), Cable replacement protocol (RFCOMM), Telephony control protocol (Telephony Control Specification – binary TCS BIN), and Adopted protocols (PPP, TCP/UDP/IP, OBEX, WAE/WAP).

Core Protocols

Radio defines the technical characteristics of BT radios, including the licence-free ISM band 2.4 GHz, FHSS at 1600 Hops/sec, 1 MHz channel bandwidth, GMSK modulation, tx power from 100 mw to 1 mw, and raw transmission rate of 1 Mbps. Baseband defines the procedure to communicate with other BT devices, including formation of piconets, links in a piconet (ACL or SCO), and access of transmit resources. Link Manager Protocol (LMP) is a transactional protocol between two link management entities used to setup properties of BT links, such as device authentication and learning each other's features (SCO/ACL links, packet size, power consumption mode). Host Controller Interface (HCI) is an interface through which BT devices access the lower layers of the BT protocol stack, allowing devices to pass and receive data, execute inquiries, and request authentication. Logical Link Control and Adaptation Protocol (L2CAP) shields the specifics of BT lower layers and provides a packet interface to higher layers.

Bluetooth protocols

Service Discovery Protocol (SDP) defines a service record format containing information about services provided by attributes. Attributes are composed of an ID (name) and a value, where IDs may be Universally Unique Identifiers (UUIDs). SDP defines an inquiry/response protocol for discovering services, including searching for and browsing services. RFCOMM (based on GSM TS07.10) emulates a serial-port to support a large base of legacy (serial-port-based) applications and allows multiple “ports” over a single physical channel between two devices. Telephony Control Protocol Spec (TCS) handles call control (setup & release) and group management for a gateway serving multiple devices. Legacy protocol reuse allows reuse of existing protocols like IrDA’s OBEX or WAP for interacting with applications on phones.

Baseband

Addressing in Bluetooth uses three address types: the Bluetooth Device Address (BD_ADDR) which is a 48-bit IEEE MAC address, the Active Member Address (AM_ADDR) which is a 3-bit active slave address (with all zero being the broadcast address), and the Parked Member Address (PM_ADDR) which is an 8-bit parked slave address. This MAC address is split into three parts: the Non-significant Address Part (NAP) used for encryption seed, the Upper Address Part (UAP) used for error correction seed initialization and FH sequence generation, and the Lower Address Part (LAP) used for FH sequence generation.

Packet Structure

🔑 Definition — Access Code: A code that starts every Bluetooth packet and comes in three types: Channel Access Code (CAC) which identifies a piconet, Device Access Code (DAC) used for paging and subsequent responses, and Inquiry Access Code (IAC) used for inquiry purposes.

Inquiry Procedure

The potential master identifies devices in range that wish to participate by transmitting an ID packet with the Inquiry Access Code (IAC) in the Inquiry state. When a device receives an inquiry, it enters the Inquiry Response state, returns an FHS packet with address and timing information, and then moves to the page scan state.

Page Procedure

The master uses the device's address to calculate a page frequency-hopping sequence. The master pages with an ID packet and the Device Access Code (DAC) of a specific slave. The slave responds with a DAC ID packet. The master then responds with its FHS packet, and the slave confirms receipt with a DAC ID before moving to the Connection state.

Channel Establishment

There are seven sub-states: Inquiry, Inquiry scan, Inquiry response, Page, Page scan, Master response, and Slave response.

Link Manager Protocol

The Link Manager carries out link setup, authentication, and link configuration. Functions include Piconet Management (channel control, master-slave switch), Link Configuration (low power mode, QoS, packet type selection), Security, Authentication, and Encryption. For Channel Control, all work related to channel control is managed by the master using a polling process. The master is the first device which starts the connection, but this role can change through master-slave role switch.

Connection State

There are four connection modes: Active Mode where the device participates actively on the transmission channel and the master regularly sends a packet to the slaves (polling) to enable slaves to send packets and re-synchronize. Sniff Mode is a low consumption mode where a Bluetooth module stays synchronized in the piconet and listens at regular intervals (Tsniff) for a short instant on specified slots. Hold Mode keeps the module synchronized with even lower consumption than Sniff mode, where only the counter on the Bluetooth chip is active. At the end of the Hold period, the module returns to active mode. Park Mode means the module is no longer an active member of the piconet but remains synchronized with the master and can listen to a broadcast channel (Beacon Channel).

L2CAP

L2CAP provides connection-oriented and connectionless data services to upper layer protocols, along with protocol multiplexing and demultiplexing capabilities. It handles segmentation and reassembly of large packets. L2CAP permits higher level protocols and applications to transmit and receive L2CAP data packets up to 64 kilobytes in length.

Links between Master and Slave

Two types of links exist: Synchronous Connection Oriented (SCO) allocates fixed bandwidth between point-to-point connection of master and slave. The master maintains the link using reserved slots and can support three simultaneous links. SCO provides bandwidth reservation/QoS, and no retransmissions are required or done in this mode. Asynchronous Connectionless (ACL) is a point-to-multipoint link between the master and all slaves. Only a single ACL link can exist, and 1, 3, or 5 slot packets are defined.

Flow Specification Parameters

QoS parameters in L2CAP define traffic flow specification indicating the performance level that the sender will attempt to achieve. These include: Service type, Token rate (bytes/second), Token bucket size (bytes), Peak bandwidth (bytes/second), Latency (microseconds), and Delay variation (microseconds).

⭐ Key Takeaways

Bluetooth is an open, low-cost, low-power, short-range radio technology operating in the 2.4 GHz ISM band that uses Frequency Hopping Spread Spectrum with 1600 hops/sec and Time Division Duplex (TDD). Devices form piconets (one master, up to 7 active slaves) using FH-TDD-TDMA access, and multiple piconets can interconnect to form scatternets. The protocol stack includes core protocols (Radio, Baseband, LMP, L2CAP, SDP), cable replacement (RFCOMM), and telephony control protocols. Two link types exist: SCO for fixed-bandwidth, real-time traffic without retransmissions, and ACL for packet-switched, point-to-multipoint data with retransmissions possible. Bluetooth supports four connection states—Active, Sniff, Hold, and Park—for power management, with Park being the lowest power mode where the device is no longer an active member but remains synchronized.

🧠 Quick Revision Questions

1. What is the purpose of the Inquiry procedure in Bluetooth, and what packet is transmitted by the master?
2. Explain the difference between SCO (Synchronous Connection Oriented) and ACL (Asynchronous Connectionless) links in terms of bandwidth, retransmissions, and connection topology.
3. What are the four connection states in Bluetooth, and how do they differ in terms of power consumption and synchronization?
4. How does a piconet differ from a scatternet, and what is the maximum number of piconets that can exist in a scatternet?
5. What are the three types of Bluetooth addresses (BD_ADDR, AM_ADDR, PM_ADDR), and what is the bit length of each?

📘 Lecture 40 — High Rate Wireless Personal Area Networks (WPAN)

📖 Overview: This lecture completes the discussion on Bluetooth by covering IP over Bluetooth and security, then transitions to IEEE 802.15.3, the high-rate WPAN standard. It provides a detailed examination of 802.15.3's architecture, coordination mechanisms, superframe structure, channel time management, power saving modes, and MAC frame format. Understanding this lecture is critical for comparing WPAN standards and grasping how high-rate, QoS-capable personal area networks operate.

🗂️ Topics Covered

This lecture begins with IP over Bluetooth versions 1.0 and 1.1, then discusses Bluetooth Security and presents a comparative table of all WPAN standards (802.15.1, 802.15.2, 802.15.3, 802.15.4). The main focus is an extensive overview of IEEE 802.15.3, including its motivation, topology with parent, child, and neighbor piconets, coordination processes (starting, handing over, creating child/ending piconets, association/disassociation), superframe structure with beacon, CAP, and CTAP, channel time management with dynamic channel selection, three power management modes (DSPS, PSPS, APS), and the MAC frame format with its ACK policies.

📝 Lecture Summary

IP Over Bluetooth

The lecture revisits the concept of running the Internet Protocol (IP) over Bluetooth, referencing both IP over Bluetooth v 1.0 and IP over Bluetooth v 1.1 as earlier specifications that enabled internet connectivity for Bluetooth devices.

Bluetooth Security

Security for the piconet is defined as one of two modes. Mode 0 (Open) means security membership is not required, and payload protection (data integrity or encryption) is not used by the MAC, though the PNC may use a list of DEV addresses to admit or deny entry. Mode 1 (Secure membership and payload protection) provides both membership security and payload protection.

WPAN Standards

A comprehensive table compares the four IEEE 802.15 WPAN standards. 802.15.1 (Bluetooth) offers 1 Mbps throughput for cell phones, PDAs, printers, and headsets with QoS suitable for voice. 802.15.2 addresses the coexistence of Bluetooth and 802.11b. 802.15.3 (High-rate WPAN) provides >20 Mbps for low-power, low-cost portable digital imaging and multimedia with very high QoS. 802.15.4 (Low-rate WPAN) operates at <0.25 Mbps for industrial, agricultural, medical, and sensor applications with relaxed QoS needs.

IEEE 802.15.3 - Overview

This high-data-rate WPAN is a potential future standard, motivated by the need for data, high-quality TV, and home cinema. It features a dynamic topology where mobile devices often join and leave the piconet with short connection times, multiple power management modes, and a secure network. It operates in the 2.4 GHz PHY with either 4 channels (high density) or 3 channels (to coexist with 802.11b). It supports 5 data rates: 11 Mbps (QPSK), 22 Mbps (DQPSK without coding), 33 Mbps (16QAM), 44 Mbps (32QAM), and 55 Mbps (64QAM). It is based on piconets in a personal space, analogous to a LAN in a larger area, where Data Devices (DEVs) establish peer-to-peer communication. A Piconet Coordinator (PNC) manages QoS requirements, power save modes, and access control. A new piconet created on the same channel as an existing PNC is called a child/neighbor piconet; if channel access is also controlled by the parent PNC, it is a dependent piconet.

IEEE 802.15.3 – Topology

The topology diagram shows a Parent Piconet Controller managing a piconet that includes Piconet Devices. A Child/Neighbor Piconet Controller may establish its own piconet, maintaining a Piconet Relationship with the parent. Data transmission is peer-to-peer. An Independent Piconet Controller operates without a parent relationship.

802.15.3 - Coordination in IEEE 802.15.3

The MAC is designed for fast connection time, ad hoc networks, QoS data transport, security, dynamic membership, and efficient data transfer.

• Starting a piconet: A DEV scans for the best channel and sends out beacons, becoming the PNC. If no channels are available, it establishes a child or neighbor piconet instead. This process does not ensure the "most capable" PNC is initially selected.
• Handing over control: When a DEV associates, the PNC checks its capabilities to see if it is more capable. The handover process maintains all existing time allocations to avoid interruption in delivery.
• Creating a child piconet: A child piconet is formed under an established (parent) piconet. It is useful for extending coverage area or shifting computational/memory requirements. It uses a distinct Piconet ID (PNID) and acts autonomously except for its dependence on a private CTA from the parent piconet.
• Ending a piconet: If the PNC stops operation with no other capable DEVs, it places a PNC Shutdown information element (IE) in the beacon. If the PNC leaves abruptly, the piconet stops. After the association timeout period (ATP) expires, a capable DEV can start a new piconet. The parent PNC can end a dependent piconet via a Disassociation Request command.
• Association and disassociation: Associating gives a DEV a unique DEVID (one octet) to save overhead compared to the 8-octet DEV address. The association process optionally provides service information and PNC capabilities. The PNC broadcasts info about all DEVs. Disassociation invalidates the DEVID, which the PNC cannot reissue until a waiting period expires.

🔑 Definition — DEVID: A unique one-octet identifier assigned to each associated DEV, used instead of the 8-octet DEV address to save overhead. 🔑 Definition — Child Piconet: A piconet formed under an established parent piconet, using a distinct PNID and a private CTA from the parent.

IEEE 802.15.3 – Superframe

The superframe is composed of three parts:

1. The beacon: Sets timing allocations and communicates management information for the piconet. It contains piconet synchronization parameters and Information Elements (IEs).
2. The contention access period (CAP): Optional period used to communicate commands and/or asynchronous data using CSMA/CA with a backoff scheme.
3. The channel time allocation period (CTAP): Composed of channel time allocations (CTAs), including management CTAs (MCTAs). It uses standard TDMA where DEVs have specified time windows. MCTAs may be placed at any position in the superframe by the PNC.

IEEE 802.15.3 – CAP and CTA

The CAP allows contention via CSMA/CA. The CTAP uses a standard TDMA protocol for contention-free access, enabling power saving and QoS. There are three types of CTAs:

• Private CTA: Used for dependent piconets.
• Dynamic CTA: Scheduled on a superframe-by-superframe basis.
• Pseudo-Static CTA: Only for isochronous streams. A DEV is allowed to transmit during a CTA as long as the number of consecutive lost beacons is less than mMaxLostBeacons.

Channel time management

There are three methods for communicating data between DEVs: sending asynchronous data in the CAP, allocating channel time for isochronous streams in the CTAP, and allocating asynchronous channel time in the CTAP. For dynamic channel selection, the PNC can change the piconet's channel without user intervention. To evaluate channels, the PNC can: gather info from DEVs using the Channel Status Request command, perform a passive scan, or request other DEVs to scan using the Remote Scan Request command. 💡 Why this matters: Dynamic channel selection is critical in the noisy ISM bands to maintain QoS.

Power Management

Three techniques enable DEVs to turn off for one or more superframes:

1. Device synchronized power save (DSPS) mode: Allows DEVs to wake up and exchange traffic at the same time, making it easy for other DEVs to determine when a DSPS DEV is available.
2. Piconet-synchronized power save (PSPS) mode: Allows DEVs to sleep at intervals defined by the PNC. The DEV sends a request to the PNC to enter this mode.
3. Asynchronous power save (APS) mode: The only responsibility is to communicate with the PNC before the end of its ATP to preserve membership.

MAC Frame format

The MAC frame format includes fields for frame control, destination and source IDs, fragmentation control, stream index, and the frame payload. A key component is the ACK Policy.

• NO ACK: Used for frames that don't require guaranteed delivery, where retransmission would arrive too late or an upper layer is handling ACKs.
• Immediate-ACK (Imm-ACK): Each frame is individually ACKed upon reception.
• Delayed-ACK (Dly-ACK): The source sends multiple frames without intervening ACKs. The ACKs are grouped into a single response frame sent when requested by the source. This decreases overhead compared to Imm-ACK while still verifying delivery. 🔑 Definition — Dly-ACK (Delayed ACK): An ACK policy where multiple data frames are sent before a single aggregated ACK is requested, reducing overhead. 📌 Example: In a video stream, using Imm-ACK for each video frame might cause high overhead. Using Dly-ACK, the source could send 5 video frames, then request a single ACK frame that acknowledges all 5 frames, reducing the total number of transmitted frames.

⭐ Key Takeaways

The IEEE 802.15.3 High-Rate WPAN is designed for high-throughput, low-latency multimedia applications, operating at up to 55 Mbps in the 2.4 GHz band. Its MAC relies on a Piconet Coordinator (PNC) to manage a star topology with peer-to-peer data, using a superframe structure composed of a Beacon, optional CAP (CSMA/CA), and CTAP (TDMA with CTAs). Key coordination features include selective PNC handover, child piconet creation for coverage/capability extension, and dynamic channel selection to avoid interference. Power saving is achieved through three distinct modes (DSPS, PSPS, APS), and efficient data transfer is supported by three ACK policies (No ACK, Imm-ACK, Dly-ACK). The 1-octet DEVID replaces the 8-octet hardware address to reduce overhead.

🧠 Quick Revision Questions

1. What are the three parts of an IEEE 802.15.3 superframe, and what is the primary purpose of each?
2. Explain the difference between a child piconet and a neighbor piconet, and when a dependent piconet is created.
3. What is the advantage of using a DEVID (1 octet) instead of the DEV's hardware address (8 octets)?
4. Compare the three power save modes (DSPS, PSPS, APS) in terms of how a DEV determines its sleep/wake schedule.
5. A source DEV sends a burst of 10 data frames and wants to verify delivery with minimal overhead. Which ACK policy should it use, and why not the other two?

📘 Lecture 41 — IEEE 802.15.4/ZigBee

📖 Overview: This lecture introduces ZigBee and the IEEE 802.15.4 standard for low-power, low-data-rate wireless mesh networking. It covers the architecture, device types, topologies, addressing, channel access mechanisms, and superframe structure, emphasizing applications in monitoring and control.

🗂️ Topics Covered

The lecture begins with an overview of ZigBee, including its definition, market features, and target markets, followed by the ZigBee/802.15.4 architecture and general characteristics. It then details IEEE 802.15.4 basics, device types (FFD vs RFD), topologies (star, peer-to-peer), network extension, device addressing, PHY layer overview, frequency bands and data rates, general radio specifications, and channel access mechanisms (slotted/unslotted CSMA/CA). The data transfer model and superframe structure are also discussed.

📝 Lecture Summary

What is ZigBee Alliance?

An organization with a mission to define reliable, cost effective, low-power, wirelessly networked, monitoring and control products based on an open global standard. The alliance provides interoperability, certification testing, and branding.

IEEE 802.15.4: What is ZigBee?

ZigBee is a standard for mesh networking, providing reliability through meshed connectivity. It is designed for low power applications, enabling very long battery life. It offers a low data rate (20-250 Kb/sec, depending on band), is very secure with AES-128 encryption available, and is self configuring, allowing ad hoc networks and ease of installation.

ZigBee/IEEE 802.15.4 Market Feature

Key features include: low power consumption, low cost, low offered message throughput, support for large network orders (<= 65k nodes), low to no QoS guarantees, and flexible protocol design suitable for many applications.

ZigBee/802.15.4 Architecture

The architecture is layered, with the PHY and MAC layers defined by IEEE 802.15.4, and the NWK (Network) layer, APL (Application) layer, and ZDO (ZigBee Device Object) defined by the ZigBee Alliance. The Security Service Provider is also part of the architecture.

ZigBee/802.15.4 Technology: General Characteristics

• Data rates of 250 kbps, 20 kbps and 40 kpbs.
• Star or Peer-to-Peer operation.
• Support for low latency devices.
• CSMA-CA channel access.
• Dynamic device addressing.
• 16 channels in the 2.4GHz ISM band, 10 channels in the 915MHz ISM band, and one channel in the European 868MHz band.

IEEE 802.15.4 Basics

802.15.4 is a simple packet data protocol for lightweight wireless networks. Channel access is via Carrier Sense Multiple Access with collision avoidance (CSMA/CA) and optional time slotting.

IEEE 802.15.4 Device Types

There are two different device types:

• A full function device (FFD) can operate in three modes: Device, Coordinator, and PAN coordinator.
• A reduced function device (RFD) can only operate in Device mode.

FFD vs RFD

• Full function device (FFD): Can operate in any topology, is network coordinator capable, and can talk to any other device.
• Reduced function device (RFD): Limited functionality, typically used as an end device.

Extending ZigBee Networks

A ZED (ZigBee Extension Device) is a ZigBee router with a wire interface. It joins two or more radio disjoint PANs and provides a “wormhole” within a single PAN, offering a low cost, high reliability link within the radio network. It “extends” the ZigBee network layer.

Device Addressing

Each independent PAN will select a unique PAN identifier. Addressing modes include:

• Star: Network (64 bits) + device identifier (16 bits)
• Peer-to-peer: Source/destination identifier (64 bits)

IEEE 802.15.4 PHY Overview

PHY functionalities include:

• Activation and deactivation of the radio transceiver
• Energy detection within the current channel
• Link quality indication for received packets
• Clear channel assessment for CSMA-CA
• Channel frequency selection
• Data transmission and reception

Frequency Bands and Data Rates

The standard specifies two PHYs:

• 868 MHz/915 MHz DSSS PHY (11 channels): 1 channel (20 Kb/s) in European 868 MHz band, 10 channels (40 Kb/s) in 915 MHz ISM band.
• 2450 MHz DSSS PHY (16 channels): 16 channels (250 Kb/s) in 2.4 GHz band.

🔑 Definition — DSSS: Direct Sequence Spread Spectrum, a modulation technique used to spread the signal over a wider frequency band.

General Radio Specifications

• Transmit Power: Capable of at least –3 dBm.
• Receiver Sensitivity: -85 dBm (2.4 GHz) / -91 dBm (868/915 MHz).
• Link quality indication: May be implemented using signal to noise ratio estimation or receiver energy detection.

Channel Access Mechanism

Two types of channel access mechanisms, based on network configuration:

• In non-beacon-enabled networks → unslotted CSMA/CA channel access mechanism.
• In beacon-enabled networks → slotted CSMA/CA channel access mechanism, where the superframe structure is used.

CSMA/CA Algorithm

Each device shall maintain three variables for each transmission attempt:

• NB: Number of slots the CSMA/CA algorithm is required to backoff while attempting the current transmission.
• BE: The backoff exponent, related to how many backoff periods a device shall wait before attempting to assess a channel.
• CW: (A special design variable).

Data Transfer Model

• Data transferred from device to coordinator: The device sends data to the coordinator.
• Data transferred from coordinator to device: The coordinator sends data to the device.

Superframe

• In the CFP (Contention Free Period), a GTS (Guaranteed Time Slot) may consist of multiple slots, all assigned to a single device, for either transmission (t-GTS) or reception (r-GTS).
• In the CAP (Contention Access Period), each “contention slot” is of 20 symbols long.

⭐ Key Takeaways

ZigBee and IEEE 802.15.4 are designed for low-power, low-data-rate wireless control and monitoring networks, offering mesh networking for reliability. The standard defines two device types: FFD (full function) and RFD (reduced function), supporting star and peer-to-peer topologies. Channel access uses either slotted or unslotted CSMA/CA, depending on beacon mode. The superframe structure includes both a Contention Access Period (CAP) and a Contention Free Period (CFP) with Guaranteed Time Slots (GTS). Key features include AES-128 security, dynamic addressing, and operation in the 868 MHz, 915 MHz, and 2.4 GHz frequency bands.

🧠 Quick Revision Questions

1. What are the two device types defined in IEEE 802.15.4, and what are their capabilities?
2. Explain the difference between slotted and unslotted CSMA/CA channel access mechanisms.
3. What are the key functionalities of the PHY layer in IEEE 802.15.4?
4. Describe the three variables (NB, BE, CW) maintained for each CSMA/CA transmission attempt.
5. What is the purpose of a GTS in the superframe structure, and how is it assigned?

📘 Lecture 42 — IEEE 802.16

📖 Overview: This lecture introduces IEEE 802.16, commonly known as WiMAX, a family of standards for wireless metropolitan area networks (WMAN). It covers the evolution of the standard, its physical layer specifications, and the MAC layer design, emphasizing its role in providing broadband wireless access as an alternative to cable and DSL, particularly for developing and rural areas.

🗂️ Topics Covered

The lecture begins with an introduction to WiMAX basics and the IEEE 802.16 overview, including the formation of the WiMAX Forum. It then details the evolution of the 802.16 standard from 802.16 to 802.16e, and characteristics of different frequency ranges (10-66 GHz and 2-11 GHz). The need for broadband wireless access is discussed, followed by the network architecture and a comparison with 802.11. The physical layer is examined in depth, covering five modes, OFDM, OFDMA, and other features like HARQ and MIMO. Finally, the MAC layer and its connection-oriented, QoS-focused design are presented.

📝 Lecture Summary

WiMAX Basics

WiMAX, or IEEE 802.16, is an effort by the IEEE to develop a standards-based air interface for licensed and unlicensed radio frequencies from 2 to 66 GHz. The approach is to develop a common MAC (Media Access Control) sublayer of the data link layer, and then offer differing physical layers to accommodate the needs of different frequencies and regulatory environments. The IEEE believes existing wireless data service approaches lack long-term growth potential outside of the local area network.

IEEE 802.16 Overview

The 802.16 family of standards is for wireless metropolitan area networks (WMAN). It provides broadband (voice, data, video) connectivity and specifies the air interface, including the MAC layer and multiple physical layer specifications. 802.16e is an amendment to 802.16d (fixed or nomadic wireless broadband) to support mobility at vehicular speeds up to 75 mph.

🔑 Definition — WiMAX Forum: Formed in June 2001 to promote conformance and interoperability of the 802.16 standard. It develops "system profiles" that define mandatory and optional features of the standard.

802.16 Evolution

• 802.16: Original fixed wireless broadband air interface for 10 – 66 GHz, line-of-sight only, for Point-to-Multi-Point applications.
• 802.16a: Extension for 2-11 GHz, non-line-of-sight, for Point-to-Multi-Point applications.
• 802.16d: Revised and replaced previous versions; includes WiMAX System Profiles.
• 802.16e: MAC/Physical layer enhancements to support subscribers moving at vehicular speeds.

Characteristics of 802.16 Frequency Ranges

• 10 - 66 GHz: Short wavelength, Line-of-Sight (LOS) required, negligible multipath. Common frequencies are 10.5, 25, 26, 31, 38, and 39 GHz.
• 2 – 11 GHz: Longer wavelength, LOS not required, improved range and in-building penetration, but multipath effects may be significant.

IEEE 802.16 Standards Table

Why do we need broadband wireless access?

Broadband wireless access fills the gap between high data rate wireless LAN and very mobile cellular networks. It serves as a wireless alternative to cable and DSL for last-mile broadband access, especially in developing countries and rural areas, and provides high-speed mobile data and telecommunications services.

Physical Layer

There are five physical layer modes for 802.16: WirelessMAN-SC (10-66 GHz), WirelessMAN-SCa (Below 11GHz – Licensed bands), WirelessMAN-OFDM (Below 11GHz – Licensed bands), WirelessMAN-OFDMA (Below 11GHz – Licensed bands), and WirelessHUMAN (Below 11GHz – Licensed-exempt bands).

Comparison 802.11 and 802.16

• 802.11: Optimized for shorter-range topologies, not designed for a large number of users. Range < 300 feet. Data rate of 2.7 bps/Hz peak. Scalability of 1-10 CPE. No QoS.
• 802.16: Designed for longer distances and more difficult environments (e.g., heavily wooded areas). Range < 30 miles (typical 3-4). Data rate of 5 bps/Hz peak. Scalability of 1-hundreds CPE. QoS provided via service flows.

🔑 Definition — Orthogonal Frequency Division Multiplexing (OFDM): A multiplexing technique that divides the channel into multiple orthogonal sub-channels. The input data stream is divided into several substreams of a lower data rate (increased symbol duration), and each substream is modulated and simultaneously transmitted on a separate sub-channel. It provides high spectral efficiency, resilience to interference, and low multi-path distortion.

🔑 Definition — Orthogonal Frequency Division Multiple Access (OFDMA): A multiple-access/multiplexing scheme that provides multiplexing operation of data streams from multiple users onto the downlink sub-channels and uplink multiple access by means of uplink sub-channels. It dynamically assigns a subset of sub-channels to individual users. WirelessMAN-OFDMA is based on scalable OFDMA (SOFDMA) and supports scalable channel bandwidths from 1.25 to 20 MHz.

Other Physical Layer Features

• Hybrid automatic repeat request (HARQ): Adjusts automatically to channel conditions. The receiver saves failed transmission attempts to help future decoding, so every transmission helps increase the probability of success.
• Multiple-in Multiple-out (MIMO): Uses multiple antennas on sender and receivers. It takes advantage of multi-path to increase spectral efficiency.

TDD

The 802.16e PHY supports TDD and Full and Half-Duplex FDD operation. TDD requires system-wide synchronization to counter interference. TDD is the preferred duplexing mode because it enables adjustment of the downlink/uplink ratio for asymmetric traffic, only requires a single channel (unlike FDD), and has less complex, less expensive transceiver designs.

MAC Layer

The 802.16 MAC layer is connection-oriented. A fundamental premise of the MAC architecture is Quality of Service (QoS), which is provided via service flows.

⭐ Key Takeaways

A student must remember that WiMAX (IEEE 802.16) is a standard for Wireless Metropolitan Area Networks (WMAN) providing broadband connectivity. The evolution from 802.16 to 802.16e introduced mobility and support for non-line-of-sight (NLOS) with distinct frequency ranges (10-66 GHz for LOS, 2-11 GHz for NLOS). The physical layer offers multiple modes including OFDM and OFDMA, with the latter being scalable (SOFDMA). The critical difference between Wi-Fi (802.11) and WiMAX (802.16) lies in range, scalability, and Quality of Service (QoS), with WiMAX designed for longer distances and large user bases. Finally, the MAC layer is connection-oriented and prioritizes QoS through service flows, while the physical layer supports features like HARQ, MIMO, and TDD for efficient and robust wireless communication.

🧠 Quick Revision Questions

1. What frequency ranges are covered by IEEE 802.16, and what are the key propagation characteristics for each?
2. Compare and contrast the 802.16 physical layer modes (e.g., WirelessMAN-SC and WirelessMAN-OFDMA).
3. How does 802.16 address Quality of Service (QoS) at the MAC layer?
4. Explain the key differences between 802.11 and 802.16 in terms of range, scalability, and QoS.
5. What is the difference between OFDM and OFDMA?

📘 Lecture 43 — IEEE 802.16 MAC/QoS

📖 Overview: This lecture covers the IEEE 802.16 standard (WiMAX), focusing on its MAC layer and QoS mechanisms. It explains the reference model, burst profiles, convergence sublayers, MAC PDU format and transmission, fragmentation/packing, request/grant schemes, uplink service classes, power management, and handoff. Understanding these concepts is crucial for grasping how WiMAX provides broadband wireless access with Quality of Service guarantees.

🗂️ Topics Covered

The lecture covers the reference model, adaptive burst profiles, ATM and packet convergence sublayers, MAC PDU format and transmission including fragmentation and packing, request/grant schemes (GPSS vs GPC), classes of uplink service (UGS, rtPS, ertPS, nrtPS, BE), power management with sleep and idle modes, handoff methods (HHO, FBSS, MDHO), and WiMAX basics including 802.16 evolution and characteristics compared to 802.11.

📝 Lecture Summary

Reference Model

The reference model for IEEE 802.16 defines the interaction between different layers and sublayers. The Service Specific Convergence Sublayer (CS) interfaces with higher layers, while the MAC Common Part Sublayer (MAC CPS) handles core MAC functions. The Security Sublayer provides authentication and encryption. Below this is the Physical Layer (PHY). The CS classifies higher-layer SDUs and maps them to appropriate MAC connections and service flows. The MAC CPS is responsible for fragmentation, packing, scheduling, and bandwidth allocation.

🔑 Definition — Service Data Unit (SDU): Data units exchanged between adjacent layers. 🔑 Definition — Protocol Data Unit (PDU): Data units exchanged between peer entities. 🔑 Definition — Connection and Connection ID (CID): A unidirectional mapping between MAC peers over the airlink, uniquely identified by a CID. 🔑 Definition — Service Flow and Service Flow ID (SFID): A unidirectional flow of MAC PDUs on a connection that provides a particular QoS, uniquely identified by an SFID.

Adaptive Burst Profiles

A burst profile defines the combination of modulation and FEC (Forward Error Correction) used for a transmission. Burst profiles are dynamically assigned according to link conditions, on a burst-by-burst basis per subscriber station. This allows a trade-off between capacity and robustness in real time, roughly doubling capacity for the same cell area. The burst profile for the downlink broadcast channel is well-known to all stations. Each burst profile has a mandatory exit threshold and a minimum entry threshold. An SS can request a less robust DIUC (Downlink Interval Usage Code) once above the minimum entry level, and must request fallback to a more robust DIUC once at the mandatory exit threshold.

💡 Why this matters: Adaptive burst profiles are key to WiMAX's spectral efficiency, allowing it to maximize throughput under favorable conditions while ensuring reliability in harsh environments.

ATM Convergence Sublayer

The ATM Convergence Sublayer provides support for VP (Virtual Path) switched connections and VC (Virtual Channel) switched connections. It supports end-to-end signaling of dynamically created connections like SVCs (Switched Virtual Circuits) and soft PVCs (Permanent Virtual Circuits). It also performs ATM header suppression and provides full QoS support.

Packet Convergence Sublayer

The Packet Convergence Sublayer initially supports Ethernet, IPv4, and IPv6. It performs payload header suppression and provides full QoS support. Future support for PPP and MPLS is possible. Upon entering the network, an SS (Subscriber Station) is assigned three management connections in each direction, reflecting three different QoS requirements:

• Basic connection: Used for short, time-critical MAC and RLC (Radio Link Control) messages.
• Primary management connection: Used for longer, more delay-tolerant messages like authentication and connection setup.
• Secondary management connection: Used for standards-based management messages like DHCP, Trivial FTP, and SNMP.

In addition, SSs are allocated transport connections for contracted services. Transport connections are unidirectional to facilitate different uplink and downlink QoS and traffic parameters.

MAC PDU Format

A MAC PDU consists of a fixed-length MAC header, a variable-length payload, and an optional CRC (Cyclic Redundancy Check). Two header formats are defined, distinguished by the HT field: the Generic MAC header and the Bandwidth Request header. One or more MAC sub-headers may be part of the payload, indicated by a Type field in the Generic MAC header. Three types of MAC sub-header are defined:

• Grant Management sub-header: Used by an SS to convey bandwidth management needs to its BS.
• Fragmentation sub-header: Contains information indicating the presence and orientation of any fragments of SDUs.
• Packing sub-header: Used to indicate the packing of multiple SDUs into a single PDU.

The Grant Management and Fragmentation sub-headers may be inserted immediately following the generic header. The Packing sub-header may be inserted before each MAC SDU.

MAC PDU Transmission

MAC PDUs are transmitted in PHY bursts. A single PHY burst can contain multiple concatenated MAC PDUs. The PHY burst can contain multiple FEC blocks, and MAC PDUs may span FEC block boundaries. The TC (Transmission Convergence) layer between the MAC and the PHY allows for capturing the start of the next MAC PDU in case of erroneous FEC blocks.

Fragmentation / Packing

Fragmentation is the partitioning of a MAC SDU into fragments transported in multiple MAC PDUs. The Fragmentation sub-header contains:

• 2-bit Fragmentation Control (FC): Indicates if the fragment is un-fragmented, first, continuing, or last.
• 3-bit Fragmentation Sequence Number (FSN): Used to detect missing continuing fragments.

Packing is the process of combining multiple MAC SDUs (or fragments thereof) into a single MAC PDU. Packing can be used on connections with variable-length or fixed-length MAC SDUs, and in certain situations can save up to 10% of system bandwidth. For variable-length SDUs, a 2-byte Packing Sub-Header is inserted before each SDU, containing an 11-bit length field, 2-bit fragmentation control (FS), and 3-bit fragmentation sequence number (FS).

Downlink Transmissions

Downlink bursts can be of two kinds: TDM and TDMA. All bursts are identified by a DIUC (Downlink Interval Usage Code). TDMA bursts have a resync preamble, allowing for more flexible scheduling. Each burst may contain data for several terminals. The SS must recognize PDUs with known CIDs. The DL-MAP message signals downlink usage.

Request/Grant Scheme

The Request/Grant scheme is self-correcting. Bandwidth requests are always per connection, while grants are either per connection (GPC) or per subscriber station (GPSS).

• GPSS (Grant per Subscriber Station): The BS grants bandwidth to the SS, which can then re-distribute bandwidth among its connections, maintaining QoS and service-level agreements.
• GPC (Grant per Connection): The BS grants bandwidth to a specific connection. This has higher overhead but allows for a simpler SS.

Classes of Uplink Service

Five classes of uplink service are defined:

1. UGS (Unsolicited Grant Service): For real-time fixed-size data packets like VoIP. No explicit bandwidth requests are issued by the SS. The SS may include a Grant Management (GM) sub-header with a Slip indicator (backlog due to clock skew) and a Poll-me bit.
2. rtPS (Real-time Polling Service): For real-time variable-rate services like streaming audio/video. The SS is prohibited from using contention requests and is polled frequently enough to meet delay requirements.
3. ertPS (Extended Real-time Polling Service): For VoIP with activity detection. Combines the unsolicited grant of UGS with the dynamic size variation of rtPS.
4. nrtPS (Non-real-time Polling Service): For non-real-time services like FTP. Polls are issued less frequently than rtPS. The SS is allowed to use contention requests.
5. BE (Best Effort): For data transfer, web browsing. No QoS guarantees. Allowed to use contention requests.

🔑 Definition — UGS: Provides fixed-size grants on a real-time periodic basis, eliminating the need for explicit bandwidth requests. 🔑 Definition — rtPS: Provides periodic unicast request opportunities, allowing the SS to specify the size of the desired grant.

Power Management / Handoff

Power management utilizes Sleep mode and Idle mode to enable power-efficient MS operation. In Idle mode, the MS becomes periodically available for broadcast messages without registering at a BS.

Three handoff methods are supported:

• Hard Handoff (HHO) - Required: A "break-before-make" method, optimized to keep handoff delays below 50 milliseconds.
• Fast Base Station Switching (FBSS) - Optional
• Macro Diversity Handover (MDHO) - Optional

WiMAX Basics / 802.16 Evolution

The lecture contrasts 802.16 with 802.11 (Wi-Fi), noting that 802.16 is designed for metropolitan area networks (MANs) with QoS guarantees, longer range, and centralized scheduling, while 802.11 is designed for local area networks (LANs) with contention-based access and no QoS guarantees. The Physical Layer uses multiple access techniques, HARQ (Hybrid Automatic Repeat reQuest), and MIMO (Multiple Input Multiple Output).

⭐ Key Takeaways

The IEEE 802.16 standard provides a comprehensive MAC and QoS framework for broadband wireless access. The key differentiator from Wi-Fi is its connection-oriented MAC with guaranteed QoS, supporting five distinct uplink service classes (UGS, rtPS, ertPS, nrtPS, BE) tailored to different traffic types. Adaptive burst profiles dynamically optimize capacity and robustness, while the request/grant scheme (GPSS/GPC) efficiently allocates bandwidth. Fragmentation and packing improve efficiency, and power management (sleep/idle modes) along with three handoff methods (HHO, FBSS, MDHO) support mobile operation. The convergence sublayers enable seamless integration with various higher-layer protocols (ATM, Ethernet, IP).

🧠 Quick Revision Questions

1. What are the five uplink service classes in IEEE 802.16, and which traffic type is each best suited for?
2. Explain the difference between GPSS and GPC bandwidth grant schemes in terms of where scheduling decisions are made.
3. What is the purpose of the Fragmentation sub-header, and what two key fields does it contain?
4. How does an adaptive burst profile improve system performance, and what is the role of the DIUC?
5. Describe the difference between Sleep mode and Idle mode in IEEE 802.16 power management.

📘 Lecture 44 — 4G Issues

📖 Overview: This lecture explores the fundamental concepts and challenges of 4G wireless networks, focusing on heterogeneous network integration, mobility management, and handoff mechanisms. It provides a comprehensive understanding of how 4G enables "Always Best Connected" service across diverse wireless technologies and addresses critical issues including QoS, security, and standardization.

🗂️ Topics Covered

The lecture covers 4G overview and characteristics, heterogeneous wireless networks, evolution of 4G, issues in 4G systems, mobility management including location and handoff management, handoff types (horizontal vs vertical), the three-step vertical handoff process, VHO issues, standardization efforts from IETF, IEEE 802.21, and 3GPP, and QoS considerations including packet, transaction, circuit, and user-level QoS with end-to-end QoS parameters.

📝 Lecture Summary

4G Overview

4G mobile communication systems have different meanings to different people. For some, it is merely a higher-capacity new radio interface, while for others it is an inter-working of cellular and wireless LAN technologies that employs a variant of the Mobile IPv6 mobility management protocol for inter-system handoff. 4G systems will provide higher data rates, with traffic demand estimates suggesting that to accommodate foreseen traffic in the 2010-2020 timeframe, 4G must achieve a manifold capacity increase compared to predecessors.

The core vision of 4G is an "Always Best Connected" (ABC) system that enables global roaming across multiple wireless and mobile networks. These include Cellular networks, Wireless LANs, Wireless PANs, mobile WiMAX, and others. 4G networks will play a key role in integrating various network architectures and technologies to achieve a seamless wireless access infrastructure.

4G provides high-speed, large volume, good quality, and global coverage to roam between different types of technologies. It is widely accepted that individual wireless and wireline access networks will interface to core and/or backbone network elements over the IP protocol. These wireless access networks are expected to have a dynamic address assignment mechanism (e.g., DHCP, SLP, IPv6) capable of associating IP addresses to wireless interfaces, and a transparent IP forwarding service accessible over the logical termination of the IP layer.

💡 Why this matters: The ABC concept is the foundational philosophy of 4G—users should seamlessly connect to the best available network without manual intervention.

Heterogeneous Wireless Networks

A heterogeneous wireless network is a mixture of co-existing radio access technologies. These networks feature different access technologies (radio interfaces) with overlapping coverage, different network architectures and protocols for transport, routing, and mobility management, different service demands from mobile users (low-data rate, high-data rate, voice, multimedia), and different operators in the market.

Evolution of 4G

The evolution from 3G to 4G involves transitioning from cellular-based networks to all-IP networks. This evolution includes moving from older cellular technologies (2G/3G) toward integrated systems that combine multiple access technologies. The heterogeneous network architecture shows different radio access networks (e.g., WCDMA, CDMA2000, WLAN) connected to a common IP-based core network, enabling seamless inter-working between diverse technologies.

Issues in 4G

Several issues need resolution in 4G systems:

• Access coordination across different networks
• Handoff management between heterogeneous networks
• Location coordination for tracking mobile terminals
• Resource coordination to add new users
• Support for multicasting across different networks
• Support for quality of service (QoS) end-to-end
• Wireless security and authentication
• Network failure and backup mechanisms
• Pricing and billing across different operators

Mobility Management

Mobility management consists of two main components:

• Location Management: enables the system to track the location of mobile terminal (MT) through location updates and paging
• Handoff Management: the process by which an MT keeps its connection when it moves from one point of attachment (base station or access point) to another

🔑 Definition — Handoff Management: The process of maintaining a mobile terminal's connection as it moves between different points of attachment.

Handoff Management Requirements

Effective handoff management requires:

• Low signalling and processing overhead
• Minimum packet loss and delay (seamless HO)
• Guaranteeing QoS during the process and transfer of context
• Use of any "triggers" or metrics available to decide when and where to handoff
• Efficient use of network and MT resources
• Enhanced scalability, reliability, and robustness
• Allow inter-technology handoff (VHO)

Handoff Types

Two main types of handoffs exist:

Homogeneous (Horizontal) Handovers:

• Occur within a single network (Localized Mobility)
• Have limited opportunities for handoff
• Mainly use received signal strength (RSS) to decide handoff

Heterogeneous (Vertical) Handovers:

• Occur across different networks (Global Mobility)
• Are more opportunistic in nature
• Handoff metrics include: RSS, offered bandwidth, price, power consumption, speed

Vertical Handoff Process

The VHO process consists of three steps:

Step 1: "System Discovery" The mobile terminal must know which wireless networks are reachable through:

• Periodic beacons from AP
• Signal measurements
• Handoff metrics (network information) gathering: Bandwidth, cost, delay, SNR, power, etc.
• Periodic network scanning
• All interfaces always on

Step 2: "Handoff Decision" The MT evaluates handoff policies such as:

• "Always use the cheapest network"
• "Always use the interface with lower power consumption"
• "Always use the WLAN"
• "Always use the network with more bandwidth"
• Decision may be based on utility/cost functions

Step 3: "Handoff Execution" If MT decides to perform a VHO, it executes the VHO procedure required to be associated with the new wireless network.

VHO Issues

Several challenges arise with vertical handoffs:

• When to switch? — VHO policies differ; WLAN to Cellular is not the same as Cellular to WLAN
• Seamless handoff — concerns about packet loss and VHO latency
• Load balancing between networks
• QoS guarantees during handoff
• Security and Authentication across different networks
• Billing across operators
• Implementation complexity

Standardization Efforts

Several organizations work on 4G handoff standards:

IETF:

• Mobility for IPv4 (MIPv4)
• Mobility for IPv6 (MIPv6)
• Mobility for IP: Performance, Signalling and Handoff Optimization (MIPSHOP)

IEEE 802.21 Media Independent Handover Group works toward seamless handoffs between IEEE 802.XX family and 3G Cellular

3GPP and 3GPP2 work on inter-working with WLAN as an extension of their radio access networks, using two architectures:

Tightly Coupled Architecture:

• Provides common charging and billing service
• Provides mobility support using traditional 3G technology
• Reuses 3G services (e.g., SMS, MMS, etc.)
• Causes large traffic load in 3G core network

Loosely Coupled Architecture:

• Provides simple integration approach
• Needs minimal requirement on the access network
• Provides independent network management

QoS Considerations

Supporting QoS in 4G networks is a major challenge due to varying bit rates, channel characteristics, bandwidth allocation, fault-tolerance levels, and handoff support among heterogeneous wireless networks.

QoS support can occur at four levels:

Packet-level QoS:

• Applies to jitter, throughput, and error rate
• Network resources such as buffer space and access protocol are likely influences

Transaction-level QoS:

• Describes both the time it takes to complete a transaction and the packet loss rate
• Certain transactions may be time sensitive, while others cannot tolerate any packet loss

Circuit-level QoS:

• Includes call blocking for new as well as existing calls
• Depends primarily on a network's ability to establish and maintain the end-to-end circuit

User-level QoS:

• Depends on user mobility and application type
• The new location may not support the minimum QoS needed, even with adaptive applications

End-to-End QoS

Developers need to modify many existing QoS schemes, including admission control, dynamic resource reservation, and QoS renegotiation to support 4G users' diverse QoS requirements. A wireless network could make its current QoS information available to all other wireless networks in either a distributed or centralized fashion so they can effectively use available network resources. Deploying a global QoS scheme may support the diverse requirements of users with different mobility patterns.

QoS Parameters

Different standards define different QoS parameters:

802.11e:

• Nominal MSDU size
• Min/mean/max data rate
• Mean/max service interval
• Traffic type (isochronous, asynchronous)
• Burst size

UMTS (Release 5):

• Traffic class (conversational, streaming, interactive, or background)
• Guaranteed, maximum bit rate
• Maximum SDU size
• SDU/bit error ratio
• Transfer delay

802.16-2004:

• Traffic priority
• Maximum sustained traffic rate
• Maximum traffic burst
• Minimum reserved traffic rate
• Scheduling type (best-effort, non-real time polling, real-time polling, unsolicited grant)
• Tolerated jitter, maximum latency

⭐ Key Takeaways

The most critical concepts from this lecture are: 4G's core vision is "Always Best Connected" across heterogeneous wireless networks; mobility management consists of location management (tracking) and handoff management (connection maintenance); vertical handoffs across different technologies use a three-step process (system discovery, handoff decision, handoff execution) with multiple metrics beyond just RSS; standardization efforts include IETF (Mobile IP), IEEE 802.21 (media-independent handover), and 3GPP (tightly vs loosely coupled architectures); and QoS must be supported at four levels (packet, transaction, circuit, user) with end-to-end considerations across heterogeneous networks.

🧠 Quick Revision Questions

1. What are the three steps of the vertical handoff process, and what happens in each step?
2. Compare tightly coupled vs loosely coupled architectures for 3GPP WLAN inter-working—list two advantages and one disadvantage of each.
3. What are the four levels at which QoS support can occur in 4G networks, and what does each level address?
4. How does a horizontal handoff differ from a vertical handoff in terms of network scope, metrics used, and opportunities?
5. List at least six issues that need resolution in 4G systems, and explain why handoff management is particularly challenging in heterogeneous networks.