Mobile Node Roams Research Articles

Mobile agent‐based service migration in mobile edge computing

SummaryIn order to improve the efficiency of service migration in mobile edge computing (MEC), and obtain higher quality of service and better user experience, we take mobile agent technology, instead of container, as the application component hosting technology. The advantages of mobile agent include small size, high flexibility, autonomy, and suitability for heterogeneous environments. For 5G communications, how to offer cross‐platform support and deal with frequent roaming of mobile nodes is our main concern. Therefore, this paper provides a service migration framework using mobile agent in MEC environment and performance evaluation. Experiments with tasks of different complexity show that in terms of efficiency of service migration, mobile agent technology obviously outperforms container technology. The main contributions of this paper include the following: (1) we solve the problem that too many auxiliary modules were used in the container architecture, (2) we use the agent container and the resource manager (RM) for performance evaluations to investigate the differences between mobile agent and container technology, and (3) we use the decision tree to confirm the execution cost of each node so as to analyze why the mobile agent responds to migration commands slowly.

Secure and efficient hand-over authentication in WLAN using elliptic curve RSA

Roaming of mobile nodes among multiple access points should be secure and efficient. Hand-over occurs when a mobile node migrates from one access point to another and establishes a new connection by terminating the previous one. However, designing an appropriate hand-over authentication protocol is a complex task because the processing efficiency and power of mobile node is restricted to a certain extent. The lesser security level and higher computation complexity are the main issues of the existing hand-off authentication protocols. To overcome these problems, Elliptic Curve RSA is proposed with modification in the initialization and authentication phases of the hand-off authentication protocol. The result of the proposed work shows the improvement in higher security level along with lesser computational cost. Further, the proposed algorithm is performing well against the various possible attacks.

An efficient network selection algorithms in next-generation heterogeneous wireless networks

In the next-generation heterogeneous wireless networks, it is obligatory to consider the integration of various networks for providing the seamless connectivity to the mobile node roaming. While providing the seamless connectivity, a suitable network to choose from the given set of networks is the crucial issue. During vertical handoff, it is required to select the best network not only according to user preference but also the application, network and terminal contexts. The network selection algorithm plays a very important role in ensuring quality of service and seamless connectivity in such networks. Network selection in heterogeneous wireless networks has been widely studied by using various mathematical models, in which multiple attribute decision-making is one of the most popular models. This paper surveys the different network selection techniques available in the literature and explains a method for network selection which takes into consideration of multiple decision-making criteria for selecting the optimal network.

An efficient network selection algorithms in next-generation heterogeneous wireless networks

In the next-generation heterogeneous wireless networks, it is obligatory to consider the integration of various networks for providing the seamless connectivity to the mobile node roaming. While providing the seamless connectivity, a suitable network to choose from the given set of networks is the crucial issue. During vertical handoff, it is required to select the best network not only according to user preference but also the application, network and terminal contexts. The network selection algorithm plays a very important role in ensuring quality of service and seamless connectivity in such networks. Network selection in heterogeneous wireless networks has been widely studied by using various mathematical models, in which multiple attribute decision-making is one of the most popular models. This paper surveys the different network selection techniques available in the literature and explains a method for network selection which takes into consideration of multiple decision-making criteria for selecting the optimal network.

Security and Privacy Criteria to Evaluate Authentication Mechanisms in Proxy Mobile IPv6

Mobility management protocols support mobility for roaming mobile nodes in order to provide seamless connectivity. Proxy Mobile IPv6 is a network-based localized mobility management protocol that is more suitable for resource constrained devices among different mobility management schemes. In this protocol, all mobility signaling procedures are completed by network entity not mobile node. According to the Proxy Mobile IPv6 architecture, an authentication procedure has a key role to protect the network against different security threats; however, the details of authentication procedure is not specified in this standard. In this paper, different security features are explored to evaluate the authentication protocols in Proxy Mobile IPv6. The existing authentication approaches can be analyzed based on these criteria to find security issues.

An Optimized Mechanism for Adaptive and Dynamic Policy Based Handover in Clustered Manet

On-going revolution in ever-improving wireless communication enforces the necessity of a self configuring, rapidly deployable and infrastructure less network. MANET is such an autonomous wireless network that meets the requirements. At the same time MANET’s random behavior and absence of any central intelligence to gather unambiguous knowledge about user contexts complexes QoS maintenance and hampers proper utilization of network resources resulting into unnecessary handovers. In past, few policy driven handover approaches have been proposed for MANET but none of them explores a comprehensive policy design. Therefore in this paper we propose an adaptive and optimized policy based handover mechanism which is based on explicitly designed policies like load balancing, service discovery and next hop selection .Efficient procedures for these policies are also explored .This work predicts the high time of handover need on the basis of application specific needs of individual freely roaming mobile nodes, avoiding unnecessary handovers and provides efficient handover procedure with optimized resource consumption, reduced latency and interruption time.

