Wireless Mobile Networking - Ad-hoc Networks 4

<p>Unintended congestion control adjustments (D)</p> Signup and view all the answers

<p>By buffering packets and sending local acknowledgments (C)</p> Signup and view all the answers

<p>Proactive (B)</p> Signup and view all the answers

<p>DSDV (C)</p> Signup and view all the answers

<p>It does not exchange information until required. (C)</p> Signup and view all the answers

<p>DSR has lighter routing overhead than DSDV. (C)</p> Signup and view all the answers

<p>It combines features of DSR and DSDV. (B)</p> Signup and view all the answers

<p>DSDV has lower delay than DSR. (A)</p> Signup and view all the answers

<p>Unsuitability for high mobility ad hoc networks. (C)</p> Signup and view all the answers

<p>Initiates path discovery and determines the route. (A)</p> Signup and view all the answers

A routing protocol that periodically updates routing tables with connectivity information for all known destinations.

A routing protocol that only starts finding paths when a source wants to send data to a destination.

DSDV has a faster route setup time because it maintains up-to-date routing tables.

DSR has lower routing overhead because it only discovers routes when needed, not constantly.

DSDV typically leads to shorter routes because it has a global view of the network.

DSR routes can be longer because they are determined on a single hop basis.

DSDV has lower average end-to-end delay because its routes are typically more efficient.

DSR can have higher average end-to-end delay because its route discovery process takes extra time.

A routing protocol for mobile ad hoc networks (MANETs) that combines features from DSR (Dynamic Source Routing) and DSDV (Destination-Sequenced Distance-Vector). It inherits the on-demand route discovery and maintenance from DSR and the hop-by-hop routing, sequence numbers, and periodic beacons from DSDV. This protocol focuses on maintaining only active routes for efficiency.

A common problem in wireless networks where TCP's congestion control mechanisms misinterpret packet loss as network congestion, leading to unnecessary slowdowns and throughput degradation. This happens because wireless networks have unique characteristics, such as frequent path breaks and high packet loss rates, which TCP might interpret incorrectly.

A technique used to improve TCP performance in ad hoc networks by separating the long TCP connection into smaller, more manageable connections. This addresses the fragmentation issues caused by frequent path breaks and reduces the impact of packet loss. This approach also often uses proxy nodes to help buffer packets and manage reliability.

A technique used to improve TCP performance in ad hoc networks by providing the TCP source with feedback about the network conditions. This feedback helps the TCP source to better understand the network dynamics and adjust its transmission behavior accordingly. This technique can help to address the issue of misinterpretation of packet loss and improve overall throughput.

A route in a network that allows data to flow only in one direction. This is a challenge in ad hoc networks because the communication path might be broken or unreliable due to node mobility and frequent changes in network topology.