Mobile Network Environment Research Articles

Application Functions Placement Optimization in a Mobile Distributed Cloud Environment

Distributed Computing in 5G Mobile Networks is a potential requirement for certain applications that depends on low latency and information sharing through or with data information sources. Such applications may be observed as a distributed application. We present a tool and method to optimize the deployment of distributed applications, dividing it into Modules, in a 5G Mobile Network environment. To do so we apply an approximation algorithm for the Path Computation and Function Placement Problem described in [1]. We show that under certain circumstances it is beneficial to deploy parts of such applications in a Cloud Computing environment with Distributed Cloud resources at the Mobile Network Edge. We verify our findings with an example, an Augmented Reality application.

Hybrid Content Caching in 5G Wireless Networks: Cloud Versus Edge Caching

Most existing content caching designs require accurate estimation of content popularity, which can be challenging in the dynamic mobile network environment. Moreover, emerging hierarchical network architecture enables us to enhance the content caching performance by opportunistically exploiting both cloud-centric and edge-centric caching. In this paper, we propose a hybrid content caching design that does not require the knowledge of content popularity. Specifically, our design optimizes the content caching locations, which can be original content servers, central cloud units (CUs) and base stations (BSs) where the design objective is to support as high average requested content data rates as possible subject to the finite service latency. We fulfill this design by employing the Lyapunov optimization approach to tackle an NP-hard caching control problem with the tight coupling between CU caching and BS caching control decisions. Toward this end, we propose algorithms in three specific caching scenarios by exploiting the submodularity property of the sum-weight objective function and the hierarchical caching structure. Moreover, we prove the proposed algorithms can achieve finite content service delay for all arrival rates within the constant fraction of capacity region using Lyapunov optimization technique. Furthermore, we propose practical and heuristic CU/BS caching algorithms to address a general caching scenario by inheriting the design rationale of the aforementioned performance-guaranteed algorithms. Trace-driven simulation demonstrates that our proposed hybrid CU/BS caching algorithms outperform the general popularity based caching algorithm and the independent caching algorithm in terms of average end-to-end service latency and backhaul/fronthaul load reduction ratios.

TCACWCA: transmission and collusion aware clustering with enhanced weight clustering algorithm for mobile ad hoc networks

In case of MANET the routing acts a superior role in the mobile ad-hoc network environment so as to guarantee the consistent communication amongst the source and the destination nodes. On the other hand routing in the MANET environment will have a number of challenges because of dynamic behavior of mobile nodes exist in the environment. Mobility behavior of mobile nodes will bring about path link breakages that needs novel route for the data transmission to be kept up to date or set up frequently. This behavior causes network failure. It results in more computational overhead by forwarding hello message to come across the novel nodes gone into the environment. With the purpose of overwhelming these issues, the novel approach is presented, that is to say transmission and collusion aware clustering with enhanced weight clustering algorithm (TCAC–WCA) so as to decrease the risk of the forwarding hello packets at every time clustering. In this study, the improved weight clustering algorithm is utilized to form the cluster dependent upon the weight on the node.The Transmission Range Clustering Algorithm (TRCA)is utilized to eradicate the needless node that there are not presented inside the transmission range and likewise test out the link stability of the node. By means of computing the trust level, the collusion is noticed in the wireless link. The presented TCAC–WCA is tested dependent upon two metric called expected transmission count (ETX) or path encounter rate (PER) for every identified state with the aim of attaining the ideal routing performance for diverse network conditions (that is to say Static or mobile). Similarly the route node dictionary is built dependent upon the ETX and PER metric. The complete assessment of the presented research technique is accomplished in NS2 simulation environment through which it is shown that the presented research technique results in giving improved outcome compared to the previous research techniques.

Key Escrow with Certificateless Elliptic Curve Segmentation for Grouping of Shared Data in Mobile networks

In the recent years, Internet of Things (IoT) is a most emerging concept in Internet and Communication Technology (ICT) domain. Accessing of data over Internet through dynamic mobile network is the prime concern. Various business communities outsource their data in the cloud system to reduce the data secure management overhead. The data authentication and integrity are some of the basic security and trust requirements in the cloud distributed environment. Key Escrow with Certificateless Elliptic Curve Segmentation (KE-CECS) technique is a novel data security mechanism that provides data authentication for data transmission over IoT based Mobile Network environment. Certificateless ECC has evolved as a prime research area due to ability to solve the key escrow identity based problem in data management schemes. The development of Certificateless Signature ECC for light-weighted smart devices mounted in IoT based Mobile Networks has become one of the most focussed research works. This paper presents a new secret segmentation pairing based Certificateless Signature scheme without Map to Point hash function and pairing. The new KE-CECS is most secured against both Type-I and Type-II adversaries under the strong segmentation sharing ECC assumption respectively. Performance evaluation and comparison using simulation analysis prove that the proposed KE-CECS outperforms other certificateless schemes in the mobile networks environment.

