MCA-213 Wireless Sensor Networks Notes cover all 4 units of this GGSIPU MCA Semester 3 Core Elective II paper in 92 pages, with 44 labelled figures, 5 worked examples and 93 solved exam questions (60 short-answer, 33 long-answer). They follow the MCA scheme for affiliated institutes, academic session 2025-26 onwards, and are sold as a printed book.
Written by Prateek Talwar, Founder, Unnati Educations · Reviewed by Ritik Rawat, B.Tech, Senior Full Stack Developer · Checked against MCA Scheme of Examination and Detailed Syllabus (affiliated institutes), approved 1 August 2025 · Updated 13 October 2026 · Editorial policy
Scheme: MCA, affiliated institutes | Applies to: A.S. 2025-26 onwards | Verified against: MCA Scheme of Examination and Detailed Syllabus, 1 August 2025
MCA-213 Wireless Sensor Networks at a glance: GGSIPU MCA Sem 3 credits, units and exam pattern
MCA-213 is one of eleven Core Elective II options, with Computer Networks as its prerequisite. It sits with the other GGSIPU MCA Semester 3 papers.
| Code and title | MCA-213 Wireless Sensor Networks |
|---|---|
| Course and semester | MCA (2 years), Semester 3 |
| Category and credits | Core Elective II (choose any one); L 3, T/P nil; 3 credits |
| Marks | Pass mark 40 out of 100 (scheme note 9); internal and end-term split not printed in the official PDF |
| End-term pattern | Q1 compulsory short-answer, whole syllabus: 12 marks; then one of two questions from each of 4 units at 12 marks each (12 + 48 = 60 marks) |
| Units | 4 units, 10 hours each |
| Paired lab | MCA-265 Wireless Sensor Networks Lab (Lab based on Core Elective II): L 0, T/P 2, 1 credit |
MCA-213 Wireless Sensor Networks Notes unit-wise: 93 solved exam questions and 44 figures across 4 units
Every unit closes with an exam corner and a quick revision sheet. The official PDF numbers the units only, so the unit names below are the notes' own titles; one page from each unit is in the sample PDF above. Notes for the other papers sit under GGSIPU MCA notes.
MCA-213 Unit 1: Introduction to Wireless Communication, WSN Requirements and Sensor Node Architecture
Unit 1 (pages 4 to 28) covers spectrum, ISM bands, propagation, Friis and log-distance path loss, Rayleigh and Rician fading, Doppler and Shannon capacity; then ASK, FSK, PSK, FDMA, TDMA, CDMA, WPAN to WWAN, Karl and Willig's eight WSN requirements, WSN vs MANET, node subsystems and six motes from MICA2 to EYES. It has 12 sections, 10 figures, 14 short and 8 long solved questions.
| Protocol | Max throughput |
|---|---|
| Pure ALOHA | 18.4% |
| Slotted ALOHA | 36.8% |
| CSMA | Higher than ALOHA |
| CSMA/CA | Used in Wi-Fi and IEEE 802.15.4 |
Quick look: random access protocols (from page 14)
- Protocol
- Pure ALOHA
- Max throughput
- 18.4%
- Protocol
- Slotted ALOHA
- Max throughput
- 36.8%
- Protocol
- CSMA
- Max throughput
- Higher than ALOHA
- Protocol
- CSMA/CA
- Max throughput
- Used in Wi-Fi and IEEE 802.15.4
MCA-213 Unit 2: Operating Systems, Wireless Communication Characteristics and MAC Fundamentals
Unit 2 (pages 29 to 51) explains why a desktop OS cannot run on a mote, then covers scheduling, data types, stacks, system calls, memory and interrupts. TinyOS is taught through nesC modules, commands, events and tasks, with LA-TinyOS, Contiki and LiteOS compared; then link quality, localisation, deployment, coverage, node discovery and MAC energy waste. It has 11 sections, 11 figures, 15 short and 8 long solved questions.
| Metric | What it measures |
|---|---|
| RSSI | Received signal power in dBm; cheap but noisy |
| LQI | IEEE 802.15.4 value, 0 to 255, from chip correlation |
| PRR | Packets received divided by packets sent; accurate but slow |
| ETX | 1 / (df × dr); used by CTP and RPL |
Quick look: four ways to measure a WSN link (from page 38)
- Metric
- RSSI
- What it measures
- Received signal power in dBm; cheap but noisy
- Metric
- LQI
- What it measures
- IEEE 802.15.4 value, 0 to 255, from chip correlation
- Metric
- PRR
- What it measures
- Packets received divided by packets sent; accurate but slow
- Metric
- ETX
- What it measures
- 1 / (df × dr); used by CTP and RPL
MCA-213 Unit 3: Network Layer Protocols and Transport Layer
Unit 3 (pages 52 to 73) explains why ETX beats hop count, then covers flooding, gossiping, SPIN, Directed Diffusion, PEGASIS, TEEN, HEED, energy-aware routing, GPSR, GEAR, GAF, SAR and SPEED. The transport part compares ESRT, PSFQ, RMST, CODA, GARUDA and STCP. It has 10 sections, 14 figures, 15 short and 10 long solved questions.
| TCP feature | Problem in a WSN |
|---|---|
| Three-way handshake | Too much overhead for small reports |
| End-to-end retransmission | Resends over every hop, draining each node |
| Every loss read as congestion | Most losses are link errors |
| 100% packet reliability | Many applications need only event reliability |
Quick look: where TCP breaks in a sensor network (from page 65)
- TCP feature
- Three-way handshake
- Problem in a WSN
- Too much overhead for small reports
- TCP feature
- End-to-end retransmission
- Problem in a WSN
- Resends over every hop, draining each node
- TCP feature
- Every loss read as congestion
- Problem in a WSN
- Most losses are link errors
- TCP feature
- 100% packet reliability
- Problem in a WSN
- Many applications need only event reliability
MCA-213 Unit 4: Middleware and Application Layer, Security, Applications and Simulation Platforms
Unit 4 (pages 74 to 92) covers middleware (TinyDB, Maté, Agilla), push and pull dissemination with TTDD, and query processing through TAG. Security covers Sybil, wormhole and HELLO flood attacks, SPINS, 802.15.4 suites and ZigBee's three keys, followed by all twelve syllabus applications and the five simulators. It has 9 sections, 9 figures, 16 short and 7 long solved questions.
| Scheme | Event cost | Query cost |
|---|---|---|
| External Storage (data at the sink) | High | None |
| Local Storage (data at the sensing node) | None | High, flooded |
| Data-Centric Storage (hashed home node) | Medium | Low |
Quick look: external, local and data-centric storage (from page 78)
- Scheme
- External Storage (data at the sink)
- Event cost
- High
- Query cost
- None
- Scheme
- Local Storage (data at the sensing node)
- Event cost
- None
- Query cost
- High, flooded
- Scheme
- Data-Centric Storage (hashed home node)
- Event cost
- Medium
- Query cost
- Low
LEACH cluster-head rotation in wireless sensor network routing: excerpt from page 59 of the MCA-213 notes
Excerpt from page 59
LEACH (Low-Energy Adaptive Clustering Hierarchy) groups sensor nodes into clusters. Each cluster has a cluster head (CH) that collects its members' readings, fuses them and forwards one result to the base station. Because being a CH drains the battery fastest, LEACH works in rounds and hands the job to different nodes over time.
Operation in rounds
Every round has a short set-up phase and a much longer steady-state phase.
- CH election. Each node n picks a random number between 0 and 1. If the number is below a threshold T(n), the node becomes a CH for this round.
- Advertisement. The new CHs broadcast an advertisement using CSMA. Every other node joins the CH whose signal it receives most strongly.
- Schedule creation. Each CH builds a TDMA schedule for its members.
- Steady state. Members send data only in their own TDMA slot and sleep the rest of the time. The CH aggregates the data and sends it to the base station. Neighbouring clusters use different CDMA codes so their transmissions do not interfere.
The threshold
T(n) = p / (1 − p × (r mod 1/p)) if n belongs to G, and T(n) = 0 otherwise. Here p is the desired fraction of CHs (for example 5%), r is the current round, and G is the set of nodes that have not been a CH in the last 1/p rounds. A node that has just served cannot be picked again until the cycle completes, which spreads the energy load.
Advantages and limitations
| Advantages | Limitations |
|---|---|
| Fully distributed; no global knowledge needed | Random choice may give badly placed or low-energy CHs |
| Random rotation balances energy use | CHs reach the base station in one hop, so large areas are a problem |
| Aggregation cuts traffic; TDMA lets members sleep | Re-clustering every round adds overhead |
LEACH: advantages and limitations (excerpt, page 59)
- Advantages
- Fully distributed; no global knowledge needed
- Limitations
- Random choice may give badly placed or low-energy CHs
- Advantages
- Random rotation balances energy use
- Limitations
- CHs reach the base station in one hop, so large areas are a problem
- Advantages
- Aggregation cuts traffic; TDMA lets members sleep
- Limitations
- Re-clustering every round adds overhead
LEACH-C, the centralised version, lets the base station form clusters using each node's energy and position, which gives better clusters. PEGASIS, introduced next on the same page, replaces clusters with a single chain.
MCA-213 exam corner: 60 short-answer and 33 long-answer solved questions by unit
The notes label answers 2.5 and 12.5 marks; the 2025-26 rules use 12-mark questions, so read the labels as answer length.
| Unit | Short (2.5 Marks) | Long (12.5 Marks) | Worked examples |
|---|---|---|---|
| Unit 1 | 14 | 8 | 1 |
| Unit 2 | 15 | 8 | 3 |
| Unit 3 | 15 | 10 | 0 |
| Unit 4 | 16 | 7 | 1 |
| Total | 60 | 33 | 5 |
Solved questions and worked examples in the MCA-213 notes, by unit
- Unit
- Unit 1
- Short (2.5 Marks)
- 14
- Long (12.5 Marks)
- 8
- Worked examples
- 1
- Unit
- Unit 2
- Short (2.5 Marks)
- 15
- Long (12.5 Marks)
- 8
- Worked examples
- 3
- Unit
- Unit 3
- Short (2.5 Marks)
- 15
- Long (12.5 Marks)
- 10
- Worked examples
- 0
- Unit
- Unit 4
- Short (2.5 Marks)
- 16
- Long (12.5 Marks)
- 7
- Worked examples
- 1
- Unit
- Total
- Short (2.5 Marks)
- 60
- Long (12.5 Marks)
- 33
- Worked examples
- 5
The MCA-213 notes solve 60 short-answer and 33 long-answer questions across 4 units, plus 5 worked examples and 44 labelled figures.
One question per unit, with answer pointers:
- Unit 1: Name the subsystems of a sensor node. Pointer (page 25): sensing, processor, communication and power; location finder and mobiliser are optional.
- Unit 2: What is split-phase operation? Pointer (page 48): a command starts the job and returns at once; an event such as
Read.readDone()reports completion, so the CPU never busy-waits. - Unit 3: What is the void problem in geographic routing? Pointer (page 70): no neighbour is closer to the destination, so greedy forwarding stalls; GPSR switches to perimeter routing.
- Unit 4: What is a wormhole attack? Pointer (page 89): two colluding attackers tunnel packets so distant nodes look like neighbours; packet leashes counter it.
More practice sits in the MCA-213 important questions.
Who writes and checks the MCA-213 WSN notes?
- Prateek Talwar, author: Founder, Unnati Educations; Associate Company Secretary (ACS), ICSI, membership no. 58704, since 15 May 2019; B.Com, University of Delhi (School of Open Learning), 2012. Author bio
- Ritik Rawat, subject reviewer: Senior Full Stack Developer, Unnati Educations; B.Tech.
The 2026-27 edition of these MCA-213 Wireless Sensor Networks IPU notes is mapped to the MCA scheme approved by the AC sub-committee on 1 August 2025. Last updated 13 October 2026; see the editorial policy.
Protocol details such as the LEACH threshold, ETX and the 802.15.4 security suites fall under Ritik's review. The same team prepares GGSIPU important questions for every course.
Do the MCA-213 notes cover the full GGSIPU syllabus?
Yes. Every topic in the four official MCA-213 units has its own section in the notes; the unit check found no gap.
| Official unit | Official topics | Where in the notes | Status |
|---|---|---|---|
| Unit I | Wireless fundamentals, spectrum, channels, modulation, multiple access, LANs to MANs, Wireless Internet; WSN requirements, challenges, WSN vs Adhoc; node architecture; five prototypes | Sections 1 to 12, pages 5 to 24 | Covered |
| Unit II | OS functional aspects; TinyOS, LA-TinyOS; link quality, fading, shadowing, localization, topology, deployment, coverage, node discovery; MAC fundamentals | Sections 1 to 11, pages 30 to 47 | Covered |
| Unit III | Routing metrics, flooding, gossiping, data-centric, hierarchical, energy-efficient, location and QoS routing; transport design and performance | Sections 1 to 10, pages 53 to 69 | Covered |
| Unit IV | Dissemination, storage, query processing; security, attacks, 802.15.4 and Zigbee; twelve applications; five simulators | Sections 1 to 9, pages 75 to 88 | Covered |
Official MCA-213 syllabus mapped to the notes
- Official unit
- Unit I
- Official topics
- Wireless fundamentals, spectrum, channels, modulation, multiple access, LANs to MANs, Wireless Internet; WSN requirements, challenges, WSN vs Adhoc; node architecture; five prototypes
- Where in the notes
- Sections 1 to 12, pages 5 to 24
- Status
- Covered
- Official unit
- Unit II
- Official topics
- OS functional aspects; TinyOS, LA-TinyOS; link quality, fading, shadowing, localization, topology, deployment, coverage, node discovery; MAC fundamentals
- Where in the notes
- Sections 1 to 11, pages 30 to 47
- Status
- Covered
- Official unit
- Unit III
- Official topics
- Routing metrics, flooding, gossiping, data-centric, hierarchical, energy-efficient, location and QoS routing; transport design and performance
- Where in the notes
- Sections 1 to 10, pages 53 to 69
- Status
- Covered
- Official unit
- Unit IV
- Official topics
- Dissemination, storage, query processing; security, attacks, 802.15.4 and Zigbee; twelve applications; five simulators
- Where in the notes
- Sections 1 to 9, pages 75 to 88
- Status
- Covered
Official source: MCA Scheme of Examination and Detailed Syllabus, affiliated institutes, A.S. 2025-26 onwards.
The notes also add Contiki, LiteOS and six named transport protocols for comparison answers. Every course in GGSIPU notes is mapped to its official PDF the same way.
How to write MCA-213 answers: comparison tables, labelled diagrams and formula-backed long answers
Each long answer in the book follows a set order: definition, figure, comparison table, one-line conclusion. For WSN vs MANET, open with "WSN is a special type of ad hoc network", give two or three similarities, then a difference table of at least eight rows.
Q1 is a 12-mark block of short answers across all units, so learn the one-liners on each quick revision sheet: λ = c / f, the Friis equation, the LEACH threshold, ETX and Rc ≥ 2Rs.
Worked example: Shannon capacity (page 10)
- Given: B = 2 MHz and S/N = 31.
- Formula:
C = B × log2(1 + S/N). - Substitute:
C = 2 × 10^6 × log2 32 = 2 × 10^6 × 5. - Result: C = 10 Mbps. Show formula, substitution, log step and unit.
Slips the notes flag
- Writing CSMA/CD for wireless: a radio cannot listen while transmitting, and hidden terminals hide collisions.
- Skipping the energy hole, where nodes beside the sink die first; name mobile sinks or CH rotation as fixes.
For Unit 3 protocol comparisons, end with a verdict such as ESRT and CODA for upstream congestion, PSFQ and GARUDA for downstream reliability. Practise this format on GGSIPU MCA important questions.
MCA-213 and the MCA-265 WSN lab, plus other GGSIPU MCA Sem 3 papers
Paired lab: MCA-265 Wireless Sensor Networks Lab · Lab based on Core Elective II · 1 credit
- Simulator builds (CO1) and storage and dissemination (CO6) map to Unit 4.
- Throughput (CO2) maps to Units 1 and 2.
- Clustering and routing (CO3, CO4) map to Unit 3.
- Energy efficiency (CO5) maps to Units 2 and 3.
Students using these GGSIPU MCA Sem 3 Wireless Sensor Networks notes also take MCA-201 Design and Analysis of Algorithms and MCA-203 Artificial Intelligence and Machine Learning. MCA-235 Internet of Things (Core Elective III) overlaps most with motes and ZigBee. Other Core Elective II options run from MCA-205 to MCA-225, including MCA-219 Distributed Systems and MCA-223 Cloud Computing.
MCA-213 WSN notes FAQs
How do I get the full MCA-213 notes?
Message Unnati Educations on WhatsApp at 9899436384 with the code MCA-213. The full notes come only as a printed book; they are not available as a PDF. The book covers all 4 units in 92 pages with 93 solved questions and 44 figures. Delivery takes 5 to 7 days at most, depending on your location.
Is MCA-213 a compulsory paper in GGSIPU MCA Semester 3?
No. MCA-213 is one of eleven Core Elective II options, worth 3 credits, and you choose one. The scheme also says an elective with fewer than 20 students may run without classes, and students then complete it through a MOOC platform such as SWAYAM with prior approval. Your institute confirms which electives actually run in your batch.
What is the passing mark for MCA-213?
MCA-213 is marked out of 100, and its end-term paper adds up to 60 marks (a 12-mark Q1 plus four 12-mark unit questions); the official PDF does not print the internal split. The MCA scheme of examination states pass marks as 40 out of 100 marks for every paper, which is 40%. For end-term minimums and re-appear rules, see GGSIPU Ordinance 11.
Which MCA-213 unit has the most diagrams and long answers?
Unit 3, Network Layer Protocols and Transport Layer. It has 14 labelled figures, including the Directed Diffusion gradients, the LEACH round, the GAF virtual grid and the funnelling effect, plus 10 long answers, each with its own writing guide. Unit 4 has the most short answers, 16, mostly on middleware, security attacks, ZigBee keys and the simulators.
Are the MCA-213 marks in the notes the same as the 2025-26 exam pattern?
Not exactly. The notes label short answers 2.5 marks and long answers 12.5 marks. The 2025-26 MCA-213 paper-setter rules give a compulsory 12-mark Q1 and one 12-mark question from each unit, totalling 60. Treat the notes' labels as a guide to answer length; a long answer written to its "write in this order" guide fits a 12-mark question.
Do the MCA-213 notes cover TOSSIM and the other simulators?
Yes. Pages 87 and 88 explain TOSSIM, ns-2, Avrora, OPNET and QualNet: who built each, its language, what it simulates and its limits, then a comparison table. They also note the PowerTOSSIM energy extension and list Cooja, OMNeT++ with Castalia, ns-3, J-Sim and EmStar. The book has no lab programs; those belong to the MCA-265 lab.
Get the full MCA-213 Wireless Sensor Networks Notes on WhatsApp
These Wireless Sensor Networks notes in English come as a printed book only, not as a PDF.
Inside the printed MCA-213 book
- Unit
- Cover and index
- Pages
- 1 to 3 (3)
- Solved (short + long)
- -
- Figures
- -
- Unit
- Unit 1
- Pages
- 4 to 28 (25)
- Solved (short + long)
- 14 + 8
- Figures
- 10
- Unit
- Unit 2
- Pages
- 29 to 51 (23)
- Solved (short + long)
- 15 + 8
- Figures
- 11
- Unit
- Unit 3
- Pages
- 52 to 73 (22)
- Solved (short + long)
- 15 + 10
- Figures
- 14
- Unit
- Unit 4
- Pages
- 74 to 92 (19)
- Solved (short + long)
- 16 + 7
- Figures
- 9
Printed book, 92 pages with index, four exam corners and four revision sheets. Delivery: within 5 to 7 days at most; the exact time may vary with your location.
Order the printed MCA-213 notes book on WhatsApp (4 units, 92 pages)
Unnati Educations is an independent education provider based in Vikaspuri, Delhi. We are not affiliated with, authorised by, or endorsed by Guru Gobind Singh Indraprastha University (GGSIPU). 'GGSIPU' and 'IPU' are used only to describe the syllabus our notes follow. For official information, visit ipu.ac.in.
Ready for the full notes?
Discuss coverage and delivery with our team.