Abstract

Optimized routing in wireless network is the trending research area in ad-hoc wireless communication. Performance of outmoded schemes designed for security during the process of routing in sensor networks significantly affected by consistency and security issues. However the present routing schemes are inexpensive and need no rigorous positioning but security is still unavoidable apprehension. An optimized routing scheme is proposed for WSN in this paper which is named as Collaborative Optimized Routing Algorithm (CORA), which precisely focuses on optimized progression of data during routing along with security aspects. CORA functions in two phases, first phase is to identify and group the collaborative nodes through defined lenient constant based on direct_trust, link_strength and quality parameters. Direct_trust and link_strength are direct measures but to evaluate quality, link survival time and caused delay are considered. Whereas in second phase suit function is defined for choosing the optimized nodes using the proposed CORA, based on direct_trust, link_strength, quality and distance. Performance of proposed collaborative optimized routing scheme is assessed based on the measurement metrics with 50 dynamic nodes ad-hoc sensor network in presence of selective forwarding and denial-of-service attacks. CORA indicates the higher detection rate and throughput as 54.9 and 41.6 respectively and lower delay and distance as 15 and 158.8 respectively which are significantly better than competing schemes.

Full Text
Paper version not known

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 call

Disclaimer: 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.