Efficient spatial query processing for KNN queries using well organised net-grid partition indexing approach

In recent years, most of the applications use mobile devices with geographical positioning systems support for providing location-based services. However, the queries sent through the mobile devices to obtain such services consume more time for processing due to the size of the spatial data. In order to solve this problem, an efficient indexing method for providing effective query processing services in mobile computing environments is proposed. This indexing method increases the efficiency of the query retrieval in mobile network environments. Since, all the existing mobile-based network applications utilise the node to node access of spatial objects for processing the query, the mobile query retrieval part in spatial databases is becoming the greatest disadvantage by consuming more time to process the query. The experimental results carried out using the proposed net-grid-based partition index approach show that the proposed model provides fast retrieval with high accuracy in processing of spatial queries.

Achieving Robust Mobile Web Content Delivery Performance Based on Multiple Coordinated QUIC Connections

In order to minimize the downloading time of short-lived applications like Web browsing, Web application, and short video clips, the recently standardized HTTP/2 adopts stream multiplexing on one single TCP connection. However, aggregating all content objects within one single connection suffers from the head-of-line blocking issue. Quick UDP Internet connection (QUIC), by eliminating such an issue on the basis of UDP, is expected to further reduce the content downloading time. However, in mobile network environments, the single connection strategy still leads to a degraded and high-variant completion time due to the unexpected hindrance of congestion window growth caused by the common but uncertain fluctuations in round trip time and also random loss event at the air interface. To retain resilient congestion window against such network fluctuations, we propose an intelligent connection management scheme based on QUIC which not only employs adaptively multiple connections but also conducts a tailored state and congestion window synchronization between these parallel connections upon the detection of network fluctuation events. According to the performance evaluation results obtained from an LTE-A/Wi-Fi testing network, the proposed multiple QUIC scheme can effectively overcome the limitations of different congestion control algorithms (e.g., the loss-based new reno/CUBIC and the rate-based BBR), achieving substantial performance improvement in both median (up to 59.1%) and 95th completion time (up to 72.3%). The significance of this piece of work is to achieve highly robust short-lived content downloading performance against various uncertainties of network conditions as well as with different congestion control schemes.

Efficient spatial query processing for KNN queries using well organised net-grid partition indexing approach

In recent years, most of the applications use mobile devices with geographical positioning systems support for providing location-based services. However, the queries sent through the mobile devices to obtain such services consume more time for processing due to the size of the spatial data. In order to solve this problem, an efficient indexing method for providing effective query processing services in mobile computing environments is proposed. This indexing method increases the efficiency of the query retrieval in mobile network environments. Since, all the existing mobile-based network applications utilise the node to node access of spatial objects for processing the query, the mobile query retrieval part in spatial databases is becoming the greatest disadvantage by consuming more time to process the query. The experimental results carried out using the proposed net-grid-based partition index approach show that the proposed model provides fast retrieval with high accuracy in processing of spatial queries.

Multi path interference aware reliable route path establishment in mobile adhoc network environment

Mobile adhoc network is a mixture of various mobile sensor nodes that are dispersed in the environment. The key idea of this system uses MANET environments to publicize the truths by increasing the data transmission rate. This influences to changed security problems such as collision, conflict et cetera. These problems would decrease the scattering of the packet ratio. In the preceding research method Interference Avoidance using CoEfficient of Restitution Measure (IA-CERM) is accomplished. This would compute the “restitution” of a collision of a node that is accomplished due to discovering the incoming packets from above one node by opening up this calculation, mounting enhanced route could be accomplished by reducing the interference effect. On the other hand these techniques are short of from the interference all through the subsistence of various paths existence. This is solved in the presented research methodology by proposing the new research methodology called as Multi-Path Interference aware Route Path Establishment (MP-IRPE). In this stage, dynamic analysis route behavior is carried out to discover the route path breakage priory. The non-interfering numerous paths will be chosen parallel while the data’s broadcasting via the principal path to avoid the path breakage. Therefore the instantaneous re-routing could be carried out without delay; consequently the waiting time could be minimized significantly. In this work optimal routing is done with the consideration of multiple QoS parameters using pareto-optimal approach as like in our previous work QoS and interference aware routing in dynamic MANET. The QoS parameters considered are “bandwidth, power, delay, link stability and reliability”. The whole assessment of the research method is performed and executed in the NS2 simulation environment. So, it is shown that the proposed methodology give improved result compared to the existing techniques. While comparing with other familiar protocols, MP-IRPE gives fine qualities in relation to overhead latency, and packet losses. In addition, these outcomes end to be relatively self-sufficient from the degree of mobility.

