Traditional resource allocation methods rely on the physical properties of network nodes and links, neglecting semantic information such as task requirements and network behavior. To address this, we propose a knowledge-aided resource allocation strategy (KARAS) for satellite networks. Nodes, links, tasks, and their relations are represented as low-dimensional vectors using the knowledge graph embedding (KGE) model. Based on these vectors and task requirements, we construct an objective function combining task execution cost, resource allocation cost, and knowledge-aided cost. Task routing and resource allocation are modeled as a combinatorial optimization problem with constraints on path continuity, resources, and delay to find the optimal execution path. Experimental results show that KARAS maintains a request success rate of over 88% with superior performance in average cost, path latency, and other metrics compared to the KG-SDNRL algorithm.

Aerial-aided Edge Computing (AEC) promises to provide low-latency computing services as a critical component for future low-altitude intelligent transportation systems. However, the complex edge network environment poses security challenges, as traditional Intrusion Detection Systems (IDS) struggle to handle AEC’s large traffic volume and resource constraints. To address this, we propose a collaborative detection mechanism called Switch IDS. First, Switch IDS adopts a packet-level detection solution to meet real-time detection requirements. Next, Switch IDS is designed for resource-constrained nodes. By introducing the Mixture of Experts (MoE) structure into the traditional Deep Learning (DL) model, it enables seamless and scalable multi-node deployment. Switch IDS establishes a resource status-based capability for each Expert and incorporates steering loss in the loss function to enable autonomous near-optimal traffic steering, ultimately maximizing system processing capacity. Finally, the Switch IDS utilizes parallelized Service Function Chaining (SFC) for practical multi-node deployment. To the best of our knowledge, this is the first realization of multi-node deployment and autonomous traffic steering for DL-based IDS. Experiments on public datasets show that Switch IDS and its multi-node deployment scheme notably boost processing capacity while maintaining high detection performance.

Abstract It is well known that the Sixth Generation (6G) communication system integrating multiple access networks promotes the internet of everything world-widely. However, due to the differentiated underlying network protocols, it is difficult to find a general authentication solution to support various authentication methods in different access networks. Blockchain is a new technology that supports network heterogeneity, which provides a potential solution for differentiated authentication. In this paper, we propose a blockchain-based differentiated authentication mechanism for 6G Heterogeneous Networks (HetNets), which can efficiently authenticate user identities through scheduling different authentication methods. Particularly, we analyze the authentication architecture of 6G HetNets and put forward a blockchain-based differentiated authentication framework. Besides, to improve the scalability of user authentication, it is the first time to use various blockchain authentication contracts to represent different authentication methods. Meanwhile, a differentiated authentication management contract is proposed to uniformly manage different authentication contracts to realize differentiated identity authentication. Based on the evaluation of the prototype system, the proposed mechanism can dynamically provide differentiated authentication services (e.g. EAP-MD5, 5G-AKA) with low additional time (milliseconds levels) cost.

Edge caching has been regarded as a promising technique for low-latency, high-rate data delivery in future networks, and there is an increasing interest to leverage Machine Learning (ML) for better content placement instead of traditional optimization-based methods due to its self-adaptive ability under complex environments. Despite many efforts on ML-based cooperative caching, there are still several key issues that need to be addressed, especially to reduce computation complexity and communication costs under the optimization of cache efficiency. To this end, in this paper, we propose an efficient cooperative caching (FDDL) framework to address the issues in mobile edge networks. Particularly, we propose a DRL-CA algorithm for cache admission, which extracts a boarder set of attributes from massive requests to improve the cache efficiency. Then, we present an lightweight eviction algorithm for fine-grained replacements of unpopular contents. Moreover, we present a Federated Learning-based parameter sharing mechanism to reduce the signaling overheads in collaborations. We implement an emulation system and evaluate the caching performance of the proposed FDDL. Emulation results show that the proposed FDDL can achieve a higher cache hit ratio and traffic offloading rate than several conventional caching policies and DRL-based caching algorithms, and effectively reduce communication costs and training time.

