Search

This research proposes a novel, low-power routing protocol tailored for IoT networks that merges intelligent data-aggregation clustering with optimized path selection to overcome critical data-handling challenges in smart urban environments. The protocol relies on a layered architecture that includes Data Fusion Heads (DFH), intermediate relay DFHs, and the marine predators algorithm—an effective nature-inspired optimizer equipped with a purpose-built fitness function. This function simultaneously refines multiple criteria: the geographic clustering density of Sensor Nodes (SNs) inside each data fusion group (DFG), the total hop distance toward the sink, intra-group node proximity, residual battery level (RE), Average Scale of Building Occlusions (ASBO), and the rotation interval of the Primary DFH (PDFH). One of the protocol’s core advancements is the systematic application of in-network data fusion, which drastically reduces duplicate packet forwarding and markedly improves the accuracy and usefulness of collected information across all DFGs. By aggregating readings from multiple sensors, the volume of outbound traffic is greatly reduced, yielding substantial improvements in energy efficiency. Two complementary forwarding strategies are supported: single-hop forwarding, where already fused payloads travel directly to the sink, and multi-hop forwarding, in which an appropriate PDF relay is dynamically elected using a weighted relay selection metric that incorporates remaining energy (RE), sink distance, and ASBO. By integrating robust fault-tolerance procedures, intelligent redundancy elimination, and efficient fusion mechanisms, the protocol achieves markedly greater dependability and sustains strong operation under adverse or unpredictable network conditions. Detailed simulation experiments, along with side-by-side benchmarking against contemporary methods, confirm the protocol’s clear advantage across essential performance indicators—namely, network longevity, total energy expenditure, data throughput, and mean end-to-end latency. Compared with leading recent approaches such as the Particle Swarm Optimization-based energy-efficient clustering protocol (PSO-EEC), linearly decreasing inertia weight PSO (LDIWPSO), Optimized Fuzzy Clustering Algorithm (OFCA), and Novel PSO-based Protocol (NPSOP), the presented solution delivers outstanding gains. Concretely, network lifetime is prolonged by 299% versus PSO-EEC, 264% versus LDIWPSO, 306% versus OFCA, and 249% versus NPSOP. Energy usage drops by 254% relative to PSO-EEC, 264% relative to LDIWPSO, 247% relative to OFCA, and 253% relative to NPSOP. Throughput rises by 67% over PSO-EEC, 59% over LDIWPSO, 53% over OFCA, and 50% over NPSOP. By skillfully combining data aggregation with carefully tuned routing decisions, this protocol establishes a new benchmark for power-efficient organization and communication within IoT-based data fusion groups, delivering a dependable and adaptable framework suitable for diverse smart-city and IoT scenarios.

This paper introduces a benchmark comparison of distributed optimization algorithms based on dual decomposition for model predictive control problems with constraint coupling. Such problems can be viewed as multiple subsystems linked through constraints on shared, limited resources. In a dual decomposition approach, the allocation and use of these resources are coordinated by repeatedly calculating their associated prices and distributing those values to the participating subsystems. After a short overview of model predictive control, various architectures and communication structures suitable for distributed implementations are outlined. The centralized control problem is then decomposed into several subproblems by introducing dual variables. A range of distributed optimization methods is examined, including the recently developed quasi-Newton dual ascent algorithm. Additionally, an epigraph reformulation of the bundle, combined with a line search technique, is proposed for the quasi-Newton dual ascent method; these enhancements improve its numerical stability and accelerate convergence relative to the earlier trust-region approach. Lastly, the quasi-Newton dual ascent algorithm is benchmarked against the subgradient method, the bundle trust method, and the alternating direction method of multipliers across a broad set of test problems. All benchmark instances are openly accessible on GitHub.