Flying Ad Hoc Networks let unmanned aerial vehicles communicate directly, without relying on fixed ground infrastructure, in time-critical settings such as disaster response, search and rescue, border surveillance, precision agriculture, and military reconnaissance. UAV mobility, however, causes frequent topology changes and intermittent connectivity, so nodes typically store data locally and replicate it across the network to keep it available. The resulting challenge is consistency: independently evolving copies must be reconciled without a central coordinator, and strong consistency is not realistic in a network this prone to partitioning. We address this with the Decentralized Mobile Reconciliation Protocol (DMRP), which provides eventual consistency among UAV nodes with no external coordination, with convergence formally guaranteed whenever the swarm’s synchronisation graph is eventually connected. DMRP combines immediate local validation and convergence guarantees grounded in conflict-free replicated data type properties; hysteresis-based memory management with dual thresholds to cap journal storage overhead; adaptive delta or full-state synchronisation based on receiver lag; and epidemic propagation for transitive update dissemination. Energy efficiency guided the design throughout, through wireless broadcast and the avoidance of redundant transmissions. DMRP was implemented and evaluated through extensive OMNeT++/INET simulations of three-dimensional FANET scenarios. Results demonstrate that the protocol maintains a strictly bounded reconciliation journal, whereas the reference -CRDT log grows without bound, reducing reconciliation-journal storage by up to 75% at the largest workload evaluated, while achieving near-complete consistency after node isolation and network partitioning.
The rapid expansion of the Internet of Things (IoT) has brought greater attention to the reliability and security of communication within Low-Power and Lossy Networks (LLNs) with constrained resources. Of all the protocols for such networks, the Routing Protocol for Low-Power and Lossy Networks (RPL) plays a central role in enabling effective routing in 6LoWPAN-based IoT systems. However, RPL does not possess any built-in security measures, making it vulnerable to a wide range of attacks, primarily DODAG Information Object (DIO) message-based attacks such as DIO suppression, neighbor, and copycat attacks. Such attacks destabilize the network topology, reduce the packet delivery ratio (PDR), and increase latency and energy consumption. To thwart such problems, this paper presents MVTC-Sec, a Mathematically Validated Timestamp Correlation method that detects replay-based DIO attacks by analyzing deviations from the expected Trickle algorithm timing. Passively observing DIO intervals, MVTC-Sec identifies attack nodes violating the exponential backoff behavior, with efficient and lightweight attack detection irrespective of cryptographic overhead. We evaluate MVTC-Sec using the Cooja simulator under both static and mobile RPL scenarios, with varying attacker behaviors and replay intervals. Results show that MVTC-Sec achieves a detection accuracy ranging from 90% to 99%, improves packet delivery ratio (PDR) to 0.50–0.96, and reduces end-to-end latency by up to 60%. The scheme proves to be of low overhead, requiring only (48.1 kB ROM, 6.3 KB RAM), making it suitable for resource-constrained devices. Compared to the existing solutions, MVTC-Sec offers higher detection accuracy, lower complexity, and improved adaptability, making it an efficient and scalable protection method for RPL-based IoT networks.