The rapid development of the Internet of Things (IoT) has dramatically increased the number of distributed IoT devices and users. Trust and Reputation Model (TRM) is a well-known technique for improving the security of IoT, which detects malicious attacks by evaluating user behavior. Since traditional distributed TRMs lack secure and reliable data sharing mechanisms, some works have integrated the TRMs into the trusted blockchains. Nevertheless, they have not realized the security requirements of the comprehensive assessment of user behavior and dynamic evaluation of reputation. Therefore, this paper introduces a Blockchain-based Trust and Reputation Model (BTRM), which evaluates user reputation from many aspects and can resist multiple malicious attacks in the distributed network. Second, we propose a novel Dynamic Evaluation Mechanism (DEM), which reduces the number of reputation evaluations without degrading network security and builds a trusting foundation between long-term inactive users and the network. Eventually, we deploy the proposed model DEM-BTRM in a prototype system of Hyperledger Fabric and compare it with existing reputation evaluation methods. The results show that the DEM-BTRM can comprehensively evaluate user behavior and dynamically detect malicious attacks.

Since Internet of Things (IoT) communications can enjoy many advantages brought by content-centric networking (CCN) in nature, there is an increasing interest on their integration for better information retrieval and distribution. Nevertheless, different from the conventional multimedia traffic of which contents are hardly changed, IoT data are always transient and updated by their producers according to the actual situation. As a result, if without any effective countermeasures, outdated copies are inevitably stored by CCN routers and then distributed to the associated consumers, degrading both caching efficiency and user experience. In fact, most of related policies take little account of information freshness for cached contents, and how to tackle transient IoT data in CCN is still an ignored but crucial issue required for further explorations. Therefore, in this article, we propose an efficient popularity-based cache consistency management scheme, which aims to guarantee freshness of IoT data returned by on-path routers and avoid heavy signalling costs introduced at the same time. Extensive simulations were performed under both real-world scare-free and binary-tree topologies, and corresponding results have proved the efficiency of the proposed scheme in timely evictions of outdated IoT data stored by CCN in-network caching.

Software-Defined Networking (SDN) and Network Functions Virtualization (NFV) technologies facilitate deploying Service Function Chains (SFCs) at clouds in efficiency and flexibility. However, it is still challenging to efficiently chain Virtualized Network Functions (VNFs) in overlay networks without knowledge of underlying network configurations. Although there are many deterministic approaches for VNF placement and chaining, they have high complexity and depend on state information of substrate networks. Fortunately, Reinforcement Learning (RL) brings opportunities to alleviate this challenge as it can learn to make suitable decisions without prior knowledge. Therefore, in this article, we propose an RL approach for efficient SFC provision in overlay networks, where the same VNFs provided by multiple vendors are with different performance. Specifically, we first formulate the problem into an Integer Linear Programming (ILP) model for benchmarking. Then, we present the online SFC path selection into a Markov Decision Process (MDP) and propose a corresponding policy-gradient-based solution. Finally, we evaluate our proposed approach with extensive simulations with randomly generated SFC requests and a real-world video streaming dataset, and implement an emulation system for feasibility verification. Related results demonstrate that performance of our approach is close to the ILP-based method and better than deep Q-learning, random, and load-least-greedy methods.

