Search results

Notes that cellular is the inevitable future architecture for the personal communication service system (PCS). This is important for wireless mobile communications and will eventually be integrated with the Internet. Recent initiatives to add mobility to the Internet and packet data services for the next generation cellular systems are being considered by many mobile service providers, and providing a seamless support for IP‐based packet switched services is an important issue. Mobile Internet Protocol version 6 (Ipv6) is a new version of the Internet Protocol that was standardized by the Internet Engineering Task Force (IETF). It supports mobility and is presently being standardized by the IETF Mobile IP Working Group. Discusses the current cellular support based on Ipv6 and points out the shortfalls of using Mobile IP. Highlights protocols especially for mobile management schemes which can optimize a high speed mobile station moving among small wireless cells.

Mobility management for single‐hop cellular networks has received much research attention in the last few years. One of the research challenges for 4G wireless systems is the design of mobility management techniques that integrate cellular and ad‐hoc networks. Currently, there are no structured mobility management schemes for these heterogeneous multi‐hop networks. This paper aims to address these issues.

This paper describes techniques for tracking a mobile node (MN) in an integrated architecture with minimum overhead. This paper proposes group rerouting concept.

The paper implements and evaluates the proposed protocol by using the network simulator (NS‐2). The proposed protocol increases performance compared to broadcasting schemes.

This scheme considers devices with two interfaces only.

The paper proposes a scheme to extend the coverage of cellular base stations by using ad‐hoc devices.

This paper describes techniques for tracking an MN in an integrated architecture with minimum overhead. This scheme is independent of the routing protocol used in a multi‐hop network.

This paper aims to provide an acceptable level of security while taking into account limited capabilities of the sensors. This paper proposes a mobile approach to securing data exchanged by structured nodes in a cluster.

The approach is based on mobile nodes with significant calculation and energy resources that allow cryptographic key management and periodic rekeying. However, mobility in wireless sensor networks aims to increase the security and lifetime of the entire network. The technical methods used in this paper are based on cryptography elliptic curves and key management through a balanced binary tree.

To maintain the effectiveness of critical applications based on wireless sensor networks, a good level of nodes security must be ensured, taking into account their limited energy and computing. Collaboration between powerful mobile nodes provides better coverage and a good key management. Owing to the significant capabilities of the mobile nodes, they can be used to secure critical applications at the same time if needed in applications requiring difficult operations.

To compare the performance of the proposed approach with other mobile algorithms, the following metrics are focused on: the energy consumed by normal sensors and cluster heads, the number of packets exchanged during key installation, time to generate and distribute cryptographic keys and the memory used by the different sensors to store keys.

Coexistence of various wireless access networks and the ability of mobile terminals to switch between them make an optimal selection of serving networks for multicast groups a challenging problem. Since optimal network selection requires large dimensions of data to be collected from several network locations and sent between several network components, the scalability can easily become a bottleneck in large-scale systems. Therefore, reducing data exchange within heterogeneous wireless networks is important. The paper aims to discuss these issues.

The authors study the decision-making process and the data that need to be sent between different network components. To analyze the operation of the wireless heterogeneous network, the authors built a mathematical model of the network. The objective is defined as a minimization of multicast streams in the system. To evaluate the heuristic solutions, the authors define the upper and lower bounds to their operation.

The proposed heuristic solutions substantially reduce the usage of bandwidth in mobile networks and exchange of information between the network components.

The authors proposed the approach that allows network selection in a decentralized manner with only limited information shared among the decision makers. The authors studied how different sets of information available to decision makers influenced the performance of the system. The work also investigates the usage of multiple paths for multicast in heterogeneous mobile environments.

The purpose of this paper is to describe the required functionalities on providing internet connectivity and mobility management for mobile ad hoc networks (MANETs), present discovered problems such as inconsistent contexts, and provide the corresponding solutions. It also provides a hybrid metric for the load‐balance of intra/inter‐MANET traffic over multiple internet gateways (IGWs).

The paper uses both mathematical analyses and simulations to discover the required functionalities and problems on providing internet connectivity and mobility management for MANETs. The proposed hybrid metric for IGW selection is a replacement of the shortest hop‐count (HC) metric, and consider three factors: HC distance, intra‐MANET traffic, and inter‐MANET traffic.

Simulation results show that ad hoc routing protocols, using the proposed metric, get better performance in terms of packet delivery ratio and transmission delay, at the cost of slightly increased signalling overhead.

In the assessment, simulation results are taken from two mobility scenarios, and the hybrid metric is integrated into only reactive ad hoc routing. Thus, more case studies need to be carried out to demonstrate the outcomes of the proposed metric compared with others.

This paper provides the needed functionalities for broadening the richness of MANET applications to internet users, and vice verse.

This paper contributes to the research on internetworking and mobility management between MANETs and the internet.

This paper investigates query processing in MANETs. Cache techniques and multi‐join database operations are studied. For data caching, a group‐caching strategy is proposed. Using the cache and the index of the cached data, queries can be processed at a single node or within the group containing this single node. For multi‐join, a cost evaluation model and a query plan generation algorithm are presented. Query cost is evaluated based on the parameters including the size of the transmitted data, the transmission distance and the query cost at each single node. According to the evaluations, the nodes on which the query should be executed and the join order are determined. Theoretical analysis and experiment results show that the proposed group‐caching based query processing and the cost based join strategy are efficient in MANETs. It is suitable for the mobility, the disconnection and the multi‐hop features of MANETs. The communication cost between nodes is reduced and the efficiency of the query is improved greatly.

Vertical handoff mechanism (VHO) becomes very popular because of the improvements in the mobility models. These developments are less to certain circumstances and thus do not provide support in generic mobility, but the vertical handover management providing in the heterogeneous wireless networks (HWNs) is crucial and challenging. Hence, this paper introduces the vertical handoff management approach based on an effective network selection scheme.

