Abstract
Abstract To address the issues of data insecurity and unreliable transmission, redundancy-based data recovery can guarantee data security, but the increase of redundant data will reduce the robustness of network in the face of cascading failures. A distributed adaptive routing method in scale-free network is proposed to improve network resilience against selective forwarding attacks and the robustness against cascading failures. Based on the polynomial principle, the proposed routing method slices packets, adds redundancy reasonably and adopts multipath sequential routing method to completely send data to the destination node. The ability to resist selective forwarding attacks and robustness against cascading failures is investigated and analysed throughout the entire network operation. Simulation results show that our proposed routing method is not restricted by the number of disjoint paths, can maintain a higher data recovery ratio and resist effectively selective forwarding attacks, and also balances the network load well. Moreover, this routing method has a lower end-to-end latency for data transmission and is highly resistant to cascading failures under random and intentional attacks.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