With the increasing popularity of terminals and applications, the corresponding requirements of services have been growing significantly. In order to improve the quality of services in resource restrained user devices and reduce the large latency of service migration caused by long distance in cloud computing, mobile fog computing (MFC) is presented to provide supplementary resources by adding a fog layer with several servers near user devices. Focusing on cloud-aware MFC networks with multiple servers, we formulate a problem with the optimization objective to improve the quality of service, relieve the restrained resource of user device, and balance the workload of participant server. In consideration of the data size of remaining task, the power consumption of user device, and the appended workload of participant server, this paper designs a machine learning-based algorithm which aims to generate intelligent adaptive strategies related with load balancing of collaborative servers and dynamic scheduling of sequential tasks. Based on the proposed algorithm and software-defined networking technology, the tasks can be executed cooperatively by the user device and the servers in the MFC network. Besides, we conducted some experiments to verify the algorithm effectiveness under different numerical parameters including task arrival rate, avaliable server workload, and wireless channel condition. The simulation results show that the proposed intelligent adaptive algorithm achieves a superior performance in terms of latency and power consumption compared to candidate algorithms.

The Internet of Things (IoT) has gained great attention in recent years, due to its significant role in industry innovations and promotions. However, it is still facing many technical challenges before fully gaining ground, mainly resulting from limited computational and energy resources of IoT devices and best-effort underlying network paradigms. Thanks to the emerging edge computing that optimizes the cloud computing by processing data at edge networks, IoT devices can offload computation-intensive tasks to their assigned edge computing servers with response time guaranteed and energy consumption saved. As a result, how to perform task offloading by IoT devices has become a key challenge widely discussed. Nevertheless, most of the existing works focus on the tradeoff between executing a task locally and remotely through techniques, such as optimization and game theory, rather than related theoretical model to analyze communication procedures of offloading policies. Thus, in this paper, we propose a multiqueue model to explore the impact of offloading policies on performance of the IoT devices with their assigned edge computing server. Particularly, we consider two simple policies, namely Locality-First policy and Probability-based policy, and obtain their analytic solution of the task mean response time and energy consumption of the IoT devices and edge computing server. Extensive simulations are performed and related results have proved accuracy of the proposed model.

The great improvements in both satellite and terrestrial networks have motivated the academic and industrial communities to rethink their integration. As a result, there is an increasing interest on how to combine broadband satellite networks with the clean-slate terrestrial ones, especially with clouds leveraging SDN (Software-Defined Networking) and NFV (Network Functions Virtualization) techniques, for better network openness, flexibility, elasticity and controllability. In this way, customized SFCs (Service Function Chaining) can be deployed at terrestrial and satellite ground segment clouds on demand, significantly reducing OPEX and CAPEX (Operational and Capital Expense). Nevertheless, how to efficiently leverage cloud substrate resources and deploy required SFCs is still challenging, as many issues such as system cost and revenue are involved. Therefore, in this paper, we focus on SFC mappings at SDN/NFV-based terrestrial and satellite ground clouds, and propose a related approach that considers both SF (Service Function) multiplexing and SFC merging, aiming to improve resource utilization efficiency of underlying substrate networks. Extensive simulations are performed and numerical results have verified benefits of the proposed SFC mapping approach.

With the increasing global mobile traffic, there is a trend to deploy network services at mobile edge clouds. Benefiting from the techniques of Network Function Virtualization and Software-Defined Networking, service function chains are enabled to compose a series of required network functions dynamically. As a consequence, most of common-used and IT-based mobile network services can be deployed at MEC cloud networks under the 5G context, remarkably reducing user latency and network traffic. However, as resources in cloud networks are limited, it is challenging to promote the system utilization with guaranteed user experience. Thus, in this paper, we formulate the allocation problem of service functions in MECs as an Semi-Markov Decision Process model and present a value iteration algorithm to find the optimized solution, aiming to increase request acceptance rate. Additionally, we discuss the parameter settings of the proposed scheme under different cases to find higher rewards.

