Secure routing is a critical requirement for Internet of Things (IoT) and wireless sensor networks (WSNs) that form the sensing layer of future internet and edge-assisted communication systems. Shortest-path routing alone cannot provide reliable delivery when intermediate nodes exhibit selective forwarding, malicious dropping, or inconsistent behavior. This paper presents HBTV-SR, a permissioned blockchain-assisted trust-evidence retrieval method for secure IoT/WSN routing. The proposed design keeps ordinary sensor nodes lightweight by allowing them to generate signed trust observations, while miner/gateway edge nodes verify signatures, freshness, the absence of duplicate hashes, evidence completeness, and trust-value ranges. Storage nodes maintain Merkle-rooted trust records for tamper-evident retrieval. A reproducible packet-level simulator evaluates HBTV-SR against AODV-like routing, TARF-style trust routing, a direct She et al. blockchain trust baseline, and other baselines surveyed in the literature for the same scenario. Across 30 fixed-seed Monte Carlo runs, HBTV-SR achieved 83.12% packet delivery ratio in the representative 100-node, 20% malicious-node scenario, compared with 78.21% for the She et al. baseline. The results indicate that edge-assisted ledger-backed trust retrieval improves secure routing reliability while avoiding excessive blockchain workload on constrained IoT/WSN nodes.
Manish Agarwal, Aasheesh Shukla, V. Deolia· Journal of Intelligent Decis...· 0 citations
Wireless Sensor Networks (WSN) are significant for various applications, however ensuring data security and energy consumption remains a critical challenge. The conventional methods lacked sufficient security, exhibited communication overhead, and energy inefficiencies. Therefore, this research proposes the Distributed Fractional Hawk Optimization (DtFHO) algorithm to address the limitations in cluster head selection for secure WSN routing. The integration of fractional theory improves the convergence speed and exploitation balance in cluster head selection. To secure the data routing, a blockchain network is employed, which maintains a transparent record of routing paths while preventing malicious node entries. Furthermore, the modified End-to-End Homomorphic encryption enables secure data sharing without decrypting sensitive information at intermediate nodes. Through considering the multimetric factors, the DtFHO algorithm offers a secure routing path, making it highly effective for large-scale and sensitive network scenarios. The DtFHO showcases a robust performance by achieving a minimum transaction time of 2.013 seconds, memory usage of 347.95 Kilobytes, Gas usage of 345.84 Kilobytes, encryption time of 2.012 seconds, and a maximum throughput ratio of 0.748, normalized energy of 0.766 Joules, with 153 alive nodes compared to the conventional methods.
Manish Agarwal, Aasheesh Shukla, V. Deolia· 2026 4th International Confe...· 0 citations