A Context-Aware Architecture Supporting Service Availability in Mobile Cloud Computing

Mobile systems are gaining more and more importance, and new promising paradigms like Mobile Cloud Computing are emerging. Mobile Cloud Computing provides an infrastructure where data storage and processing could happen outside the mobile node. Specifically, there is a major interest in the use of the services obtained by taking advantage of the distributed resource pooling provided by nearby mobile nodes in a transparent way. This kind of systems is useful in application domains such as emergencies, education and tourism. However, these systems are commonly based on dynamic network topologies, in which disconnections and network partitions can occur frequently, and thus the availability of the services is usually compromised. Techniques and methods from Autonomic Computing can be applied to Mobile Cloud Computing to build dependable service models taking into account changes in the context. In this work, a context-aware software architecture is proposed to support the availability of the services deployed in mobile and dynamic network environments. The proposal is based on a service replication scheme together with a self-configuration approach for the activation/hibernation of the replicas of the service depending on relevant context information from the mobile system. To that end, an election algorithm has been designed and implemented.

A Novel Fast Reroute Signaling Cost for Multicast Proxy Mobility

A profound analysis of signaling cost for multicast network mobility management environment. The evaluation is a innovative integration of Multicast only Fast Reroute (MFR) and Context Transfer (CT). This integration is implemented to network mobility environment which is Proxy Mobile IPv6 (PMIPv6). The signaling cost terms is described based on handover process flow of the proposed implementation. This paper introduces and validates a novel enhanced signaling cost procedure for multicast PMIPv6. This procedure helps to improve network mobility performance as mobile multicast traffic usage rises. Through this implementation better signaling cost formula is brought forward. The integration helps to ease usage increment issues.

Collaborative Service Selection via Ensemble Learning in Mixed Mobile Network Environments

Mobile Service selection is an important but challenging problem in service and mobile computing. Quality of service (QoS) predication is a critical step in service selection in 5G network environments. The traditional methods, such as collaborative filtering (CF), suffer from a series of defects, such as failing to handle data sparsity. In mobile network environments, the abnormal QoS data are likely to result in inferior prediction accuracy. Unfortunately, these problems have not attracted enough attention, especially in a mixed mobile network environment with different network configurations, generations, or types. An ensemble learning method for predicting missing QoS in 5G network environments is proposed in this paper. There are two key principles: one is the newly proposed similarity computation method for identifying similar neighbors; the other is the extended ensemble learning model for discovering and filtering fake neighbors from the preliminary neighbors set. Moreover, three prediction models are also proposed, two individual models and one combination model. They are used for utilizing the user similar neighbors and servicing similar neighbors, respectively. Experimental results conducted in two real-world datasets show our approaches can produce superior prediction accuracy.

Exploring the Convergence of the Mobile Learning Mode in Network Environment and the Traditional Classroom Teaching Mode

The mobile network learning mode has been praised by many learners because of the convenience of using mobile phones. At the same time, it has posed great challenges to traditional teaching modes. To make full use of the mobile network learning mode and make up for the traditional classroom teaching mode, we investigated the convergence of these two modes. To this end, we analyzed the reasons for college students’ low network learning efficacy. Further, based on China’s current mobile network environment, national network policies, and the experience of constructing mobile network learning resources, we practiced mobile network learning in a course on Photoshop. The experiment showed that the mobile learning mode is feasible and that with the proper use of the mobile network environment, teachers can enrich teaching resources in class and raise students’ learning efficiency in classroom teaching. To achieve the desired effects of the mobile network learning mode, teachers should pay attention to three factors: the change of the teacher’s role in the teaching process, the acquisition of mobile network applications in the new learning mode, and the support of exterior service technologies. Applying this learning mode can provide valuable experience for the transformation of traditional teaching modes.

A Secure Anonymity Preserving Authentication Scheme for Roaming Service in Global Mobility Networks