In recent years, the mobile edge computing (MEC) has achieved various of research interests. By offloading data from the user equipments (UEs) to the MEC servers, many computationally demanding applications can be processed at the edge of the mobile networks. However, the data offloading of MEC needs to share the bandwidth with the conventional traffic in the mobile edge link. Simply using TCP on MEC offloading causes bandwidth robbery to the conventional TCP traffic. On the other hand, in the highly lossy wireless link environments, TCP fails to satisfy the MEC's strict requirement on the short transport delay. Therefore, we propose the MEC offloading transport (MOT) mechanism. MOT uses the prioritized queueing to avoid bandwidth robbery to the conventional traffic, and also uses the per-hop reliability to achieve loss-insensitive bandwidth utilization. The evaluation results show that MOT successfully avoids degrading the QoS of the conventional services, and achieves almost full utilization on the remaining bandwidth.

The existing satellite communication systems suffer from traditional design, such as slow configuration, inflexible traffic engineering, and coarse-grained Quality of Service (QoS) guarantee. To address these issues, in this paper, we propose SERvICE, a Software dEfined fRamework for Integrated spaCe-tErrestrial satellite Communication, based on Software Defined Network (SDN) and Network Function Virtualization (NFV). We first introduce the three planes of SERvICE, Management Plane, Control Plane, and Forwarding Plane. The framework is designed to achieve flexible satellite network traffic engineering and fine-grained QoS guarantee. We analyze the agility of the space component of SERvICE. Then, we give a description of the implementation of the prototype with the help of the Delay Tolerant Network (DTN) and OpenFlow. We conduct two experiments to validate the feasibility of SERvICE and the functionality of the prototype. In addition, we propose two heuristic algorithms, namely the QoS-oriented Satellite Routing (QSR) algorithm and the QoS-oriented Bandwidth Allocation (QBA) algorithm, to guarantee the QoS requirement of multiple users. The algorithms are also evaluated in the prototype. The experimental results show the efficiency of the proposed algorithms in terms of file transmission delay and transmission rate.

Information-Centric Networking (ICN) introduces ubiquitous in-network caching to reduce network load and improve Quality of Service (QoS). This peculiarity requires high-speed caching technologies to support wire-speed and large-amount data forwarding, which brings new challenges to existing routers. To promote practical ICN deployment, many emerging researches focus on how to accelerate caching. In this paper, we propose a novel two-layer High-speed Caching scheme (HCaching), which leverages the characteristics of both SRAM and DRAM to accelerate caching for ICN routers. In particular, using DRAM as a primary cache and SRAM as a secondary one, HCaching is able to: (i) reduce excessive utilization of high-cost SRAM, (ii) speed up access of DRAM, (iii) and improve total network throughput. We implement and analyze HCaching performance by comparing with another two state-of-the-art solutions. The results show that HCaching achieves an improved throughput by 3-10 times faster than the compared solutions.

Satellite networks form part of the modern mobile network. In multi-layer satellite-terrestrial networks, Contact Graph Routing (CGR) enables to calculate an efficient delivery path which depends on the contact information configured in the contact plan. Due to the rapid relative motion between satellites which belong to different layers, the inter-layer contacts can suffer frequent disruption. In order to keep the integrity of the network, the inter-layer contact must be carefully selected to maintain connectivity yet avoid congestion. In this paper, we propose a traffic aware inter-layer contact selection method (TACS) by considering the flow situation of the associated nodes which contains the queue size, flow size, the number of connected nodes and the contact duration. We verify the performance of the proposed design in our Identifier/Locator (ID/Loc) split based satellite- terrestrial network testbed with 95 simulation nodes. Experiments show that the proposed design is able to achieve balanced flow distribution among MEO layer, improve the delivery ratio and reduce the delivery delay.

The demand for multipath transmission is prominent in 5G networks with the deployment of multiple hierarchical access technologies. However, multipath schemes are still not widely adopted due to many reasons, such as deployment challenges and performance reduction under the circumstances of path heterogeneity. Thus, TCP is still in the dominant position of the transport layer protocol for now and for the foreseeable future. Link asymmetry, such as different latency and different bandwidth of different links, is considered to be the main reasons leading to packet reordering, and further result in TCP performance reduction. However, to the best of knowledge, no one has yet given a theoretical model to analyze the relationship between link asymmetry and TCP multipath performance. In this paper, we present a performance analysis model for TCP over multiple heterogeneous networks, which reveals the effect of link asymmetry on TCP throughput. Both bandwidth and delay asymmetry are taken into consideration in the proposed model. The evaluated throughput using the proposed model can accurately fit the simulation results.

