z-logo
open-access-imgOpen Access
An Efficient Technique for Enhancing Robustness of Scale-free Wireless Sensor Networks
Author(s) -
A. Mary Shiny,
Ayda Shaker
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.b2294.078219
Subject(s) - robustness (evolution) , computer science , wireless sensor network , computer network , confidentiality , encryption , computer security , upgrade , biochemistry , chemistry , gene , operating system
In an age where breaches occurrence is precisely numerous, it is essential to safeguard confidential figures including patron records, intellectual property, assessment and enlargement, prospect business plans, and all sorts of confidential facts more proficiently. It is substantial to administer a network to safeguard information. Cyber mugs tear into information systems, accertion in these attacks leads to node deterioration, hence a structure is obligatory which can combat cyber mugs to shield our information nodes in WSNs. To cope with these attacks we adopt an efficient technique for enhancing robustness of scale-free wireless sensor networks. Scale-free networks are not affected much by random thefts but they become defenseless against malicious theft. To overcome this shortcoming this paper presents an enhanced technique , here we have a MAX node which is enclosed with small rate nodes, each MAX node will be highly secured by adopting ROSE algorithm by altering edges keen on to a closed structure to upgrade robustness of a network . This phenomena is achieved by forming a scale-free topology using basic BA model. In this paper, work is done on two operations that is rate diversity and edge value operations, to mold system further vigorous to malicious attacks. System is further encrypted by providing every single node with a private key in a sub network.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here