In real-life applications, ensuring secure transmission of data over public network channels to prevent malicious eavesdropping of the data is an important issue. Several potential security risks arise while protecting data and providing access control over the data. Due to the broadcast nature of the wireless channels, wireless networks are often vulnerable to various possible known attacks. Therefore, designing a secure and efficient authentication scheme in the global mobility network (GLOMONET) environment becomes a challenging task to the researchers. In recent years, several user authentication schemes for roaming services in GLOMONET have been proposed. However, most of them are either vulnerable to various known attacks or they are inefficient. Most recently, Zhao et al. proposed an anonymous authentication scheme for roaming service in GLOMONET (Zhao et al. in Wireless Personal Communications 78:247–269, 2014) and they claimed that their scheme can withstand all possible known attacks. In this paper, Zhao et al.’s scheme is revisited, and it is shown that their scheme fails to provide strong user anonymity when the session-specific temporary information are revealed to an adversary. Further, their scheme does not protect replay attack, offline password guessing attack and privileged-insider attack. In addition, there is no provision for revocation and re-registration mechanism in their scheme and also there exists design flaw in their schemeu. Moreover, another recently proposed Memon et al.’s scheme (Memon et al. in Wireless Personal Communications 84:1487–1508, 2015) fails to protect the privileged-insider attack. Thus, there is a great need to provide security enhancement of their schemes in order to apply in practical applications. The proposed scheme withstands the security weaknesses found in Zhao et al.’s scheme and Memon et al.’s scheme. Through the rigorous formal and informal security analysis, it is shown that the proposed scheme has the ability to tolerate various known attacks. In addition, the proposed scheme is simulated using the most-widely accepted and used Automated Validation of Internet Security Protocols and Applications tool and the simulation results reveal that the proposed scheme is secure. The proposed scheme is also efficient in computation and communication as compared to Zhao et al.’s scheme and other related schemes.

On Optimal Infrastructure Sharing Strategies in Mobile Radio Networks

The rapid evolution of mobile radio network technologies poses severe technical and economical challenges to mobile network operators (MNOs); on the economical side, the continuous roll-out of technology updates is highly expensive, which may lead to the extreme, where offering advanced mobile services becomes no longer affordable for MNOs which thus, are not incentivized to innovate. Mobile infrastructure sharing among MNOs becomes then an important building block to lower the required per-MNO investment cost involved in the technology roll-out and management phases. We focus on a radio access network (RAN) sharing situation where multiple MNOs with a consolidated network infrastructure coexist in a given set of geographical areas; the MNOs have then to decide if it is profitable to upgrade their RAN technology by deploying additional small-cell base stations and whether to share the investment (and the deployed infrastructure) of the new small-cells with other operators. We address such strategic problems by giving a mathematical framework for the RAN infrastructure sharing problem which returns the “best” infrastructure sharing strategies for operators (coalitions and network configuration) when varying techno-economic parameters such as the achievable throughput in different sharing configurations and the pricing models for the service offered to the users. The proposed formulation is then leveraged to analyze the impact of the aforementioned parameters/input in a realistic mobile network environment based on LTE technology.

Time‐assisted authentication protocol

SummaryAuthentication is the first step toward establishing a service provider and customer association. In a mobile network environment, a lightweight and secure authentication protocol is one of the most significant factors to enhance the degree of service persistence. This work presents a secure and lightweight keying and authentication protocol suite termed time‐assisted authentication protocol (TAP). The TAP improves the security of protocols with the assistance of time‐based encryption keys and scales down the authentication complexity by issuing a reauthentication ticket. While moving across the network, a mobile customer node sends a reauthentication ticket to establish new sessions with service‐providing nodes. Consequently, this reduces the communication and computational complexity of the authentication process. In the keying protocol suite, a key distributor controls the key generation arguments and time factors, while other participants independently generate a keychain based on key generation arguments. We undertake a rigorous security analysis and prove the security strength of TAP using communicating sequential processes and rank function analysis.

An efficient continuous range query processing scheme in mobile P2P networks

With the development of mobile devices, interest in the mobile P2P-based services has increased. However, the existing schemes spend too much cost to process a continuous range query in mobile P2P network environments. In this paper, we propose a new efficient range query processing scheme in mobile P2P network environments. The proposed scheme consists of two phases. In the query distribution phase, it prunes the peers that are impossible to be included in the query result. In the monitoring phase, the proposed scheme updates the query result incrementally. It is shown through performance evaluation that the proposed scheme outperforms the existing scheme in terms of the number of messages.

Real threats using GTP protocol and countermeasures on a 4G mobile grid computing environment