Existing satellite communication has a low efficiency due to the inherent defects of the traditional design, i.e., coarsegrained control, and long configuration delay. In some previous work, researchers developed Software Defined Satellite Networks (SDSN). We reconsidered many characteristics equipped in satellite links, and deployed SDSN in the prototype by leveraging Delay Tolerant Network (DTN) and OpenFlow. However, it is necessary to develop a theoretical tool for this new network architecture to evaluate its performance. In this paper, we propose such an analytical model for SDSN using the queueing model. In particular, the Jackson's theorem is adopted to model the communication between a controller and forwarding nodes, and the store-and-forward process. The comparisons between the numerical and experimental results indicate that the proposed model is able to accurately evaluate the performance of SDSN, and will provide great benefits for the further related researches.

Wireless control system for industrial automation has been gaining increasing popularity in recent years thanks to their ease of deployment and the low cost of their components. However, traditional low sample rate industrial wireless sensor networks cannot support high-speed application, while high-speed IEEE 802.11 networks are not designed for real-time application and not able to provide deterministic feature. Thus, in this paper, we propose Det-WiFi, a real-time TDMA MAC implementation for high-speed multihop industrial application. It is able to support high-speed applications and provide deterministic network features since it combines the advantages of high-speed IEEE802.11 physical layer and a software Time Division Multiple Access (TDMA) based MAC layer. We implement Det-WiFi on commercial off-the-shelf hardware and compare the deterministic performance between 802.11s and Det-WiFi under the real industrial environment, which is full of field devices and industrial equipment. We changed the hop number and the packet payload size in each experiment, and all of the results show that Det-WiFi has better deterministic performance.

Information-Centric Networking (ICN) has emerged as a promising way for the efficient content delivery over the Internet, and it can be seen as a super large-scale caching distributed system. However, as one of the most important problems, the cache consistency issue, which refers to whether cached contents in routers are outdated, is still not investigated thoroughly in ICN. Thus, in this paper, we propose a cost-effective Popularity-based Cache Consistency (PCC) mechanism to guarantee the freshness of cached contents in ICN routers. PCC is able to balance the trade between the consistency strength and related costs since it only maintains the strong consistency for popular contents while the weak for unpopular ones. Besides, we improve another two cache consistency mechanisms used in the web caching, namely Polling-Every-Time (PET) and Time-To-Live (TTL), to be suitable for ICN, and use them as the benchmarks for comparisons with PCC. To evaluate their performance, we firstly analyse the costs of these mechanisms including the user latency in terms of hop counts and corresponding signaling overheads, and then conduct extensive simulations using a real topology. The simulation results show the high efficiency of PCC compared with the improved PET and TTL.

Since the satellite network plays an irreplaceable role in many fields, how to interconnect it with the ground network has received an unprecedented attention. However, with much more requirements imposed to the current terrestrial network, many serious problems caused by the IP dual-role exposed. In this context, their direct interconnection seems not the most appropriate way. Thus, in this paper, SAT-GRD, an incrementally deployable ID/Loc split network architecture is proposed, aiming to integrate the satellite and ground networks efficiently. Specifically, SAT-GRD separates the identity of both the host and network from the location. Then, it isolates the host from the network, and further divides the whole network into core and edge networks. These make SAT-GRD much more flexible and scalable to achieve heterogeneous network convergence and avoid problems resulting from the overloaded semantics of IP addresses. In addition, much work has been done to implement the proof-of-concept prototype of SAT-GRD, and experimental results prove its feasibility.

