Solving Triangle Routing Problem by Using Route Optimization Technique in Mobile

The demand for internet service has increased expeditiously and users demand new services internet with a high-speed data rate to run many internet programs in parallel. Most Internet users want to run many applications such as video, audio, and many other software programs at the same time. After the COVID-19, the demand for new internet services has increased dramatically for online classes, and video lectures in real-time. Therefore, demand for fast internet services via wireless communication has increased rapidly. The user demands a high data rate and more bandwidth for internet services. There are many issues regarding high data rate but one major problem occurs when the user changes his location or moves to a new network because a new IP address must be, assign with no delay. Hence, the need of dynamic IP addresses is required, whenever a mobile host moves to another location. The packets do not come in a single form and an agent is involved in the whole process, the delay occurs because the agent again assigns a new IP address. This problem occurs in the wireless network. The second problem is the inefficient behavior of non-optimized Mobile IP. In mobile IP protocol, packets of the variable lengths are sent through the wire or wirelessly to the hosts to the destination from, the main location and have to be sent via the agent currently in NS-2. The variable-length packets can be routed directly from mobile hosts in a wired system. This type of routing is called “triangle routing”. In this paper, the dynamic route optimization technique has been proposed to address the delay problem. In addition, the implementations of Mobile IP on wired- cum wireless scenario and the “Route Optimization” extension in the NS2 are used. The simulation tool is used to solve the Mobile IP problem by using dynamic IP addresses considering that the Mobile host moves from one network to another network freely. The optimization used in Mobile IP to solve the triangular routing problem