The Financial Action Task Force (FATF) Travel Rule compels each virtual asset service provider (VASP) to exchange originator and beneficiary identities, creating a policy-driven tension between regulatory compliance and user privacy. This yields a concrete requirement: comply with the regulation while ensuring strong privacy and security across domains. However, existing approaches often address only a subset of these requirements in multi-VASP settings (e.g., configurable t-of-n tracing without explicit protection against log-driven cross-domain linking or Δ-revocation safety). We present PAAS, a policy-adaptive traceable anonymity scheme for cross-domain networks. PAAS enforces bridging-log privacy and policy-driven split tracing for incident-tier governance by mapping trace tiers to a hierarchical, role-weightedt-of-nthreshold structure, thereby separating pseudonym linkage from real-world identity disclosure (link ≠ identity), and bounds revocation-bypass risk within a latency window Δ under a Δ-revocation model with an ephemeral challenge–response bridging protocol. Together, these mechanisms deliver unlinkable anonymity, accountable tracing, and safe anonymous roaming across domains. We analyze the security of PAAS under standard cryptographic assumptions, establishing robust policy-adaptive anonymity and policy-governed accountability; our performance evaluation reports service-phase computation latency of 0.22 ms (existing pseudonym) or 6.12 ms (with bridging issuance) and throughput of ≈49.5 TPS (i.e., requests/s) under 100 concurrent users, outperforming the evaluated baselines in terms of service-phase latency and throughput, while maintaining low-latency computation for bridging and roaming (0.7–6.6 ms).

In recent years, high-bandwidth and low-cost wireless technologies have emerged as a competitive element, enabling the smart home environment. On the other hand, with the increasing demands for various services, the current access point allocation schemes give rise to significant challenges for a stable connection service, bandwidth and load distribution. In this paper, we present an optimal access point allocation scheme based on genetic algorithm that attempts to optimize multiple parameters, such as bandwidth, and load-balancing requirements. The proposed allocation scheme provides a set of approximately efficient solutions, which allows a wireless user to choose an access point based on its capacity and load balancing, not only regarding its signaling strength or service set identifier. The simulation results are provided to demonstrate the impact of the proposed optimization procedure on overall system performance in terms of connection distribution, load balancing and call dropping probability.

Mobile IP is the basic solution to providing host mobility, whereas network mobility (NEMO) refers to the concept of the collective mobility of a set of nodes. The NEMO basic support protocol has been proposed in IETF as a first solution to the problem of network mobility. The main limitation of this basic solution is that it forces triangular routing, i.e., packets are always forwarded through the home agent (HA), following a suboptimal path. This is because each sub-NEMO obtains a care of address (CoA) that belongs to the home prefix of its parent mobile router. Such a CoA is not topologically meaningful in the current location, since the parent mobile router could also be away from home, and hence, packets addressed to the CoA are forwarded through the HA of the parent NEMO. To solve this problem, various extended proposals, with differing approaches and goals, exist for route optimization (RO) in NEMO applications. Their influences on the RO performance have been evaluated by classifying the detailed operations performed within the nested NEMO network, and then each category is analyzed in detail. The modeling of the detailed RO operation is intended to quantify the tradeoffs between the different approaches in order to provide a basis for the selection decision. In particular, the proposed grouping of the different proposals, based on their address configuration strategy, clarifies their similarities and differences, and provides some useful insights into the various methods that have been developed. In conclusion, it is suggested that, when choosing a solution for deploying NEMO, the designer has to balance his choices between the different pros and cons, and the different cases of application that are derived in this paper.

Proxy mobile IPv6 is one of network-based mobility support protocols which does not require a mobile host to be involved in mobility support signaling. Even though proxy mobile IPv6 has many advantages than client-based mobility support protocols such as mobile IPv6, unfortunately, it may cause an out-of-sequence problem during its route optimization procedure. Thus, in this paper, we develop an estimation function for an out- of-sequence time period and reveal the out-of-sequence problem caused by the route optimization procedure. Then we propose a scheme which minimizes the arrival of out-of-sequence packets to the mobile host and analyze the impact of out-of-sequence packets. The performance evaluation results demonstrate that the traffic rate and out-of-sequence time period mainly have an effect on the out-of-sequence problem.