物联网中移动Sensor 节点漫游的组合安全认证协议

Internet of Things is composed by sensor subnets and transmission backbone network. Because of the limited capacity of nodes in sensor subnets, the mobile sensor nodes often move from one cluster to another so that they can access and obtain cross-region information. The backbone transmission network depends on the existing Internet infrastructure and provides powerful services. In this case, the roaming of mobile nodes brings about some new security problems. On one hand, we should ensure that the mobile node joins the new foreign cluster efficiently and securely during roaming, which looks like roaming demand in MANET. However it should be much more light weight because sensor nodes’ resource is extremely limited. On the other hand, the security of mobile nodes is light weight which is different from that of backbone networks. The security level of backbone network should not be reduced by a mobile node roaming and joining a new cluster. So the authentication protocol should be composable security, when the light weight secure protocol connects with traditional backbone network protocol. In this paper, we focus on the sensor nodes roaming problem based on the Internet of Things, and propose a new random roaming authentication protocol (RMRAP). Our RMRAP takes into account both the security and feasibility of practical application. The protocol achieves the light weight authentication and protects the privacy of the mobile node while roaming among the clusters and generates forward security session key. We also test the composable security at cluster head which connects the backbone network and the sensor subnet serving as a gateway. We also analyze the performance of RMRAP protocol in both the theoretical analysis and experiment simulations, and compare it with some related work. The comparison shows that our RMRAP has some advantages of compose security, computation and communication overheads over these related protocols.

An Empirical Examination of Routing Protocols in Mobile Ad Hoc Networks

A Mobile Ad hoc NETwork (MANET) is a self-organizing, temporary, infrastructure-free, multi-hop, dynamic topology wireless network that contains collection of cooperative autonomous freely roaming mobile nodes. The nodes communicate with each other by wireless radio links with no human intervention. Each mobile node functions as a specialized router to forward information to other mobile nodes. In order to provide efficient end-to-end communication with the network of nodes, a routing protocol is used to discover the optimal routes between the nodes. The routing protocols meant for wired networks can not be used for mobile ad hoc networks because of the mobility of nodes. Routing in ad hoc networks is nontrivial due to highly dynamic nature of the nodes. Various routing protocols have been proposed and widely evaluated for efficient routing of packets. This research paper presents an overview on classification of wide range of routing protocols for mobile ad hoc wireless networks proposed in the literature and shows the performance evaluation of the routing protocols: DSDV, AODV, FSR, LAR, OLSR, STAR and ZRP using the network simulator QualNet 4.0 to determine which protocols may perform best in large networks. To judge the merit of a routing protocol, one needs performance metrics (throughput, end-to-end delay, jitter, packet delivery ratio, routing overhead) with which to measure its suitability and performance. Our simulation experiments show that the LAR protocol achieve relatively good performance compared to other routing protocols.

Managing Handover Authentication in Big-domain Wireless Environment

Mobility management is the key feature of wireless network. When the mobile node roams from the home network to the foreign network, the foreign network access server usually does not have the security material of the mobile node, and can not authenticate the mobile node by itself. Thus the three-party authentication is used, and the foreign network access server consults the home authentication server of the mobile node for authentication (usually through the foreign authentication server). However, this sort of authentication will lead to a long latency. With the wide deployment of latency sensitive services in wireless network, the handover authentication latency becomes more and more flagrant. Currently, many standards organizations are working on this issue, and they defined a lot of protocols for optimizing the handover authentication procedure. These protocols mainly include the fast re-authentication protocol, the pre-authentication protocol and the context transfer based authentication protocol. However, current protocols will put a heavy burden on the authentication server in big domain, and thus add a long latency to the handover authentication procedure. This paper presents an elliptic curve based authenticated key agreement protocol with mutual authentication property to address this problem.

Macromobility support for mobile ad hoc networks using IPv6 and the OLSR routing protocol