To design efficient high-speed railway (HSR) communication systems, it is essential to characterize the wireless link quality. In this paper, we made a large amount of field investigations on link quality of HSR network, and built a practical model to reflect the changing pattern of link quality along HSR lines in terms of round trip time (RTT) and packet loss rate (PLR). After analyzing a great number of collected dataset of RTT and PLR we excitedly found that their behaviors presented an obvious two-scale time- varying phenomenon. To this end, we analyzed the potential reasons and further characterized link quality of HSR network using a generalized reference model based on hidden Markov chain. An improved forward induction algorithm was proposed to simulate the two-time-scale phenomenon of RTT and PLR. Evaluation results show that the proposed model is able to well reflect the network link quality varying along the HSR line with accuracies of 71.2% and 63.5% in terms of PLR and RTT. The proposed model can be used to guide the HSR link quality prediction and evaluation.

Content-Centric Networking (CCN) has emerged as a promising paradigm in current Internet Due to the interest-driven, we concern more about the content itself rather than the place it located, and therefore, CCN supports subscriber mobility natively, however, it remains a major challenge in publisher mobility. In this paper, we propose a hierarchical mobility management scheme for CCN (HMMCCN) which contains an overlay mapping structure to store the old-to-new name binding relationship and perform the mobility management for mobile nodes. The main goals of this paper are: (a) to propose a mobility scheme suitable for all mobile nodes in CCN, both publishers and subscribers; (b) to describe the hierarchical mobility management procedure during intra-domain and inter-domain handoff; (c) to establish an analytical model and formulate the location update signaling cost.

Content-Centric Networking (CCN) attracts much attention in the ongoing research area of the future Internet. CCN treats content as the first class entity of the network and attempts at addressing challenges in content distribution scalability, mobility and security. Mobile consumers of content may be well served in CCN due to the receiver-driven paradigm. Mobile sources of content, however, face a number of intractable problems, since content names are used both for routing of Interests and content identifying. In this paper, we borrow the idea of data and control plane separation and locator/identifier separation to design a source mobility management scheme in CCN. We design the basic architecture, and describe the handoff processes for the intra-domain movement and inter-domain movement. Finally, numerical results are presented.

As a promising mobility protocol, Proxy Mobile IPv6 (PMIPv6) can provide mobility support without the involvement of the mobile nodes (MNs). It depends on the Local Mobility Anchor (LMA) and Mobility Access Gateway (MAG) to emulate the home network for the attached MNs. Based on this design principle, PMIPv6 works well only for small scale networks. However, with the rapid increase of the MNs as well as the huge traffic loads, PMIPv6 as a centralized mobility management protocol in which both the location management and dada forwarding are performed by the LMA, will induce lots of limitations, such as non-optimal routing, single point of failure, scalability and so on. Therefore, a trend to distributed mobility management (DMM) is popular, and several distributed solutions for PMIPv6 have been proposed until now. In this paper, we survey the different schemes of DMM and focus on the related solutions for PMIPv6 by qualitative analysis, and conclude the remaining challenges and open issues for future development.

Recent work has shown that Proxy Mobile IPv6 (PMIPv6) is a promising mobility management protocol for its salient features, such as supporting unmodified Mobile Node (MN). However, PMIPv6 does not consider the multicast routing support. Moreover, current research mainly concerns on the multicast receiver mobility, but it is a critical and challenging issue to ensure service connectivity for mobile multicast senders, which has not been addressed well. In this paper, we propose an efficient multicast sender mobility scheme for PMIPv6 (PMIP-BT), in which the multicast data can be transmitted through the PMIPv6 tunnel and the multicast sender mobility is transparently enabled in the PMIPv6 networks. Numerical results show that the proposed scheme outperforms the current scheme in terms of signaling cost.