The number of mobile service users has drastically increased due to the development of mobile communication technologies and commercialisation of high-performance smartphones. As a result, the environment for mobile communication networks has changed into one that allows different types of abnormal traffic to easily flow, so the security threats on the network that had been hidden before have started to emerge. In particular, a 4G network is exposed to multiple forms of attacks that can maliciously use a GPRS Tunneling Protocol (GTP), which is used in LTE communications. In this paper, we present the types of real threats on a 4G mobile grid computing environment that uses a GTP protocol and provides algorithms studied to protect the network from such threats. Also, we have F-score represents the overall accuracy of algorithms was found to be 98.7%.

Store-Carry-Cooperative Forward Routing with Information Epidemics Control for Data Delivery in Opportunistic Networks

Data delivery in opportunistic networks requires robustness and resiliency due to the mobility and probabilistic propagation channels caused by fading. Besides the 100% data delivery, delivery with minimum delay, overhead, buffer consumption, and controlling unnecessary transmissions/replications are equally important. In this paper, we propose a data delivery solution for opportunistic networks. The solution comprises two main algorithms: store-carry-cooperative forward routing and information epidemic control. In the data forwarding, nodes proactively monitor and exploit the direct/two-hop cooperative forwarding opportunities and adaptively switch between the cooperative forwarding and reactive store-carry-forward routing. An information epidemics control algorithm, which provides earlier control signal distribution time and faster recovery rate, is also proposed. The susceptible-infected-recovered model is used to study the effectiveness of the proposed mechanism. Extensive network performance evaluation is conducted under a wide range of scenarios, which include fading environments, obstacle-constrained environments, and mobile social network environments. We show that: 1) the information epidemics control mechanism provides higher vaccination rate and recovery rate; 2) proactive replication incurs a number of unnecessary transmissions; 3) monitoring the vicinity and exploiting the opportunity shorten the data delivery delay; and 4) with the integrated solution, a robust data delivery is achieved and a substantial amount of unnecessary transmissions are well deterred.

Design and Implementation of a Multihoming-Based Scheme to Support Mobility Management in NEMO

With the worldwide deployment of different wireless access technologies and expanding requests for worldwide Internet accessibility, Network Mobility (NEMO) is turning out to be all the more requesting innovation. Therefore, NEMO Basic Support Protocol (NEMO BSP) has been anticipated by the NEMO Working Group for the continual worldwide connectivity of each node within the mobile network. Yet, NEMO BSP experiences from higher handoff delay and packet loss. Thus, fails to provide seamless handoff. This issue can be resolved by introducing multihoming concept in NEMO. The reason is to support concurrent use of multiple interfaces on a single Mobile Router. Therefore, the main objective of this paper is to propose an innovative Multihoming-based scheme to support Mobility management in Proxy NEMO (MM-PNEMO) environment. In addition, the performance is assessed utilizing simulation approach to certifying the applicability as well as the efficacy of the suggested scheme. The performance metrics used for evaluation are namely handoff delay, packet loss, packet delivery ratio, as well as throughput. The simulation is done using NS-3 network simulator. The simulation outcomes demonstrate that the proposed MM-PNEMO scheme outperforms the standard NEMO BSP and PNEMO in terms of packet loss (less than 1%) and handoff delay (average improvement by 76%).

Exploring Neglected Aspects of Innovation Function: Public Motivation and Non-pecuniary Values

The traditional innovation function, focusing on extrinsic motivations such as economic benefits and returns, has neglected the side of intrinsic values and public motivations for innovation function. Recent innovation examples in an era of mobile network and web-based information environment pursue open connected innovations such as open source movement and crowding source. Such open, collective and social innovations result from strong public motivation and trust network. Although previous studies argue the potential effects of intrinsic values on innovative attitude, research has not yet provided a comprehensive empirical evidence on how innovative attitude is associated with intrinsic and public motivations. Little empirical research remains for the impact of public motivations and intrinsic values on innovative attitudes. This study, relying on nationally represented survey (n = 3,188) in South Korea, explores an empirical link between public motivations and innovative attitudes to explore and allow new ideas. We found that public interest, empathy, altruism and job involvement facilitate innovative attitude to pursue and accept new ideas and suggestions. This implies that both intrinsic values (job enjoyment and satisfaction) and public motivations (public interests, empathy and altruism) are crucial factors to promote innovative attitudes. We also found strong non-linear relationships between satisfaction, trust and innovative attitude. We discuss implications for future innovation function of intrinsic and public motivations in terms of the process of social construction.