{"pinia":{"ui":{"prefs":{"theme":"system","textScale":"md","fontFamily":"sans","reducedMotion":false,"highContrast":false}},"academy":{"universities":[],"universitySummaries":[{"slug":"rtu","name":"RTU","fullName":"Rajasthan Technical University","branches":[{"slug":"first-year-common","name":"First Year (Common)"},{"slug":"computer-science","name":"Computer Science"},{"slug":"mechanical","name":"Mechanical"},{"slug":"civil","name":"Civil"},{"slug":"ai-data-science","name":"AI & Data Science"},{"slug":"ee-ec-eee","name":"EE / EC / EEE"}]},{"slug":"aktu","name":"AKTU","fullName":"Dr. A. P. J. Abdul Kalam Technical University","branches":[{"slug":"first-year-common","name":"First Year (Common)"},{"slug":"computer-science","name":"Computer Science"}]}],"activePapers":[{"id":"mobile-computing-2020","title":"Mobile Computing (2020)","subjectSlug":"mobile-computing","subjectName":"Mobile Computing","universitySlug":"rtu","branchSlug":"computer-science","year":4,"semester":8,"examYear":2020,"paperCode":"8E8161","questions":[{"id":"v2-mobile-computing-2020-pA-q1","number":1,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"Define mobile computing and list its main characteristics."}],"answer":{"summary":"Mobile computing allows transmission of data, voice, and video via a computer or any other wireless-enabled device without a fixed physical link.","explanation":[{"type":"paragraph","content":"Mobile computing refers to a technology that allows transmission of data, voice, and video via a computer or any other wireless-enabled device without having to be connected to a fixed physical link. Its main characteristics include mobility, portability, seamless connectivity, and context awareness."}]}},{"id":"v2-mobile-computing-2020-pA-q2","number":2,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What is the difference between wired and wireless networks?"}],"answer":{"summary":"Wired networks use cables for connection and offer higher bandwidth, while wireless networks use radio waves, providing mobility but generally lower bandwidth and higher error rates.","explanation":[{"type":"paragraph","content":"Wired networks rely on physical cables (like Ethernet or fiber optics) to connect devices, generally providing higher bandwidth, lower latency, and more security. Wireless networks use radio waves or infrared signals to connect devices, offering mobility and ease of deployment but suffering from lower bandwidth, higher interference, and more security vulnerabilities."}]}},{"id":"v2-mobile-computing-2020-pA-q3","number":3,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"Explain the concept of frequency reuse in cellular networks."}],"answer":{"summary":"Frequency reuse is the process of using the same radio frequencies on radio transmitter sites within a geographic area that are separated by sufficient distance to cause minimal interference.","explanation":[{"type":"paragraph","content":"Frequency reuse is a fundamental concept in cellular networks where the same set of radio frequencies is used in different, non-adjacent cells. This is possible because the transmit power of base stations is kept relatively low, meaning signals drop off before reaching cells using the same frequency. This drastically increases the capacity of the network without requiring additional frequency spectrum."}]}},{"id":"v2-mobile-computing-2020-pA-q4","number":4,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What is handoff in cellular systems? Name two types."}],"answer":{"summary":"Handoff is the process of transferring an ongoing call or data session from one channel connected to the core network to another.","explanation":[{"type":"paragraph","content":"Handoff (or handover) is the process of transferring an active call or data session from one base station (or cell) to another without disconnecting the session as the user moves. Two main types are Hard Handoff ('break before make') and Soft Handoff ('make before break')."}]}},{"id":"v2-mobile-computing-2020-pA-q5","number":5,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"Define Mobile IP and state its main purpose."}],"answer":{"summary":"Mobile IP is an IETF standard communications protocol that is designed to allow mobile device users to move from one network to another while maintaining their permanent IP address.","explanation":[{"type":"paragraph","content":"Mobile IP is an open standard, defined by the IETF, that allows users to keep the same IP address, stay connected, and maintain ongoing applications while roaming between different IP networks. Its main purpose is to solve the routing problem of mobile nodes changing their point of attachment to the Internet without losing ongoing TCP connections."}]}},{"id":"v2-mobile-computing-2020-pA-q6","number":6,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What is a care-of address (COA)?"}],"answer":{"summary":"A Care-of Address (COA) is a temporary IP address assigned to a mobile node when it moves to a foreign network.","explanation":[{"type":"paragraph","content":"In Mobile IP, a Care-of Address (COA) is a temporary IP address that identifies the mobile node's current point of attachment to the Internet when it is visiting a foreign network. The home agent uses this COA to tunnel packets to the mobile node."}]}},{"id":"v2-mobile-computing-2020-pA-q7","number":7,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"Differentiate between proactive and reactive routing protocols."}],"answer":{"summary":"Proactive protocols maintain routing information continuously, while reactive protocols discover routes only when a node needs to send data.","explanation":[{"type":"paragraph","content":"Proactive (table-driven) routing protocols continuously evaluate routes within the network, so when a packet needs to be forwarded, the route is already known and can be immediately used (e.g., DSDV). Reactive (on-demand) protocols determine the proper route only when there is data to be sent, initiating a route discovery process (e.g., AODV, DSR), which saves bandwidth but introduces delay."}]}},{"id":"v2-mobile-computing-2020-pA-q8","number":8,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What is Bluetooth? List its two main states."}],"answer":{"summary":"Bluetooth is a wireless technology standard for exchanging data over short distances. Its main states are standby and connection.","explanation":[{"type":"paragraph","content":"Bluetooth is a short-range wireless communication technology standard used for exchanging data between fixed and mobile devices, creating Personal Area Networks (PANs). The two main states of a Bluetooth device are 'Standby' (waiting to join a piconet) and 'Connection' (actively connected to a piconet)."}]}},{"id":"v2-mobile-computing-2020-pA-q9","number":9,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What is Indirect TCP (I-TCP)?"}],"answer":{"summary":"Indirect TCP (I-TCP) splits the TCP connection into two parts: a wired connection from the sender to the access point, and a wireless connection from the access point to the mobile host.","explanation":[{"type":"paragraph","content":"Indirect TCP (I-TCP) is a transport layer protocol designed to improve TCP performance in mobile environments. It splits a TCP connection at the base station (or foreign agent) into two distinct connections: a standard TCP connection between the fixed sender and the base station, and a customized, optimized wireless connection between the base station and the mobile host."}]}},{"id":"v2-mobile-computing-2020-pA-q10","number":10,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"Explain the hidden and exposed terminal problem in brief."}],"answer":{"summary":"The hidden terminal problem occurs when two nodes cannot hear each other but send data to the same receiver, causing collisions. The exposed terminal problem prevents a node from sending data because it mistakenly thinks the medium is busy.","explanation":[{"type":"paragraph","content":"The hidden terminal problem occurs when node A and node C both want to send data to node B, but they are out of range of each other. They transmit simultaneously, causing a collision at B. The exposed terminal problem occurs when a node is prevented from sending packets to other nodes because it hears a neighboring transmission and mistakenly concludes that the medium is busy, even though the intended receiver is out of the interfering node's range."}]}},{"id":"v2-mobile-computing-2020-pB-q11","number":11,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Explain the architecture of GSM in detail."}],"answer":{"summary":"GSM architecture consists of the Mobile Station (MS), Base Station Subsystem (BSS), and Network and Switching Subsystem (NSS).","explanation":[{"type":"paragraph","content":"The Global System for Mobile Communications (GSM) architecture comprises three main subsystems. First, the Mobile Station (MS), which consists of the mobile equipment (the phone) and the Subscriber Identity Module (SIM). Second, the Base Station Subsystem (BSS), which handles the radio link with the MS and includes the Base Transceiver Station (BTS) and the Base Station Controller (BSC). Third, the Network and Switching Subsystem (NSS), which performs call routing and mobility management. The NSS includes the Mobile Switching Center (MSC), Home Location Register (HLR), Visitor Location Register (VLR), Authentication Center (AuC), and Equipment Identity Register (EIR)."}]}},{"id":"v2-mobile-computing-2020-pB-q12","number":12,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Describe the MAC protocol IEEE 802.11 with its frame format."}],"answer":{"summary":"IEEE 802.11 uses CSMA/CA for MAC, which avoids collisions using RTS/CTS. Its frame format includes frame control, duration, four addresses, sequence control, frame body, and FCS.","explanation":[{"type":"paragraph","content":"IEEE 802.11 defines the MAC layer for wireless LANs. Because wireless radios cannot easily detect collisions (CSMA/CD doesn't work), it uses Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA). It utilizes an optional Request to Send (RTS) and Clear to Send (CTS) mechanism to handle the hidden terminal problem. The general 802.11 MAC frame format consists of a MAC header (including Frame Control, Duration/ID, Address 1, Address 2, Address 3, Sequence Control, and Address 4), a variable-length Frame Body (containing the payload), and a Frame Check Sequence (FCS) for error detection."}]}},{"id":"v2-mobile-computing-2020-pB-q13","number":13,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"What are the challenges faced by Mobile Transport Layer? Explain Snooping TCP."}],"answer":{"summary":"Mobile Transport Layer faces high error rates, frequent disconnections, and varying delays. Snooping TCP buffers packets at the base station to retransmit locally without notifying the sender.","explanation":[{"type":"paragraph","content":"Traditional TCP assumes packet loss is due to network congestion and reduces its transmission window. In mobile networks, packet loss is often due to high bit error rates and frequent handoffs, causing standard TCP to unnecessarily throttle throughput. Snooping TCP addresses this by introducing a 'snooping' agent at the base station. The agent buffers data packets sent to the mobile host and monitors acknowledgments (ACKs). If it detects a missing ACK or duplicate ACKs indicating a lost packet, it retransmits the buffered packet locally to the mobile node and drops the duplicate ACKs to prevent the fixed sender from reducing its congestion window."}]}},{"id":"v2-mobile-computing-2020-pB-q14","number":14,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Discuss the Dynamic Source Routing (DSR) protocol in MANETs."}],"answer":{"summary":"DSR is a reactive routing protocol for MANETs where the sender determines the complete sequence of nodes through which to forward the packet.","explanation":[{"type":"paragraph","content":"Dynamic Source Routing (DSR) is a reactive (on-demand) routing protocol designed specifically for use in multi-hop wireless ad hoc networks. In DSR, the source node determines the entire route to the destination before sending a packet. This route is placed in the packet's header (source routing). The protocol consists of two main mechanisms: Route Discovery and Route Maintenance. Route Discovery is initiated only when a route is needed, using Route Request (RREQ) and Route Reply (RREP) packets. Route Maintenance monitors the validity of existing routes and generates Route Error (RERR) packets when a link break is detected."}]}},{"id":"v2-mobile-computing-2020-pB-q15","number":15,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Explain the working mechanism of Mobile IP with a suitable example."}],"answer":{"summary":"Mobile IP uses a Home Agent, Foreign Agent, and Care-of Address to route packets to a mobile node currently in a foreign network.","explanation":[{"type":"paragraph","content":"Mobile IP allows a Mobile Node (MN) to keep its home IP address regardless of its physical location. For example, consider an MN with a home network managed by a Home Agent (HA). When the MN moves to a foreign network, it discovers a Foreign Agent (FA) and acquires a temporary Care-of Address (COA). The MN registers this COA with its HA. Now, when a Correspondent Node (CN) sends a packet to the MN's home address, the packet arrives at the home network and is intercepted by the HA. The HA encapsulates the packet and tunnels it to the COA. The FA (or the MN itself if it has a co-located COA) decapsulates the packet and delivers the original payload to the MN."}]}},{"id":"v2-mobile-computing-2020-pB-q16","number":16,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Describe the concept of Data Dissemination and Broadcasting."}],"answer":{"summary":"Data dissemination is the distribution of information to mobile nodes. Broadcasting involves transmitting data over the airwaves to many receivers simultaneously.","explanation":[{"type":"paragraph","content":"Data dissemination in mobile computing refers to the delivery of data from a set of data servers to mobile clients. Due to bandwidth constraints and power limitations of mobile devices, efficient dissemination strategies are crucial. It can be push-based (servers broadcast data without explicit requests, e.g., weather updates), pull-based (clients explicitly request data, e.g., web browsing), or hybrid. Broadcasting is a primary mechanism for push-based dissemination, where the server continuously transmits data on a broadcast channel, allowing many clients to tune in and download the required data simultaneously, highly optimizing bandwidth usage."}]}},{"id":"v2-mobile-computing-2020-pB-q17","number":17,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Explain the various generations of cellular networks (1G, 2G, 3G, 4G)."}],"answer":{"summary":"Generations evolved from analog voice (1G), to digital voice and text (2G), mobile broadband data (3G), to all-IP high-speed networks (4G).","explanation":[{"type":"paragraph","content":"The evolution of cellular networks is marked by generations. 1G networks (like AMPS) were analog systems designed exclusively for voice calls. 2G networks (like GSM and CDMA) introduced digital encryption, improving voice quality and adding data services like SMS and basic email. 3G networks (like UMTS and CDMA2000) significantly increased data transfer rates, enabling mobile internet browsing, video calling, and multimedia streaming. 4G networks (like LTE) shifted to an all-IP architecture, providing substantially higher bandwidth, lower latency, and support for high-definition video streaming, mobile gaming, and advanced mobile web access."}]}},{"id":"v2-mobile-computing-2020-pC-q18","number":18,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"What is MANET? Explain Destination Sequenced Distance Vector (DSDV) routing protocol in detail."}],"answer":{"summary":"MANETs are self-configuring, infrastructure-less networks. DSDV is a proactive routing protocol that uses sequence numbers to prevent routing loops.","explanation":[{"type":"paragraph","content":"

Mobile Ad hoc Network (MANET)

A Mobile Ad hoc Network (MANET) is a continuously self-configuring, infrastructure-less network of mobile devices connected wirelessly. Each device in a MANET is free to move independently in any direction, and will therefore change its links to other devices frequently. Each must forward traffic unrelated to its own use, and therefore be a router.

"},{"type":"paragraph","content":"

DSDV Routing Protocol

Destination-Sequenced Distance-Vector (DSDV) is a table-driven (proactive) routing protocol for ad hoc networks based on the Bellman-Ford algorithm.

Routing Table: Every node maintains a routing table that lists all available destinations, the number of hops to reach them, and a sequence number assigned by the destination node.
Sequence Numbers: The sequence number is crucial as it distinguishes stale routes from new ones, thereby avoiding routing loops, a common problem in standard distance-vector protocols.
Updates: Routing information is updated periodically or when significant topology changes are detected. Nodes transmit their routing tables to their immediate neighbors.
Update Types: There are two types of updates: 'Full Dump' (sending the entire routing table, used infrequently) and 'Incremental Update' (sending only the entries that have changed since the last update, used to save bandwidth).

"},{"type":"paragraph","content":"

Working Mechanism

When a node receives a routing update, it compares the received sequence number with the one it already has for that destination. The route with the higher sequence number is always preferred. If sequence numbers are identical, the route with the better metric (fewer hops) is chosen. If a link breaks, the node sets the hop count for the broken link to infinity and assigns a new sequence number to indicate the broken route to others.

"},{"type":"svg","src":"/assets/diagrams/rtu/cs/4/mobile-computing/diagram-18.svg","alt":"DSDV Routing Mechanism","caption":"DSDV Route Updates and Sequence Numbers"}]}},{"id":"v2-mobile-computing-2020-pC-q19","number":19,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"Discuss the TCP over wireless links. Compare I-TCP, Snooping TCP, and M-TCP."}],"answer":{"summary":"Standard TCP misinterprets wireless loss as congestion. I-TCP, Snooping TCP, and M-TCP are transport layer protocols designed to mitigate these issues.","explanation":[{"type":"paragraph","content":"

Challenges of TCP over Wireless

Traditional TCP is optimized for wired networks where packet loss is almost always due to congestion. In wireless networks, packet loss is frequently caused by high bit-error rates, interference, or handoffs. When TCP detects packet loss, it erroneously assumes congestion, sharply reducing its transmission window, leading to severe performance degradation.

"},{"type":"paragraph","content":"

Indirect TCP (I-TCP)

Mechanism: Splits the TCP connection at the base station into two connections: wired (sender to BS) and wireless (BS to mobile host).
Advantages: Shields the wired network from wireless errors. Standard TCP runs on the wired side, while an optimized protocol can run on the wireless side.
Disadvantages: Violates end-to-end TCP semantics; if the BS crashes, the sender thinks data arrived because the BS acknowledged it. Handoff is complex because the state must be transferred to the new BS.

"},{"type":"paragraph","content":"

Snooping TCP

Mechanism: The base station 'snoops' on passing packets and buffers them. If it detects a lost packet (via duplicate ACKs or timeout), it retransmits it locally to the mobile node and drops duplicate ACKs heading to the sender.
Advantages: Maintains end-to-end TCP semantics. No changes required at the sender.
Disadvantages: Cannot be used if end-to-end encryption (like IPsec) is employed because the BS cannot read the TCP headers to snoop.

"},{"type":"paragraph","content":"

Mobile TCP (M-TCP)

Mechanism: Splits the connection similarly to I-TCP but maintains end-to-end semantics. It uses a Supervisory Host (SH) which does not send ACKs to the sender until the mobile host acknowledges receipt. If the mobile node disconnects, the SH sets the sender's window size to zero, putting the sender into persist mode.
Advantages: Preserves end-to-end semantics and handles frequent, lengthy disconnections well.
Disadvantages: Requires modifications to the network infrastructure (introducing Supervisory Hosts) and slightly more complex implementation.

"},{"type":"svg","src":"/assets/diagrams/rtu/cs/4/mobile-computing/diagram-19.svg","alt":"Comparison of Mobile TCP Protocols","caption":"Architecture of I-TCP, Snooping TCP, and M-TCP"}]}},{"id":"v2-mobile-computing-2020-pC-q20","number":20,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"Explain the architecture and working of IEEE 802.11 wireless LAN in detail."}],"answer":{"summary":"IEEE 802.11 defines the physical and MAC layers for WLANs. Architecture includes BSS, ESS, AP, and DS. MAC relies on CSMA/CA.","explanation":[{"type":"paragraph","content":"

IEEE 802.11 Architecture

The IEEE 802.11 architecture consists of several interacting components designed to provide wireless local area network connectivity.

Basic Service Set (BSS): The fundamental building block, consisting of a group of stations communicating with each other. A BSS can be an Independent BSS (IBSS or ad-hoc mode) without an access point, or an Infrastructure BSS with an Access Point (AP).
Access Point (AP): A station that provides access to the distribution services via the wireless medium for associated stations.
Distribution System (DS): The mechanism by which multiple APs communicate to form a larger network, connecting different BSSs.
Extended Service Set (ESS): A set of one or more interconnected BSSs and a DS that appears as a single logical network to the Logical Link Control (LLC) level.

"},{"type":"paragraph","content":"

MAC Layer and CSMA/CA

The MAC layer in 802.11 must manage access to the shared wireless medium. Since collision detection (CSMA/CD) is difficult in wireless environments, it uses Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) and the Distributed Coordination Function (DCF).

Carrier Sensing: A station senses the medium before transmitting. If idle for a duration called Distributed Inter-Frame Space (DIFS), it transmits.
Random Backoff: If the medium is busy, the station waits for it to become idle, then defers transmission for a random backoff period to avoid collisions with other waiting stations.
RTS/CTS: To combat the hidden terminal problem, a station can optionally send a Request to Send (RTS) frame. The AP responds with a Clear to Send (CTS) frame. This reserves the medium for the duration of the transmission.
Acknowledgments (ACK): After successful data reception, the receiver sends an ACK frame after a Short Inter-Frame Space (SIFS). If no ACK is received, the sender assumes collision or error and retransmits.

"},{"type":"svg","src":"/assets/diagrams/rtu/cs/4/mobile-computing/diagram-20.svg","alt":"IEEE 802.11 Architecture","caption":"BSS, ESS, and DS in IEEE 802.11"}]}},{"id":"v2-mobile-computing-2020-pC-q21","number":21,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"Describe the location management and call setup mechanism in GSM."}],"answer":{"summary":"GSM uses HLR and VLR for location tracking. Call setup involves paging the mobile station, authenticating, and establishing traffic channels.","explanation":[{"type":"paragraph","content":"

Location Management

Location management ensures the GSM network knows the current location of a mobile station to deliver incoming calls. It heavily relies on the Home Location Register (HLR) and Visitor Location Register (VLR).

HLR: The primary database holding subscriber information and their current VLR location.
VLR: A temporary database holding information about subscribers currently in the area served by its associated MSC.
Location Update: When a Mobile Station (MS) moves into a new Location Area (LA), it detects a new Location Area Identity (LAI) broadcasted by the Base Station. The MS initiates a location update request to the new MSC/VLR. The new VLR registers the MS, updates the HLR with its new VLR address, and the HLR notifies the old VLR to delete the subscriber's record.

"},{"type":"paragraph","content":"

Mobile Terminated Call (MTC) Setup

When an external party calls a GSM mobile subscriber, the following steps occur:

The call is routed from the PSTN to the Gateway MSC (GMSC) of the subscriber's home network.
The GMSC queries the HLR using the subscriber's phone number (MSISDN) to find the current VLR.
The HLR requests a Mobile Station Roaming Number (MSRN) from the current VLR.
The VLR assigns an MSRN and sends it back to the HLR, which forwards it to the GMSC.
The GMSC routes the call to the current MSC using the MSRN.
The MSC asks the VLR for the exact Location Area of the MS and initiates a 'page' across all base stations in that Location Area.
The MS responds to the page, authentication is performed, ciphering is established, and the call is finally connected.

"},{"type":"svg","src":"/assets/diagrams/rtu/cs/4/mobile-computing/diagram-21.svg","alt":"GSM Call Routing","caption":"Mobile Terminated Call Routing Process in GSM"}]}},{"id":"v2-mobile-computing-2020-pC-q22","number":22,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"Write detailed notes on Mobile IP. Explain agent discovery, registration, and tunneling in detail."}],"answer":{"summary":"Mobile IP enables mobility across networks. It involves Agent Discovery (finding FA/HA), Registration (updating location), and Tunneling (forwarding packets).","explanation":[{"type":"paragraph","content":"

Overview of Mobile IP

Mobile IP is designed to provide seamless internet connectivity for mobile nodes moving between different subnets. It ensures that the mobile node's IP address remains constant, allowing active TCP connections to survive physical movement.

"},{"type":"paragraph","content":"

Agent Discovery

Agent Discovery allows a Mobile Node (MN) to determine its current location (whether it is on its home network or a foreign network) and obtain a Care-of Address (COA).

Agent Advertisements: Home Agents (HA) and Foreign Agents (FA) periodically broadcast Agent Advertisement messages (extensions of ICMP Router Discovery) on their local subnets.
Agent Solicitations: If an MN does not hear advertisements, it can actively broadcast an Agent Solicitation message to prompt agents to respond.
Process: By analyzing the advertisements, the MN determines if it has moved. If it is on a foreign network, it acquires a COA from the FA's advertisement (FA-COA) or via DHCP (Co-located COA).

"},{"type":"paragraph","content":"

Registration

Once the MN gets a COA, it must register it with its Home Agent.

The MN sends a Registration Request message to the FA, which forwards it to the HA.
The HA verifies the MN's credentials, updates its binding cache (associating the MN's home address with the new COA), and sends a Registration Reply back to the FA.
The FA updates its visitor list and forwards the reply to the MN.

"},{"type":"paragraph","content":"

Tunneling and Encapsulation

When a Correspondent Node (CN) sends packets to the MN's home address, the HA intercepts them using proxy ARP.

Encapsulation: The HA wraps the original IP packet inside a new IP packet. The new header has the HA as the source and the COA as the destination. This is called IP-in-IP encapsulation.
Tunneling: The packet travels through the internet 'tunnel' to the FA.
Decapsulation: The FA receives the encapsulated packet, strips off the outer IP header, and delivers the original IP packet to the MN over the local wireless link.

"},{"type":"svg","src":"/assets/diagrams/rtu/cs/4/mobile-computing/diagram-22.svg","alt":"Mobile IP Process","caption":"Discovery, Registration, and Tunneling in Mobile IP"}]}}]},{"id":"mobile-computing-2022","title":"Mobile Computing (2022)","subjectSlug":"mobile-computing","subjectName":"Mobile Computing","universitySlug":"rtu","branchSlug":"computer-science","year":4,"semester":8,"examYear":2022,"paperCode":"8E8161","questions":[{"id":"v2-mobile-computing-2022-pA-q1","number":1,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What are the primary applications of mobile computing?"}],"answer":{"summary":"Mobile computing enables catastrophic real-time data access on the move. Primary applications include GPS fleet tracking, mobile banking, emergency disaster response (MANETs), and ubiquitous enterprise cloud access.","explanation":[{"type":"paragraph","content":"It completely abandons the rigid architecture of fixed LANs. A doctor can instantly pull a 5GB MRI scan via a 5G mobile tablet while in a moving ambulance, executing life-saving diagnostics completely independent of physical copper wiring."}]}},{"id":"v2-mobile-computing-2022-pA-q2","number":2,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"Define co-channel interference."}],"answer":{"summary":"Co-channel interference is the catastrophic electromagnetic collision that occurs when two mathematically distinct radio cells utilize the exact same carrier frequency simultaneously, violently corrupting both data streams.","explanation":[{"type":"paragraph","content":"Because RF spectrum is finite, cellular networks mathematically reuse the same frequencies in distant cells. If Cell A and Cell B (using the same frequency) are physically placed too close to each other without proper geographic buffering, their electromagnetic waves will physically collide, destroying the Signal-to-Interference Ratio (SIR)."}]}},{"id":"v2-mobile-computing-2022-pA-q3","number":3,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What is the role of an HLR and VLR in GSM?"}],"answer":{"summary":"The HLR is the permanent central database holding the subscriber's absolute master profile. The VLR is a temporary, volatile local database that mathematically tracks roaming users in a specific geographic zone.","explanation":[{"type":"paragraph","content":"When a user from New York (HLR) lands in London, the London VLR violently intercepts the phone. The VLR queries the NY HLR to authenticate the SIM, downloads a temporary copy of the user's cryptographic keys, and handles all local call routing until the user leaves London."}]}},{"id":"v2-mobile-computing-2022-pA-q4","number":4,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What is the difference between soft and hard handoff?"}],"answer":{"summary":"Hard Handoff (\"Break before Make\") physically severs the old connection before establishing the new one, causing a micro-drop. Soft Handoff (\"Make before Break\") mathematically maintains two simultaneous connections during the transition.","explanation":[{"type":"paragraph","content":"Hard handoff (used in GSM) is a violent hardware switch; if the new tower fails to connect, the call drops catastrophically. Soft handoff (used in CDMA) is mathematically elegant; the phone communicates with two towers simultaneously on the same frequency, and the network seamlessly merges the data streams."}]}},{"id":"v2-mobile-computing-2022-pA-q5","number":5,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"Define tunneling and encapsulation in Mobile IP."}],"answer":{"summary":"Encapsulation is the mathematical wrapping of an original IP packet inside a brand new IP header. Tunneling is the physical act of blasting this encapsulated packet across the network to a hidden endpoint.","explanation":[{"type":"paragraph","content":"In Mobile IP, when a packet arrives at the Home Agent, it cannot be routed normally because the mobile node has moved. The Home Agent violently encapsulates the packet (putting the new Care-of-Address on the outer header) and tunnels it directly to the Foreign Agent."}]}},{"id":"v2-mobile-computing-2022-pA-q6","number":6,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What is DHCP? Why is it needed in mobile networks?"}],"answer":{"summary":"DHCP (Dynamic Host Configuration Protocol) automatically and mathematically leases temporary IP addresses to devices. It is absolutely mandatory in mobile networks because physical movement constantly changes logical subnets.","explanation":[{"type":"paragraph","content":"Without DHCP, a user moving from the 3rd floor WiFi to the 4th floor WiFi would have to manually type in a new static IP address, Subnet Mask, and Default Gateway. DHCP violently automates this in milliseconds via DORA (Discover, Offer, Request, Acknowledge) broadcasts."}]}},{"id":"v2-mobile-computing-2022-pA-q7","number":7,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"Define AODV routing protocol."}],"answer":{"summary":"AODV (Ad-hoc On-Demand Distance Vector) is a reactive routing protocol. It strictly mathematically calculates a route ONLY when a node explicitly demands to send data, completely eliminating idle routing table broadcasts.","explanation":[{"type":"paragraph","content":"Unlike Proactive protocols that constantly spam the network with updates, AODV violently conserves battery and bandwidth. When a route is needed, it blasts a Route Request (RREQ). Once the path is found, it is mathematically locked; if a link breaks, a Route Error (RERR) instantly triggers a recalculation."}]}},{"id":"v2-mobile-computing-2022-pA-q8","number":8,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What are the advantages of WML over HTML?"}],"answer":{"summary":"WML (Wireless Markup Language) is mathematically engineered strictly for ultra-low bandwidth, high-latency 2G networks and microscopic monochrome screens, completely abandoning the massive graphical overhead of HTML.","explanation":[{"type":"paragraph","content":"HTML assumes unlimited bandwidth and a mouse. WML assumes 9.6 kbps and a 12-button keypad. WML violently structures data into \"Decks\" and \"Cards\" so an entire website can be downloaded in a single tiny HTTP request, preventing catastrophic battery drain on primitive cell phones."}]}},{"id":"v2-mobile-computing-2022-pA-q9","number":9,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"What is fast retransmit/fast recovery in TCP?"}],"answer":{"summary":"Fast Retransmit completely bypasses the catastrophic TCP timeout timer. If the sender receives three identical duplicate ACKs, it mathematically proves a packet was lost and instantly retransmits it.","explanation":[{"type":"paragraph","content":"In mobile networks, waiting for a 500ms timeout to retransmit a lost packet completely stalls the connection. Fast Retransmit violently detects the gap in sequence numbers, resends the packet immediately, and Fast Recovery mathematically prevents the TCP Congestion Window from collapsing to zero."}]}},{"id":"v2-mobile-computing-2022-pA-q10","number":10,"marks":2,"tags":["Part A"],"text":[{"type":"paragraph","content":"List the main components of WAP architecture."}],"answer":{"summary":"The absolute core components of WAP are the WAP Client (mobile device), the WAP Gateway (the mathematical protocol translator), and the Origin Web Server (hosting the WML content).","explanation":[{"type":"paragraph","content":"The WAP Gateway is the architectural bottleneck. It violently translates binary WAP protocols (WSP/WTP) coming from the mobile network into standard text-based HTTP/TCP protocols to fetch data from the internet, and then aggressively compiles the WML response into binary to save wireless bandwidth."}]}},{"id":"v2-mobile-computing-2022-pB-q11","number":11,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Discuss the logical channels used in GSM."}],"answer":{"summary":"A rigorous mathematical breakdown of GSM Logical Channels. Violently divides the spectrum into Traffic Channels (TCH) for human voice and Control Channels (BCH, CCCH, DCCH) for absolute network signaling and synchronization.","explanation":[{"type":"heading","content":"Logical Channels in GSM Architecture"},{"type":"paragraph","content":"In GSM, the physical radio frequency is just raw electromagnetic energy. To mathematically transmit human voice and network commands simultaneously without catastrophic collision, the physical layer is violently multiplexed (TDMA/FDMA) into distinct Logical Channels. These are strictly categorized into Traffic Channels and Control Channels."},{"type":"heading","content":"1. Traffic Channels (TCH)"},{"type":"paragraph","content":"TCH is the absolute payload carrier. It transmits the digitized human voice or raw user data. It is mathematically divided into Full-Rate (TCH/F at 22.8 kbps) and Half-Rate (TCH/H at 11.4 kbps) depending on network congestion."},{"type":"heading","content":"2. Control Channels (CCH)"},{"type":"paragraph","content":"These channels carry exactly zero human voice. They are strictly reserved for the violent, high-speed mathematical signaling required to keep the network alive."},{"type":"subheading","content":"A. Broadcast Control Channel (BCH)"},{"type":"paragraph","content":"A one-way downlink from the Tower to the Mobile. It acts as a lighthouse."},{"type":"list","items":["**FCCH (Frequency Correction):** Blasts a pure sine wave to mathematically force the mobile's quartz clock to synchronize with the tower.","**SCH (Synchronization):** Broadcasts the TDMA frame number so the phone mathematically knows exactly when to transmit."]},{"type":"subheading","content":"B. Common Control Channel (CCCH)"},{"type":"list","items":["**PCH (Paging Channel):** When someone calls you, the tower violently blasts your IMSI across the PCH to wake up your phone.","**RACH (Random Access):** The ONLY uplink channel here. If a user wants to make a call, the phone violently transmits a request on the RACH (using Slotted ALOHA).","**AGCH (Access Grant):** The tower replies, mathematically assigning the phone a dedicated frequency."]},{"type":"subheading","content":"C. Dedicated Control Channel (DCCH)"},{"type":"list","items":["**SDCCH:** Used for call setup and mathematically transferring SMS text messages.","**SACCH & FACCH:** Violently monitors real-time signal strength and executes the mathematical commands to trigger a Handoff if the signal drops."]}]}},{"id":"v2-mobile-computing-2022-pB-q12","number":12,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Explain the hidden terminal and exposed terminal problems and their solutions (MACA)."}],"answer":{"summary":"A critical analysis of the Hidden and Exposed Terminal problems in wireless MAC. Explains how CSMA/CD mathematically fails in RF, and how MACA utilizes violent RTS/CTS handshakes to prevent catastrophic packet collisions.","explanation":[{"type":"heading","content":"Wireless MAC: Hidden and Exposed Terminal Problems"},{"type":"paragraph","content":"In a wired Ethernet network, CSMA/CD works perfectly because electricity on a wire can be sensed everywhere. In wireless networks, radio waves have strict physical boundaries. This physical limitation creates two catastrophic mathematical failures in standard carrier sensing."},{"type":"heading","content":"1. The Hidden Terminal Problem (The Collision)"},{"type":"paragraph","content":"Assume Node A and Node C are both in range of Node B, but A and C are completely out of range of each other. Node A wants to send data to B. A mathematically senses the air, hears silence, and starts transmitting. A millisecond later, Node C also wants to send to B. C senses the air, hears silence (because it cannot physically hear A), and transmits. \n*The Catastrophe:* The two RF waves violently collide at Node B. The packet is completely destroyed."},{"type":"heading","content":"2. The Exposed Terminal Problem (The Wasted Bandwidth)"},{"type":"paragraph","content":"Assume Node B is transmitting to Node A. Node C (in range of B) wants to transmit to Node D (out of range of B). Node C mathematically senses the air, hears B transmitting, and violently aborts its transmission to avoid a collision. \n*The Catastrophe:* This is mathematically stupid. C's transmission to D would have absolutely no impact on B's transmission to A. Bandwidth is catastrophically wasted due to a false alarm."},{"type":"heading","content":"The Solution: MACA (Multiple Access with Collision Avoidance)"},{"type":"paragraph","content":"MACA completely abandons raw carrier sensing and replaces it with a violent, mathematical handshake using RTS/CTS (Request To Send / Clear To Send)."},{"type":"list","items":["**Solving Hidden Terminal:** Node A sends an RTS to B. B broadcasts a CTS. Node C mathematically hears the CTS from B and instantly freezes, knowing B is receiving data. Collision averted.","**Solving Exposed Terminal:** Node B sends an RTS to A. Node C hears the RTS, but NOT the CTS from A. Node C mathematically deduces that it is perfectly safe to transmit to D. Wasted bandwidth recovered."]}]}},{"id":"v2-mobile-computing-2022-pB-q13","number":13,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Describe Mobile TCP (M-TCP) and its advantages over traditional TCP."}],"answer":{"summary":"A definitive explanation of Mobile TCP (M-TCP). Details how it violently splits the connection at the Supervisory Host (SH) to mathematically shield the sender from temporary wireless disconnections without triggering catastrophic congestion control.","explanation":[{"type":"heading","content":"Mobile TCP (M-TCP) Architecture"},{"type":"paragraph","content":"Standard TCP was mathematically engineered for wired networks. If it detects a packet loss, it blindly assumes the network is heavily congested. It violently triggers Congestion Control, shrinking its transmission window to zero and killing bandwidth. In mobile networks, packet loss is usually caused by temporary RF fading or handoffs, NOT congestion. Triggering congestion control here is a catastrophic algorithmic failure. Mobile TCP (M-TCP) was engineered to fix this."},{"type":"heading","content":"The Split Connection Architecture"},{"type":"paragraph","content":"M-TCP physically splits the end-to-end TCP connection at the edge of the wireless network using a Supervisory Host (SH) located at the base station."},{"type":"list","items":["**The Wired Segment (Sender to SH):** Standard, unmodified TCP is used. The SH acts as a massive buffer.","**The Wireless Segment (SH to Mobile Node):** A custom, highly aggressive M-TCP protocol is used."]},{"type":"heading","content":"The M-TCP Mathematical Execution"},{"type":"paragraph","content":"If the Mobile Node drives into a tunnel and loses RF signal, the SH stops receiving ACKs."},{"type":"list","items":["Instead of letting the sender time out and trigger catastrophic congestion control, the SH violently intercepts the connection.","The SH sends a TCP ACK to the sender with a **Window Size of Zero**. This mathematically forces the sender into \"Persist Mode\".","The sender instantly stops sending data but mathematically keeps the connection wide open, completely bypassing the congestion backoff timer.","When the Mobile Node exits the tunnel, the SH violently blasts an ACK with a full window size. The sender instantly resumes transmission at absolute maximum speed, suffering zero latency penalties."]}]}},{"id":"v2-mobile-computing-2022-pB-q14","number":14,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Explain the Ad hoc On-Demand Distance Vector (AODV) routing protocol."}],"answer":{"summary":"An exhaustive mathematical breakdown of AODV Routing. Explains the reactive Route Request (RREQ) flood, the precise Destination Sequence Numbers to prevent routing loops, and the violent Route Error (RERR) propagation upon link failure.","explanation":[{"type":"heading","content":"Ad hoc On-Demand Distance Vector (AODV) Routing"},{"type":"paragraph","content":"AODV is a highly aggressive, reactive routing protocol engineered specifically for Mobile Ad-hoc Networks (MANETs). In a MANET, nodes are constantly moving, causing physical links to violently snap. Proactive protocols (like DSDV) waste massive battery power continuously broadcasting routing tables. AODV strictly calculates a mathematical route ONLY when a node explicitly demands it."},{"type":"heading","content":"1. The Route Discovery Phase (RREQ and RREP)"},{"type":"paragraph","content":"When Node S wants to send data to Node D, but has no route:"},{"type":"list","items":["Node S violently broadcasts a Route Request (RREQ) packet to all immediate neighbors. This packet contains `(Source_ID, Dest_ID, Dest_Seq_Num, Hop_Count)`.","The neighbors mathematically check if they have a route. If not, they increment the Hop Count and rebroadcast the RREQ, creating a massive expanding flood.","To prevent infinite broadcast storms, nodes strictly maintain a temporary reverse-path pointer to the node they received the RREQ from.","When the RREQ hits Node D (or a node with a fresh route to D), it violently fires a Route Reply (RREP) packet backward along the exact reverse path, mathematically locking the route into the routing tables."]},{"type":"heading","content":"2. Destination Sequence Numbers (The Mathematical Shield)"},{"type":"paragraph","content":"The absolute genius of AODV. Every node maintains a monotonically increasing Sequence Number. When comparing two routes to D, a node will strictly choose the route with the highest Sequence Number (freshest data). This mathematically guarantees absolute immunity against catastrophic routing loops (the Count-to-Infinity problem)."},{"type":"heading","content":"3. Route Maintenance (RERR)"},{"type":"paragraph","content":"If an intermediate node detects that the next hop has physically driven out of range, it violently blasts a Route Error (RERR) packet back to the Source. The Source immediately deletes the broken mathematical path and initiates a new RREQ flood."}]}},{"id":"v2-mobile-computing-2022-pB-q15","number":15,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"How does packet delivery happen to and from a mobile node in Mobile IP?"}],"answer":{"summary":"A critical review of Mobile IP packet delivery. Details the rigid mathematical triangle routing: how the Home Agent intercepts and encapsulates packets for tunneling, and how the Mobile Node bypasses the HA for direct reverse routing.","explanation":[{"type":"heading","content":"Packet Delivery Mechanism in Mobile IP"},{"type":"paragraph","content":"In standard TCP/IP, if a laptop moves to a new subnet, its IP address must physically change, violently terminating all active TCP sockets (downloads crash). Mobile IP mathematically solves this by assigning two IP addresses: a permanent Home Address (HoA) and a temporary Care-of-Address (CoA). The delivery mechanism relies on catastrophic tunneling."},{"type":"heading","content":"Phase 1: Delivery TO the Mobile Node (Triangle Routing)"},{"type":"paragraph","content":"Assume a Correspondent Node (CN) wants to send a packet to the Mobile Node (MN)."},{"type":"list","items":["The CN is completely ignorant of the MN's physical location. It mathematically addresses the packet to the MN's permanent Home Address.","The standard internet routers blindly blast the packet toward the MN's Home Network.","Because the MN is gone, the **Home Agent (HA)** (a router on the home network) violently intercepts the packet using Proxy ARP.","The HA mathematically executes IP-in-IP Encapsulation. It takes the original packet, wraps it in a brand new IP header addressed to the MN's current Care-of-Address (CoA), and blasts it through a secure Tunnel.","The **Foreign Agent (FA)** (or the MN itself) receives the tunneled packet, violently strips off the outer header, and delivers the original packet to the MN."]},{"type":"heading","content":"Phase 2: Delivery FROM the Mobile Node"},{"type":"paragraph","content":"This is mathematically much simpler."},{"type":"list","items":["When the MN replies to the CN, it does NOT need to use the tunnel.","It constructs a standard IP packet with its Home Address as the Source, and the CN's address as the Destination.","It blasts the packet to the standard local router, which routes it directly to the CN, completely bypassing the Home Agent (unless Reverse Tunneling is strictly forced by a firewall)."]}]}},{"id":"v2-mobile-computing-2022-pB-q16","number":16,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"Discuss Bluetooth architecture, including Piconet and Scatternet."}],"answer":{"summary":"An architectural exposition of Bluetooth. Violently defines the strict Master-Slave physics of a Piconet, the TDD polling algorithm, and how overlapping Piconets mathematically merge into a massive chaotic Scatternet.","explanation":[{"type":"heading","content":"Bluetooth Architecture: Piconets and Scatternets"},{"type":"paragraph","content":"Bluetooth (IEEE 802.15.1) is a highly aggressive, short-range Personal Area Network (PAN) protocol. It completely abandons standard Wi-Fi CSMA/CA contention in favor of a rigid, mathematically dictatorial Time-Division Duplex (TDD) polling architecture to guarantee zero packet collisions in a noisy 2.4 GHz spectrum."},{"type":"heading","content":"1. The Piconet (The Dictatorship)"},{"type":"paragraph","content":"The fundamental architectural building block of Bluetooth."},{"type":"list","items":["**Structure:** A Piconet consists of exactly ONE Master node and up to SEVEN active Slave nodes (total 8 devices).","**The Mathematics of Polling:** The Master is an absolute dictator. A Slave is mathematically forbidden from transmitting unless explicitly commanded by the Master. The Master executes a strict TDD algorithm, polling Slave 1 in an even time slot (625 $\\mu$s), and Slave 1 violently replies in the next odd time slot.","**Frequency Hopping:** To survive microwave interference, the Master mathematically calculates a pseudo-random Frequency Hopping Spread Spectrum (FHSS) pattern. The entire Piconet violently changes radio frequency 1,600 times per second in perfect unison."]},{"type":"heading","content":"2. The Scatternet (The Web)"},{"type":"paragraph","content":"If you need to connect 20 devices, a single Piconet mathematically fails. The architecture solves this by violently fusing multiple Piconets together into a Scatternet."},{"type":"list","items":["**The Bridge Node:** A device can simultaneously participate in multiple Piconets. It can mathematically act as a Slave in Piconet A, and a Master in Piconet B.","**Time-Slicing Execution:** Because a radio chip can only physically tune to one frequency at a time, the Bridge node must violently rapidly switch its synchronization context between the two Piconets, acting as a mathematical router to pass data between the isolated networks."]}]}},{"id":"v2-mobile-computing-2022-pB-q17","number":17,"marks":4,"tags":["Part B"],"text":[{"type":"paragraph","content":"What is WAP? Explain the WAP protocol stack in brief."}],"answer":{"summary":"A critical mathematical breakdown of the WAP Architecture. Details how the protocol stack violently compresses and optimizes internet data (HTTP/TCP) into lightweight binary protocols (WSP/WTP) to prevent catastrophic battery drain on 2G devices.","explanation":[{"type":"heading","content":"WAP (Wireless Application Protocol) and its Protocol Stack"},{"type":"paragraph","content":"WAP is an obsolete but architecturally brilliant protocol designed for the brutal physics of early 2G mobile networks (9.6 kbps bandwidth, massive latency, and phones with 16KB of RAM). Sending raw HTTP over TCP to a Nokia 3310 would mathematically crash the phone. WAP completely reinvented the internet stack specifically for the wireless domain."},{"type":"heading","content":"The WAP Protocol Stack Architecture"},{"type":"paragraph","content":"The stack mathematically mirrors the OSI model but is aggressively optimized for binary compression."},{"type":"list","items":["**WAE (Wireless Application Environment):** The absolute top layer. It replaces HTML with WML (Wireless Markup Language) and WMLScript. It dictates how the micro-browser violently renders \"Decks\" of data on a tiny screen.","**WSP (Wireless Session Protocol):** The mathematical replacement for HTTP. It provides a binary-encoded version of HTTP 1.1, violently stripping out massive text headers to crush the payload size. It supports session suspension (if a call interrupts data).","**WTP (Wireless Transaction Protocol):** A lightweight, message-oriented protocol. It completely abandons the catastrophic three-way handshake of TCP, providing reliable request/response execution with exactly ONE acknowledgment, slashing latency.","**WTLS (Wireless Transport Layer Security):** The mobile equivalent of SSL/TLS. It provides brutal cryptographic encryption (RSA, ECC) but is mathematically optimized to use minimal CPU cycles to save battery.","**WDP (Wireless Datagram Protocol):** The adaptation layer. It mathematically interfaces the upper WAP stack with whatever physical bearer network is underneath (GSM, CDMA, CDPD), acting essentially like UDP."]}]}},{"id":"v2-mobile-computing-2022-pC-q18","number":18,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"Discuss the various routing protocols used in Mobile Ad-hoc Networks (MANETs). Compare DSDV, AODV, and DSR."}],"answer":{"summary":"A massive architectural exposition on MANET Routing Protocols. Violently dissects the mathematical algorithms and catastrophic scaling limits of Proactive DSDV against Reactive AODV and Source-Routed DSR.","explanation":[{"type":"heading","content":"Routing Protocols in Mobile Ad-hoc Networks (MANETs)"},{"type":"paragraph","content":"A MANET is a chaotic, self-configuring mathematical web of mobile routers (nodes) connected by fragile, temporary wireless links. Because there is absolutely zero fixed infrastructure (no cell towers), every single smartphone or laptop must violently act as a router for the entire network. Standard internet protocols (OSPF, BGP) fail catastrophically here due to extreme topology churn. MANET protocols are strictly divided into Proactive and Reactive architectures."},{"type":"heading","content":"1. DSDV (Destination-Sequenced Distance-Vector) - Proactive"},{"type":"paragraph","content":"DSDV is a Proactive (Table-Driven) protocol. It mathematically forces every single node to maintain a complete routing table containing the exact distance to every other node in the entire network."},{"type":"list","items":["**The Mechanism:** Nodes violently broadcast their routing tables to their neighbors periodically (e.g., every 15 seconds) or whenever a link state changes.","**The Innovation (Sequence Numbers):** It modifies the classic Bellman-Ford algorithm by appending a strict Destination Sequence Number. Nodes only accept routing updates if the sequence number is newer. This mathematical genius completely annihilates the catastrophic \"Count-to-Infinity\" routing loop problem.","**The Demerit:** In a highly mobile network of 10,000 nodes, 99% of the calculated routes will never be used. The constant violent broadcasting of routing tables completely saturates the wireless bandwidth and drains the battery of every device to zero, even if no actual user data is being transmitted."]},{"type":"heading","content":"2. AODV (Ad-hoc On-Demand Distance Vector) - Reactive"},{"type":"paragraph","content":"AODV completely abandons proactive tables. It is Reactive (On-Demand). It mathematically calculates a route strictly ONLY when a node explicitly demands to send data."},{"type":"list","items":["**The Mechanism:** When Node A wants to send data to D, it blasts a Route Request (RREQ) flood. When D replies with a Route Reply (RREP), intermediate nodes mathematically lock the route into their local tables.","**The Merit:** It violently conserves bandwidth and battery power because it generates zero routing overhead when the network is idle.","**The Demerit:** High latency for the very first packet. The application must mathematically wait for the RREQ/RREP flood to resolve before transmitting."]},{"type":"heading","content":"3. DSR (Dynamic Source Routing) - Reactive"},{"type":"paragraph","content":"DSR is also Reactive, but its mathematical architecture is completely different from AODV. It utilizes **Strict Source Routing**."},{"type":"list","items":["**The Mechanism:** During the RREQ flood, every intermediate node violently appends its own IP address to the packet header. When the RREQ reaches the destination, the packet mathematically contains the entire, absolute hop-by-hop path (e.g., A -> B -> C -> D).","**The Execution:** The Destination sends this entire path back to the Source. The Source then violently injects this complete mathematical path into the header of every single data packet it sends. Intermediate nodes do not need routing tables; they simply blindly follow the list in the header.","**The Demerit:** As the network scales, the path list in the packet header becomes massive, mathematically consuming 20% of the payload bandwidth just for routing overhead."]},{"type":"svg","content":""}]}},{"id":"v2-mobile-computing-2022-pC-q19","number":19,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"Explain GSM system architecture in detail. Also, discuss security services provided by GSM."}],"answer":{"summary":"A massive breakdown of GSM System Architecture and Cryptographic Security. Details the rigid physical hierarchy of the BSS, NSS, and OSS, and violently exposes the exact mathematical execution of A3 Authentication and A5 Air-Interface Encryption.","explanation":[{"type":"heading","content":"GSM System Architecture and Security Services"},{"type":"paragraph","content":"The Global System for Mobile Communications (GSM) is the absolute foundational architecture of modern mobile telephony. It is a highly rigid, hierarchical mathematical system strictly divided into three major physical subsystems: The Base Station Subsystem (BSS), the Network and Switching Subsystem (NSS), and the Operation Support Subsystem (OSS)."},{"type":"heading","content":"1. The System Architecture"},{"type":"subheading","content":"A. Base Station Subsystem (BSS)"},{"type":"paragraph","content":"The physical RF frontline."},{"type":"list","items":["**BTS (Base Transceiver Station):** The actual physical cell tower and antennas. It executes the violent TDMA/FDMA multiplexing and raw radio transmission to the mobile phone.","**BSC (Base Station Controller):** The mathematical brain behind the towers. One BSC violently controls dozens of BTSs. It mathematically manages radio resource allocation, frequency hopping, and executes intra-BSC handoffs."]},{"type":"subheading","content":"B. Network and Switching Subsystem (NSS)"},{"type":"paragraph","content":"The absolute core routing and database engine."},{"type":"list","items":["**MSC (Mobile Switching Center):** The massive digital telephone exchange. It violently routes all calls, controls billing, and executes catastrophic inter-BSC handoffs.","**HLR (Home Location Register):** The master database containing the absolute cryptographic keys ($K_i$) and permanent profiles of every subscriber.","**VLR (Visitor Location Register):** A fast, volatile RAM database attached to the MSC that mathematically caches the profiles of users currently roaming in its geographic zone."]},{"type":"heading","content":"2. GSM Security Architecture"},{"type":"paragraph","content":"In analog 1G networks, anyone with a police scanner could violently listen to your phone call. GSM mathematically annihilated this using strict cryptographic algorithms."},{"type":"subheading","content":"A. Authentication (The A3 Algorithm)"},{"type":"paragraph","content":"The network must mathematically prove you are who you claim to be."},{"type":"list","items":["The HLR possesses your absolute secret key ($K_i$). Your SIM card possesses the exact same $K_i$. $K_i$ NEVER physically transmits over the air.","The Network violently blasts a 128-bit random number (RAND) to the phone.","The SIM card pushes the RAND and its secret $K_i$ through the **A3 cryptographic hashing algorithm**. It mathematically outputs a 32-bit Signed Response (SRES).","The phone transmits the SRES back. The Network simultaneously executed the exact same A3 math. If the SRES matches perfectly, authentication is absolute."]},{"type":"subheading","content":"B. Data Encryption (The A5 Algorithm)"},{"type":"paragraph","content":"Once authenticated, the air interface must be violently encrypted."},{"type":"list","items":["The SIM and Network use the RAND and $K_i$ and push them through the **A8 algorithm** to mathematically generate a 64-bit session key called the Cipher Key ($K_c$).","The phone's hardware violently pushes the digitized human voice and the $K_c$ through the **A5 stream cipher**. This encrypts the RF transmission, rendering it mathematically impossible for hackers with scanners to decode the voice data."]}]}},{"id":"v2-mobile-computing-2022-pC-q20","number":20,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"Describe the classical TCP improvements for mobility: I-TCP, Snooping TCP, and Mobile TCP."}],"answer":{"summary":"An exhaustive theoretical critique of Classical TCP Improvements for Mobility. Violently contrasts the catastrophic architecture of I-TCP (splitting connections) against the elite, transparent Snooping TCP algorithm, detailing their exact mathematical manipulations of congestion windows.","explanation":[{"type":"heading","content":"Classical TCP Improvements for Mobility"},{"type":"paragraph","content":"Standard TCP operates on a rigid mathematical assumption: Packet Loss equals Network Congestion. In wireless networks, packet loss is caused by RF fading, bit errors, and handoffs. Standard TCP violently reacts by triggering Congestion Control (halving the transmission window), causing catastrophic, unnecessary drops in throughput. To fix this physics mismatch, three core architectural improvements were engineered."},{"type":"heading","content":"1. Indirect TCP (I-TCP)"},{"type":"paragraph","content":"I-TCP executes a catastrophic architectural violation: it physically breaks TCP end-to-end semantics."},{"type":"list","items":["**The Mechanism:** The TCP connection is violently split at the Base Station (BS). The Fixed Host talks strictly to the BS using standard TCP. The BS opens a completely separate, highly optimized wireless TCP connection to the Mobile Node.","**The Math:** If the wireless link drops a packet, the BS intercepts it and instantly executes a local retransmission. The Fixed Host mathematically never sees the error, so it NEVER triggers its massive congestion control algorithm.","**The Demerit:** If the BS violently crashes *after* acknowledging a packet to the Fixed Host, but *before* delivering it to the Mobile Node, the packet is mathematically deleted from existence, completely violating TCP reliability."]},{"type":"heading","content":"2. Snooping TCP (The Transparent Interceptor)"},{"type":"paragraph","content":"Snooping TCP perfectly preserves absolute end-to-end semantics."},{"type":"list","items":["**The Mechanism:** The Base Station does NOT terminate the connection. It acts as a violent, transparent \"Snooper\". It mathematically inspects the headers of every single TCP packet flowing through it and caches them in RAM.","**The Execution:** If the Mobile Node loses a packet, it will send Duplicate ACKs backward. The Snooping BS violently intercepts these Duplicate ACKs before they reach the Fixed Host. Because the BS has the packet in its RAM cache, it instantly executes a local retransmission to the Mobile Node.","**The Merit:** The Fixed Host is completely shielded from the wireless chaos, and absolute end-to-end TCP integrity is mathematically preserved."]},{"type":"heading","content":"3. Mobile TCP (M-TCP)"},{"type":"paragraph","content":"Engineered specifically for networks with frequent, catastrophic disconnections (like driving through tunnels)."},{"type":"list","items":["**The Mechanism:** The Supervisory Host (SH) monitors the link. If the Mobile Node violently disconnects, the SH intercepts the connection and fires an ACK back to the Fixed Host with a **TCP Window Size of 0**.","**The Math:** A window size of 0 mathematically forces the Fixed Host into \"Persist Mode\". It instantly stops transmitting but keeps all its timers frozen. It completely bypasses Congestion Control.","**The Reconnection:** When the node reconnects, the SH violently opens the window. The Fixed Host instantly blasts data at maximum speed, suffering zero mathematical slow-start penalty."]}]}},{"id":"v2-mobile-computing-2022-pC-q21","number":21,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"Explain the MAC layer of IEEE 802.11. How does it handle collision avoidance?"}],"answer":{"summary":"A massive architectural breakdown of the IEEE 802.11 MAC Layer. Violently details the mathematical execution of DCF (CSMA/CA) and PCF, exposing how strict Inter-Frame Spaces (DIFS, SIFS) and the Exponential Backoff algorithm prevent catastrophic radio collisions.","explanation":[{"type":"heading","content":"The MAC Layer of IEEE 802.11 and Collision Avoidance"},{"type":"paragraph","content":"The IEEE 802.11 (Wi-Fi) MAC layer faces a catastrophic physical problem: Radios are Half-Duplex. They mathematically cannot transmit and listen at the exact same time. Therefore, Collision Detection (CSMA/CD used in wired Ethernet) is physically impossible. Wi-Fi must execute Collision Avoidance (CSMA/CA). The architecture provides two strict mathematical coordination functions: DCF and PCF."},{"type":"heading","content":"1. The Foundation: Distributed Coordination Function (DCF)"},{"type":"paragraph","content":"DCF is the absolute mandatory mechanism based on CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance)."},{"type":"subheading","content":"The Mathematical Execution of CSMA/CA"},{"type":"list","items":["**Carrier Sensing:** Before Node A transmits, it mathematically measures the RF energy on the channel (Clear Channel Assessment).","**DIFS (DCF Inter-Frame Space):** If the channel is idle, Node A CANNOT transmit immediately. It must violently wait for a strict mathematical duration called DIFS. If the channel remains idle for the entire DIFS, it can proceed.","**The Collision (Exponential Backoff):** If the channel is busy, Node A violently aborts. It enters a Backoff phase. It mathematically generates a random integer between $0$ and the Contention Window ($CW$). It multiplies this integer by the Slot Time. It then counts down this timer. It only transmits when the timer hits exactly zero. If another collision occurs, the $CW$ is violently doubled (Binary Exponential Backoff) to rapidly defuse network congestion."]},{"type":"heading","content":"2. The Mathematical Handshake: RTS/CTS"},{"type":"paragraph","content":"To solve the catastrophic Hidden Terminal Problem (where two nodes out of range of each other simultaneously blast the Access Point), 802.11 employs an optional RTS/CTS mechanism."},{"type":"list","items":["Node A sends a tiny Request To Send (RTS) packet to the Access Point (AP).","The AP blasts a Clear To Send (CTS) packet to the entire network.","Every single hidden node mathematically hears the CTS, reads the embedded \"Duration\" integer, and violently freezes their own transmissions (setting their Network Allocation Vector - NAV) for that exact duration, guaranteeing Node A a flawless, collision-free transmission window."]},{"type":"heading","content":"3. Point Coordination Function (PCF)"},{"type":"paragraph","content":"An optional, completely dictatorial architecture. The Access Point acts as an absolute Point Coordinator. It mathematically polls every single node, strictly granting them permission to transmit. This completely annihilates collisions and provides rigid Quality of Service (QoS) for real-time video/voice, but consumes massive bandwidth overhead."}]}},{"id":"v2-mobile-computing-2022-pC-q22","number":22,"marks":10,"tags":["Part C"],"text":[{"type":"paragraph","content":"Write a comprehensive note on Mobile IP, detailing the process of registration, tunneling, and reverse tunneling."}],"answer":{"summary":"A definitive theoretical dissection of Mobile IP. Details the catastrophic failure of standard IP routing for mobility, and explains how the architectural pipeline of Agent Discovery, Registration, and IP-in-IP Encapsulation Tunneling mathematically shields the IP address from physical movement.","explanation":[{"type":"heading","content":"Comprehensive Architecture of Mobile IP"},{"type":"paragraph","content":"In standard TCP/IP architecture, an IP address serves two violently conflicting purposes: it is the mathematical Identity of the endpoint, and it is the physical Routing Coordinate. If a laptop moves from the Delhi network to the Mumbai network, its physical coordinate changes. Standard IP mathematically forces the laptop to drop its old IP and get a new one, catastrophically severing all active TCP connections. Mobile IP was engineered to violently shatter this link, decoupling Identity from Location."},{"type":"heading","content":"The Core Components"},{"type":"list","items":["**Home Address (HoA):** The absolute, permanent mathematical Identity of the Mobile Node (MN) (e.g., `192.168.1.50`).","**Care-of-Address (CoA):** The temporary physical Routing Coordinate assigned to the MN when it roams to a foreign network (e.g., `10.0.0.10`).","**Home Agent (HA):** A router on the home network that mathematically defends the HoA.","**Foreign Agent (FA):** A router on the visited network that assists the MN."]},{"type":"heading","content":"Phase 1: Agent Discovery and Registration"},{"type":"paragraph","content":"When the MN drives into the Mumbai network, it mathematically detects a new router (the FA) broadcasting ICMP Router Advertisements."},{"type":"list","items":["The MN requests a temporary Care-of-Address (CoA) from the FA.","The MN violently executes **Registration**. It sends a cryptographically signed message through the FA back to its Home Agent (HA) in Delhi, stating: \"I am mathematically at CoA `10.0.0.10` right now.\""]},{"type":"heading","content":"Phase 2: Encapsulation and Tunneling"},{"type":"paragraph","content":"When a web server (Correspondent Node) sends a packet to the MN, it blindly addresses it to the permanent HoA (`192.168.1.50`)."},{"type":"list","items":["The packet physically arrives at the Delhi Home Network. The Home Agent violently intercepts it using Proxy ARP (telling the network, \"I am the MN\").","The HA executes **IP-in-IP Encapsulation**. It takes the entire original IP packet and mathematically wraps it inside a brand new IP header addressed to the CoA (`10.0.0.10`).","The HA blasts this encapsulated packet through the internet (the Tunnel).","The Foreign Agent violently strips off the outer header and delivers the pristine original packet to the MN. The MN's TCP stack is completely unaware it ever moved."]},{"type":"heading","content":"Phase 3: Reverse Tunneling"},{"type":"paragraph","content":"Normally, the MN replies directly to the web server, bypassing the HA. However, enterprise firewalls execute strict \"Ingress Filtering\"—they will mathematically drop any packet exiting the Mumbai network that claims to have a Delhi Source IP (`192.168.1.50`). To survive this, the MN must violently execute **Reverse Tunneling**, encapsulating its outgoing packets and firing them backward through the FA to the HA, which then strips them and forwards them legally to the web server."}]}}]}],"loading":false,"error":null}}}

Q7Mobile Computing

Question

Answer