Route Optimization Problems with Local Mobile Nodes in Nested Mobile Networks

2006 ◽  
pp. 515-524 ◽  
Author(s):  
Young Beom Kim ◽  
Young-Jae Park ◽  
Sangbok Kim ◽  
Eui-Nam Huh
Keyword(s):  
Mobile Networks ◽  
Optimization Problems ◽  
Route Optimization ◽  
Mobile Nodes

scholarly journals Design of Optimized Multimedia Data Streaming Management Using OMDSM over Mobile Networks

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Byungjoo Park ◽  
Ankyu Hwang ◽  
Haniph Latchman
Keyword(s):  
Mobile Networks ◽  
Mobility Management ◽  
Multimedia Data ◽  
Route Optimization ◽  
Mobile Marketing ◽  
The Internet ◽  
Data Streaming ◽  
Mobile Nodes ◽  
Tcp Performance ◽  
High Quality

Mobility management is an essential challenge for supporting reliable multimedia data streaming over wireless and mobile networks in the Internet of Things (IoT) for location-based mobile marketing applications. The communications among mobile nodes for IoT need to have a seamless handover for delivering high quality multimedia services. The Internet Engineering Task Force (IETF) mobility management schemes are the proposals for handling the routing of IPv6 packets to mobile nodes that have moved away from their home network. However, the standard mobility management scheme cannot prevent packet losses due to longer handover latency. In this article, a new enhanced data streaming route optimization scheme is introduced that uses an optimized Transmission Control Protocol (TCP) realignment algorithm in order to prevent the packet disordering problem whenever the nodes in the IoT environment are communicating with each other. With the proposed scheme, data packets sequence realignment can be prevented, the packet traffic speed can be controlled, and the TCP performance can be improved. The experimental results show that managing the packet order in proposed new scheme remarkably increases the overall TCP performance over mobile networks within the IoT environment thus ensuring the high quality of service (QoS) for multimedia data streaming in location-based mobile marketing applications.

scholarly journals A TOTP-Based Enhanced Route Optimization Procedure for Mobile IPv6 to Reduce Handover Delay and Signalling Overhead

2014 ◽  
Vol 2014 ◽  
pp. 1-16
Author(s):  
Peer Azmat Shah ◽  
Halabi B. Hasbullah ◽  
Ibrahim A. Lawal ◽  
Abubakar Aminu Mu’azu ◽  
Low Tang Jung
Keyword(s):  
Mobile Devices ◽  
Optimization Procedure ◽  
Mobile Node ◽  
Mobile Ipv6 ◽  
Route Optimization ◽  
Network Simulator ◽  
Mobile Nodes ◽  
Home Test ◽  
One Time Password ◽  
Signalling Overhead

Due to the proliferation of handheld mobile devices, multimedia applications like Voice over IP (VoIP), video conferencing, network music, and online gaming are gaining popularity in recent years. These applications are well known to be delay sensitive and resource demanding. The mobility of mobile devices, running these applications, across different networks causes delay and service disruption. Mobile IPv6 was proposed to provide mobility support to IPv6-based mobile nodes for continuous communication when they roam across different networks. However, the Route Optimization procedure in Mobile IPv6 involves the verification of mobile node’s reachability at the home address and at the care-of address (home test and care-of test) that results in higher handover delays and signalling overhead. This paper presents an enhanced procedure, time-based one-time password Route Optimization (TOTP-RO), for Mobile IPv6 Route Optimization that uses the concepts of shared secret Token, time based one-time password (TOTP) along with verification of the mobile node via direct communication and maintaining the status of correspondent node’s compatibility. The TOTP-RO was implemented in network simulator (NS-2) and an analytical analysis was also made. Analysis showed that TOTP-RO has lower handover delays, packet loss, and signalling overhead with an increased level of security as compared to the standard Mobile IPv6’s Return-Routability-based Route Optimization (RR-RO).

scholarly journals MASEMUL: A Simulation Tool for Movement-Aware MANET Scheduling Strategies for Multimedia Communications

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Moustafa M. Nasralla ◽  
Iván García-Magariño ◽  
Jaime Lloret
Keyword(s):  
Mobile Networks ◽  
Content Delivery ◽  
Multimedia Communications ◽  
Multimedia Traffic ◽  
Simulation Tool ◽  
Context Aware ◽  
Mobile Nodes ◽  
Multimedia Services ◽  
Agent Based ◽  
Common Strategy

The last decade has witnessed a steep growth in multimedia traffic due to real-time content delivery such as in online games and video conferencing. In some contexts, MANETs play a key role in the hyperconnectivity of everything in multimedia services. In this context, this work proposes a new scheduling approach based on context-aware mobile nodes for their connectivity. The contribution relies on reporting not only the locations of devices in the network but also their movement identified by sensors. In order to illustrate this approach, we have developed a novel agent-based simulator called MASEMUL for illustrating the proposed approach. The results show that a movement-aware scheduling strategy defined with the proposed approach has decreased the ratio of channel interruptions over another common strategy in mobile networks.

RANDOMIZED MOBILE AGENT BASED ROUTING IN WIRELESS NETWORKS

2001 ◽  
Vol 12 (03) ◽  
pp. 365-384 ◽  
Author(s):  
MARC BUI ◽  
SAJAL K. DAS ◽  
AJOY K. DATTA ◽  
DAI THO NGUYEN
Keyword(s):  
Mobile Agent ◽  
Mobile Networks ◽  
Mobile Agents ◽  
Shortest Paths ◽  
Mobile Nodes ◽  
Shortest Path Routing ◽  
Link State ◽  
Novel Approach ◽  
Link Cost ◽  
Routing Tables

We propose a novel approach for shortest path routing in wireless mobile networks. The approach makes use of n mobile agents initially launched from n mobile nodes forming the network. The agents move randomly from node to node and update routing information as they go. The approach is presented in this paper with two protocols. Both of them exhibit good performance in terms of the network and computing resource consumptions. The first protocol relies on independent mobile agents and imposes a minimum bandwidth requirement on individual mobile agents. Each agent carries the link state of its creator and this information remains unchanged except when the mobile agent returns to the home node. The second protocol is a refinement of the first protocol, with some form of interaction between the mobile agents. Each agent maintains the routing table of its creator instead of link state. The randomly walking agents spread the update information and compute the shortest paths via exchanging network state information between the routing tables they carry and the routing tables at the nodes they traverse. The correctness of the protocols is proven. Our analysis shows that the agent cooperation improves the system performance when dealing with topology and link cost changes.

Sign in / Sign up

Export Citation Format

Share Document