Content Centric Networking (CCN) is one of the representative Information Centric Networking (ICN) architectures. In CCN, data objects are accessed instead of end hosts, and each router maintains a large size of routing table consisting of all name prefixes announced by content servers. To improve the scalability of CCN, an alternative name space relating to Router IDentifier (RID) has been proposed for forwarding the interest instead of using the name prefix of data object, and a name mapping system is applied for mapping data objects related names to RID related names. In this paper we propose dynamic interest transmission scheme in CCN with name mapping (DIT-NM), in which interest can be forwarded towards dynamically chosen RID through dynamically chosen interface associated with the RID according to real-time monitoring network status and traffic load information. The performance of the proposed scheme is evaluated using realistic network topologies with respect to latency and network link utilization. We also compare with the basic CCN model and multi-repository single path (MRSP) to highlight the advantages of our scheme. Achieved results demonstrate the effectiveness of the proposed scheme in reducing latency, improving robustness and balancing overall traffic distribution in name-mapping CCN environment.

The original architecture of content-centric network CCN may suffer from interest flooding attacks. In this paper, we focus on one type of interest flooding attacks called denial of service against content source DACS attack. To damage CCN, it floods a large number of malicious interests requesting content that does not exist, which guarantees that no cache hit can occur at routers until these malicious interests reach the target content source. Thus, it can directly exhaust the resource of the victim. To counter it, we propose a threshold-based detecting and mitigating TDM scheme. The basic idea is to detect DACS attack on the basis of the frequency that pending interest table items in CCN routers expire recording this frequency by introducing two counters with their corresponding thresholds and one indicator for counter mode and to mitigate it by implementing the rate limiter in each router. From the viewpoint of a CCN router, we analyze the performance of TDM in terms of detection ability and effect on mitigating malicious traffic. In addition, we briefly analyze the overhead of TDM. The results show that TDM achieves high detection ability and good effect on mitigating malicious traffic while bringing in small overhead on countering DACS attack. To the best of our knowledge, this is the first attempt to design a detailed scheme embedded with corresponding algorithms on countering this attack. Copyright © 2013 John Wiley & Sons, Ltd.

Abstract Mobile IPv6 (MIPv6) is a host‐based mobility support specification which has been approved by the IETF as the standardized solution of global mobility management in IPv6 network for Mobile Node (MN). However, MIPv6 handover procedure results in a large handover delay. To improve its performance, some MIPv6 variants such as Fast Handover for MIPv6 (FMIPv6) and Hierarchical MIPv6 (HMIPv6) were proposed. However, they all require the MN to support the mobility management protocols which increase the difficulty of management and deployment. Recently, IETF NETLMM workgroup published the Proxy Mobile IPv6 (PMIPv6) which is a network‐based localized mobility management to provide the mobility support for mobile host without the involvement of the mobility signaling. In this paper, we analyze the singling cost of PMIPv6 and implement it in our test‐bed to evaluate its performance. The results show that the PMIPv6 has lower signaling cost and packet delivery cost, and it can improve the handover performance of UDP and TCP than the other mobility management protocols under low‐delay networks, as for the wide area networks, it needs to introduce some mechanism like fast handover to further improve its performance. Copyright © 2009 John Wiley & Sons, Ltd.

Mobile multicast becomes a research hotspot with the development of wireless and mobile technologies, and it is based on the traditional multicast protocols and mobility management protocols to provide the multicast services for mobile subscribers. Several mobile multicast methods were proposed in the past few years, but most of them are based on the mobile IPv6 and its alternatives which require the mobile hosts to support the mobility function. Recently, the proxy mobile IPv6 (PMIPv6) was proposed to provide the mobility support for mobile node with or without mobility involvement, and the previous studies have shown that the PMIPv6 can improve the handover performance. However, the PMIPv6 mainly concerns on the unicast routing support and little considers the multicast routing. In this paper, we study the multicast support in PMIPv6 and propose two multicast methods called the MAG (mobile access gateway)-based method and LMA (local mobility anchor)-based method, and analyze their performance under different scenarios. The analytical results show that the LMA-based method is suitable for the bigger PMIPv6 domain, and larger network topology scenarios (more than 105), whereas the MAG-based method is used for the smaller PMIPv6 domain.

