10 likes | 115 Vues
Explore an innovative equation-based solution to TCP window adjustment challenges in ad hoc networks. Overcome packet corruption, caching issues, and resource limitations while addressing mobility-induced link failures. This design optimizes congestion window size by incorporating individual node loss rates and incorporating FP forwarding probabilities. Obtain fast congestion window estimations for improved network efficiency.
E N D
Equation-Based TCP Window Adjustment • Problem • Packet corruption caused by wireless transmission • Caching and retransmission at base station. • Each node in ad hoc network doesn’t have enough resource. • Link failure due to mobility • Explicit notification — freeze TCP states until new route found. • Old states may not be appropriate for new route. • Design • Objective: fast estimation of congestion window size • Node i keeps its own congestion loss rate pi • TCP packet has an additional field, FP (Forwarding Probability). • FP is initially set to 1 , and multiplied by 1-piat each intermediate node i. • Receiver reports FP to the sender with ACK. • Congestion window is calculated from the path loss rate p = 1-FP: • Results 1 • Results 2 Project team: Min Sik Kim, Eunjin Jung URL: http://www.cs.utexas.edu/users/minskim/mobile/