RETRACTED ARTICLE: Advanced resilient data consigning mechanism for mobile adhoc networks

• Published in: Journal of ambient intelligence and humanized computing 2021-03, Vol.12 (3), p.4255-4268
• Main Authors: Karthikeyan, K., Ramesh, S., Kirubakaran, Namaskaram, Uma Maheswari, P., Arun Prasath, R., Muthukumar, M.
• Format: Article
• Language: English
• Subjects: Artificial Intelligence; Computational Intelligence; Engineering; Original Research; Robotics and Automation; User Interfaces and Human Computer Interaction
• ISSN: 1868-5137; 1868-5145
• DOI: 10.1007/s12652-020-01820-7

Routing in network is a classic issue to be solved. To route the data among the nodes without any interruptions and without getting yield in any kind of malicious attack is a tedious task. Though there exist many routing techniques which were near success in the past some part of the problems are always left unsolved. Trust-based routing techniques and the bio-inspired path is connecting techniques area embedded together to solve this. The security of the proposed technique is given a big significance, which takes care of the rest of the key points. Initially, when a node tries to enter into the network which was already secured and confined by trustable nodes, we provide a two-way security check both from the new node and from the host node. This is made possible by applying digital signature algorithm, hash message authentication code, and message-digest algorithms for signature generations, hash value generation, and its corresponding encrypt and decrypt procedure. Elliptic curve Diffie–Hellman algorithm is used for certificate verification, after which the node is provided with the broadcast key. In the case of routing, ant colony optimization is applied to detect the best path for routing from root to destiny, and this path is again verified by trust frameworks and certain calculations. This highly secured verification and authentication process make the proposed advanced resilient data consigning mechanism (ARDC) stand out from the existing routing mechanisms. The proposed ARDC mechanism is analyzed against various network frameworks as throughput, packet loss, overhead, delivery ratio, delivery latency, and hop count and path reliability to prove its effectiveness. Further, the routing capability is also analyzed by comparing it against traditional DSR, destination-sequenced distance-vector and open shortest path first protocols.