In this paper, we propose a mobile multicast architecture with management support. In this architecture, a powerful entity called Multicast Controller (MC) is deployed which handles most of the multicast management-related tasks. Based on this architecture, the mobile multicast routing protocol called Fast Chain Mobile Multicast (FCMM) is proposed, which processes the handover in advance and spans the multicast tree using the forwarding chain. Our analysis demonstrates that the FCMM protocol outperforms other related protocols and is a promising alternative for providing efficient and flexible mobile multicast services.

In this paper, we propose a network mobility supporting scheme (N-NEMO) in Proxy Mobile IPv6 (PMIPv6) network, which is an issue still up in the air for the PMIPv6. In the N-NEMO, a tunnel splitting scheme is used to differentiate the inter-Mobility Access Gateway (MAG) and intra-MAG mobility. The performance analysis and comparison between other related schemes show that N-NEMO reduces the signaling cost significantly. Besides, it enhances the efficiency and scalability to provide the comprehensive network mobility in the PMIPv6 context.

Source address authentication is very important to change current serious network security situation. In this article, we propose a new source address validation scheme based on IBS algorithm and study its security using SVO logic. We find that our scheme can successfully guarantees authenticity of IP packet’s information source.

Abstract Proxy mobile IPv6 (PMIPv6) is a network‐based mobility protocol where the mobility management signaling is performed by a network entity on behalf of the node requiring mobility itself. To the best of our knowledge, no studies have been conducted in the area of proxy MIPv6 authentication method. This paper proposes an authentication method in proxy MIPv6. In addition to providing access authentication, the proposed authentication method prevents threats such as replay attack and key exposure. Also, we develop analytic models for the authentication latency and cost analysis. Then, the impacts of mobility and traffic parameters on the authentication cost and latency are analyzed, respectively. Copyright © 2008 John Wiley & Sons, Ltd.

Network mobility (NEMO) aims managing seamless connectivity for a group of mobile terminals as a whole mobile network. Multiple care of addresses (MCoA) registration scheme was also proposed to address seamless Internet connectivity issue. In this paper we first analyze the upload and download packet loss of mobile router (MR) in NEMO basic support protocol. Then the seamless Internet connectivity of MR which is equipped with WLAN, CDMA and GPRS interfaces is studied and experimented on our platform successfully. Finally, we analyze and compare the performance of packet loss ratio between uni-interfaced and multiple-interfaced MR, and results indicate that multiple interfaced MR can increase the performance of MR obviously when it moves across heterogenous overlay access networks.

The next generation of mobile/wireless communication system is expected to include heterogeneous broadband wireless networks that will coexist and use a common IP core to offer a diverse range of high data rate multimedia services to end users with contemporary mobile devices. The mobile devices will be equipped with multiple network interfaces since the networks have characteristics that complement each other. This requires the provision of seamless vertical handover. In this paper, a probability driven handover scheme which uses the mobile's speed (SPHO) is developed to support seamless and adaptive handover management between WLAN and UMTS. Extensive simulation experiments show that this scheme effectively achieves seamless handover between heterogeneous networks and guarantees quality of communication during handover.

Proxy Mobile IPv6 is a network-based mobility protocol where the mobility management signaling is performed by a network entity on behalf of the node requiring mobility itself. To the best of our knowledge, no studies have been conducted in the area of Proxy Mobile IPv6 authentication method. This paper proposes an authentication method in Proxy Mobile IPv6. In addition to providing access authentication, the proposed authentication method prevents threats such as replay attack and key exposure. Also, we develop analytic models for the authentication latency and cost analysis. Then, the impacts of mobility and traffic parameters on the authentication cost and latency are analyzed, respectively.