Mobile ad hoc networks (MANETs) make use of a distributed routing mechanism to support connectivity between nodes within the ad hoc network. A wireless ad hoc network can be deployed for multiple applications, for example, it can be used to extend the coverage of wire-based networks through the use of a wireless access router. However, the implementation of a hybrid (i.e. wired and wireless) network is not a straight forward process and several issues must be solved for this type of topologies to become a reality. One concern is related to terminal mobility while preserving ongoing communication sessions; as a mobile node moves from one subnetwork to a new subnetwork a mobility protocol must be introduce to allow the mobile node to preserve communication sessions without having to reestablish the session with a correspondent node; this issue becomes more complex in a hybrid network where the wireless domain is composed by a mobile ad hoc network (MANET). For instance, MANET routing protocols usually do not account for the connectivity toward a wired network, such as the Internet. As a result there are multiple routing issues that must be taken into consideration for the support of interconnectivity between nodes located in a hybrid network. In this work we assume that a hybrid network has been deployed and the optimized link state routing (OLSR) protocol is implemented in the ad hoc network; in addition, we consider the implementation of a macromobility mechanism under IPv6. The support of macromobility is achieved via Mobile IPv6, while OLSR provides the routing capabilities within the MANET. The main contribution of this work is the proposal of diverse strategies to improve the layer 3 handoff latency, as a mobile node roams between foreign networks.

An Analytical Framework for Performance Evaluation of IPv6-Based mobility Management Protocols

Mobility management with provision of seamless handover is crucial for an efficient support of global roaming of mobile nodes (MNs) in next-generation wireless networks (NGWN). Mobile IPv6 (MIPv6) and its extensions were proposed by IETF for IP layer mobility management. However, performance of IPv6-based mobility management schemes is highly dependent on traffic characteristics and user mobility models. Consequently, it is important to assess this performance in-depth through those two factors. The performance of IPv6-based mobility management schemes is usually evaluated through simulations. This paper proposes an analytical framework to evaluate the performance of IPv6-based mobility management protocols. This proposal does not aim to advocate which is better but rather to study the effects of various network parameters on the performance of these protocols to enlighten decision-making. The effect of system parameters, such as subnet residence time, packet arrival rate and wireless link delay, is investigated for performance evaluation with respect to various metrics like signaling overhead cost, handoff latency and packet loss. Numerical results show that there is a trade-off between performance metrics and network parameters.

Analysis and algorithms design for the partition of large-scale adaptive mobile wireless networks

In a large-scale adaptive mobile wireless network, mobile units can communicate via either ad hoc or server-based communications. Ad hoc communication allows mobile units in close proximity to exchange messages directly. Server-based communication allows long distance contact between mobile units but must be supported by mobile servers. This paper investigates the partitioning problem as it applies to the assignment of mobile nodes, which contain mobile units in close proximity, to mobile servers under constraints of wireless transmission range and available bandwidth. This problem is even more difficult when the topologies of the mobile node connection graph and the mobile server network graph are dynamically changing. Given appropriate definitions for valid partitions in our framework, this paper shows the associated decision-based partition problems are NP-complete. In this paper, we propose assigning mobile nodes to mobile servers using efficient heuristic algorithms such that communication requirements among mobile nodes are successfully met by mobile servers. The simulation environment simulates a dynamically modified network topology of a wireless network consisting of roaming mobile nodes. The results show that proposed heuristic algorithms can yield effective assignments with a performance similar to that produced by exhaustive approaches.

A Hierarchical Key Management Scheme for Authentication of Roaming Mobile Nodes between Domains in Mobile Networks

This letter proposes a hierarchical key management scheme based on hash key chain for authentication of roaming mobile nodes in both intra-domain and inter-domain. The key management scheme uses a local master key concept for reducing the latency of the authentication procedure and the communication overhead between a home authentication server and an access point in the foreign domain. The proposed scheme also supports secure separation of the authentication key among local authentication servers using hash kev chain.

Smart Handoff Scheme for Supporting Roaming between WLAN and GPRS Networks

Recent advancement in personal communication services (PCS) provides wireless multimedia services for users on the move. For establishing the convenient access environment, the evolution of IP-based integrated scheme becomes very urgent for public wireless access systems. In this paper, we clarify the well-known issues of integrating the general packet radio service (GPRS) network and IEEE 802.11 wireless local area network (WLAN). These issues include the inconsistence in transmission rate and coverage area, the difficulty in seamless handoff, the complexities of mobile IP and address translations, and so on. Based on classified cases, we propose the circular probe strategy (CPS) to solve the IP translations and measure the precise handoff latency of a mobile node roaming from one network to another. This latency information helps a mobile node and its home agent (HA) to decide the appropriate handoff timing, to maximize the data transmission rate, and to perform seamless handoff in the heterogeneous system. We also proposed the smart access point (AP) mechanism to reduce the overhead of CPS and to provide precise handoff latency information for mobile nodes (MNs) to select the most appropriate AP for association. Experiment results demonstrate that the proposed smart handoff scheme performs better than traditional algorithms in terms of handoff time in the integrated network.