Communication security in the internet of things (IoT) is essential to prevent devices and data from being vulnerable to cyber-attacks and possible abuses. In IoT systems, some sensors transmit critical data, so maintaining the security of these data and preventing their unauthorized interpretation is of great importance. For this reason, it is necessary to use advanced and complex encryption methods. The proposed research method consists of two phases: in the first phase, we use a hyperchaotic system to generate a complex sequence of pseudo-random numbers, and then by applying this system, we covertly replace the data. After that, we use the honey encryption technique to increase the security and obfuscation of the information, which helps us to improve the security of the data and prevent unauthorized interpretation. The proposed method has several key advantages, including the enhanced security that results from the combination of honey cryptography and chaotic systems, and this combination provides higher security than previous methods. In addition, the flexibility of the proposed protocol ensures its adaptability in various IoT applications, especially in cases where data security is required. These advantages help us to improve the security and efficiency of IoT systems in various situations. The proposed method is able to reduce the energy consumption caused by calculations and reduce the delay to the values of 21.8 and 0.34, respectively. Also, in terms of security, this method has been able to improve the security of information, which has achieved values of 1.041 and 0.49, respectively, using the Mean Squared Error and Bit Error Ratio criteria.

Emergency supplies allocation is a critical task in post-disaster response, as ineffective or delayed decisions can directly lead to increased human suffering and loss of life. In practice, emergency managers must make rapid allocation decisions over multiple periods under incomplete information and highly unpredictable demand, making robust and adaptive decision support essential. However, existing allocation approaches face several challenges: (1) Those traditional approaches rely heavily on predefined uncertainty sets or probabilistic models, and are inherently static, making them unsuitable for multi-period, dynamically allocation problems; and (2) while reinforcement learning (RL) technique is inherently suitable for dynamic decision-making, most existing RL-base approaches assume fixed demand, making them unable to cope with the non-stationary demand patterns seen in real disasters. To address these challenges, we first establish a multi-period and multi-objective emergency supplies allocation problem with demand uncertainty and then formulate it as a two-player zero-sum Markov game (TZMG). Demand uncertainty is modeled through an adversary rather than predefined uncertainty sets. We then propose RESA, a novel RL framework that uses adversarial training to learn robust allocation policies. In addition, RESA introduces a combinatorial action representation and reward clipping methods to handle high-dimensional allocations and nonlinear objectives. Building on RESA, we develop RESA_PPO by employing proximal policy optimization as its policy optimizer. Experiment results with realistic post-disaster data show that RESA_PPO achieves near-optimal performance, with an average gap of only 3.7% in terms of the objective value of the formulated problem, from the theoretical optimum derived by exact solvers. Moreover, RESA_PPO outperforms all baseline methods, including heuristic and standard RL methods, by at least 5.25% on average.

Federated continual learning (FCL) must preserve useful historical knowledge while learning from evolving and statistically heterogeneous client streams. However, indiscriminate replay can retain client-specific bias, noise, or task conflicts and thereby cause negative transfer. In this paper, we propose Adaptive Multi-Factor Accurate Forgetting for Heterogeneous Federated Continual Learning (AMAF-FCL), a selective memory-management framework that jointly assesses replay reliability and adapts the influence of generated historical features. AMAF-FCL achieves this goal by (1) modeling historical knowledge in feature space with a conditional real-valued non-volume-preserving (RealNVP) normalizing flow; (2) combining class-conditional likelihood, predictive uncertainty, and global distribution consistency; and (3) adjusting replay weights according to client–global heterogeneity. The local objective combines a classification loss for learning the current task, a reliability-weighted replay loss for retaining useful historical knowledge, and a feature-distillation loss for limiting drift in the feature representation. In the EMNIST long-task-pool (EMNIST-LTP) benchmark, each client learns six two-class tasks drawn from a client-specific set of handwritten letters. AMAF-FCL achieves 51.2% average accuracy and 7.6% average forgetting, improving over the likelihood-based AF-FCL baseline by 3.7 and 1.5 percentage points, respectively. In the cross-domain digit-and-fashion setting, it reports 71.2% average accuracy and 6.8% average forgetting; with four noisy clients, it obtains 56.1% average accuracy and 9.8% average forgetting. These results indicate that multi-factor reliability assessment and heterogeneity-aware adaptive forgetting improve the balance between useful knowledge retention and harmful-knowledge suppression in heterogeneous FCL.