This paper aims to improve the working principle of previous methods and make VHO more efficient and reliable for the HWN.Initially, the handover triggering techniques is modelled for identifying an appropriate place to initiate handover based on the computed coverage area of cellular base station or wireless local area network (WLAN) access point. Then, inappropriate networks are eliminated for determining the better network to perform handover. Accordingly, a network selection approach is introduced on the basis ofthe Fractional-dolphin echolocation-based support vector neural network (Fractional-DE-based SVNN). The Fractional-DE is designed by integrating Fractional calculus (FC) in Dolphin echolocation (DE), and thereby, modifying the update rule of the DE algorithm based on the location of the solutions in past iterations. The proposed Fractional-DE algorithm is used to train Support vector neural network (SVNN) for selecting the best weights. Several parameters, like Bit error rate (BER), End to end delay (EED), jitter, packet loss, and energy consumption are considered for choosing the best network.

The performance of the proposed VHO mechanism based on Fractional-DE is evaluated based on delay, energy consumption, staytime, and throughput. The proposed Fractional-DE method achieves the minimal delay of 0.0100 sec, the minimal energy consumption of 0.348, maximal staytime of 4.373 sec, and the maximal throughput of 109.20 kbps.

In this paper, a network selection approach is introduced on the basis of the Fractional-Dolphin Echolocation-based Support vector neural network (Fractional-DE-based SVNN). The Fractional-DE is designed by integrating Fractional calculus (FC) in Dolphin echolocation (DE), and thereby, modifying the update rule of the DE algorithm based on the location of the solutions in past iterations. The proposed Fractional-DE algorithm is used to train SVNN for selecting the best weights. Several parameters, like Bit error rate (BER), End to end delay (EED), jitter, packet loss, and energy consumption are considered for choosing the best network.The performance of the proposed VHO mechanism based on Fractional-DE is evaluated based on delay, energy consumption, staytime, and throughput, in which the proposed method offers the best performance.

Vertical handover has been grown rapidly due to the mobility model improvements. These improvements are limited to certain circumstances and do not provide the support in the generic mobility, but offering vertical handover management in HetNets is very crucial and challenging. Therefore, this paper presents a vertical handoff management method using the effective network identification method.

This paper presents a vertical handoff management method using the effective network identification method. The handover triggering schemes are initially modeled to find the suitable position for starting handover using computed coverage area of the WLAN access point or cellular base station. Consequently, inappropriate networks are removed to determine the optimal network for performing the handover process. Accordingly, the network identification approach is introduced based on an adaptive particle-based Sailfish optimizer (APBSO). The APBSO is newly designed by incorporating self-adaptive particle swarm optimization (APSO) in Sailfish optimizer (SFO) and hence, modifying the update rule of the APBSO algorithm based on the location of the solutions in the past iterations. Also, the proposed APBSO is utilized for training deep-stacked autoencoder to choose the optimal weights. Several parameters, like end to end (E2E) delay, jitter, signal-to-interference-plus-noise ratio (SINR), packet loss, handover probability (HOP) are considered to find the best network.

The developed APBSO-based deep stacked autoencoder outperformed than other methods with a minimal delay of 11.37 ms, minimal HOP of 0.312, maximal stay time of 7.793 s and maximal throughput of 12.726 Mbps, respectively.

The network identification approach is introduced based on an APBSO. The APBSO is newly designed by incorporating self-APSO in SFO and hence, modifying the update rule of the APBSO algorithm based on the location of the solutions in the past iterations. Also, the proposed APBSO is used for training deep-stacked autoencoder to choose the optimal weights. Several parameters, like E2E delay, jitter, SINR, packet loss and HOP are considered to find the best network. The developed APBSO-based deep stacked autoencoder outperformed than other methods with minimal delay minimal HOP, maximal stay time and maximal throughput.

This paper aims to discuss network transparency in a mountain rescue domain and aims to introduce the relatively new research concept of MANEMO (MANET + NEMO) and the mountain rescue IP network model developed at Lancaster University.

An analysis of IP mobility techniques that have been designed for use in the Internet today is provided as background, as well as an overview of the whole MANEMO domain. Highlights the importance of the MANEMO concept by working with real scenarios and developing practical implementations (as opposed to simulation).

During the research it was found that combining the localised multi‐hop behaviour of MANET techniques and the global reachability of NEMO can be a mutually beneficial process. The benefits afforded by using MANET techniques can bring advantages to NEMO scenarios and vice‐versa. Identifying this fact has given rise to the development of two distinct MANEMO scenarios, MANET‐Centric and NEMO‐Centric MANEMO. Finally, the Unified MANEMO Architecture (UMA) implementation, which attempts to support both of these scenarios in an efficient and feasible manner.

Regarding UMA, research continues into addressing the security implications of this approach and the benefits that multi‐homing can provide.

The paper illustrates how MANEMO can conceivably provide powerful solutions to many important scenarios.

Several new network types have emerged over the last couple of years. Many of these networks are being connected together to provide mobile users with the capability of staying always connected to the Internet which requires seamless transitions from one network to another without causing interruption to on‐going connections. To maintain connectivity during handoff, all the networks that are accessible to the mobile station need to be known. The paper aims to propose a novel energy‐efficient network discovery approach that enables fast discovery and selection of available access networks.

The performance of the proposed approach over an actual network testbed consisting of heterogeneous networks (such as wireless local area, cellular) is evaluated.

It was found that the approach yields between 12.4 and 19.1 per cent improvement in battery power consumption over other network discovery approaches.

The paper proposes and implements a novel scheme to discover wireless networks in a multi‐access environment consisting of heterogeneous networking technologies.