scispace - formally typeset
Journal ArticleDOI

ROSE: Robustness Strategy for Scale-Free Wireless Sensor Networks

Reads0
Chats0
TLDR
ROSE, a novel robustness enhancing algorithm for scale-free WSNs, is proposed, which exploits the position and degree information of nodes to rearrange the edges to resemble an onion-like structure, which has been proven to be robust against malicious attacks.
Abstract
Due to the recent proliferation of cyber-attacks, improving the robustness of wireless sensor networks (WSNs), so that they can withstand node failures has become a critical issue. Scale-free WSNs are important, because they tolerate random attacks very well; however, they can be vulnerable to malicious attacks, which particularly target certain important nodes. To address this shortcoming, this paper first presents a new modeling strategy to generate scale-free network topologies, which considers the constraints in WSNs, such as the communication range and the threshold on the maximum node degree. Then, ROSE, a novel robustness enhancing algorithm for scale-free WSNs, is proposed. Given a scale-free topology, ROSE exploits the position and degree information of nodes to rearrange the edges to resemble an onion-like structure, which has been proven to be robust against malicious attacks. Meanwhile, ROSE keeps the degree of each node in the topology unchanged such that the resulting topology remains scale-free. The extensive experimental results verify that our new modeling strategy indeed generates scale-free network topologies for WSNs, and ROSE can significantly improve the robustness of the network topologies generated by our modeling strategy. Moreover, we compare ROSE with two existing robustness enhancing algorithms, showing that ROSE outperforms both.

read more

Citations
More filters
Proceedings ArticleDOI

Cyber Attack Detection In Smart Grid Substation Using Virtual Range Increment And Trust Weight

TL;DR: This paper proposes an approach for resolving cyber intrusion detection in the overlapped area of smart grid substation sensors by using VRI the working area of sensor nodes is increased virtual using MATLAB so that the exact malicious nodes can be identified from suspicious nodes.
Journal ArticleDOI

Model and Analyze the Cascading Failure of Scale-Free Network Considering the Selective Forwarding Attack

TL;DR: In this paper, a selective forwarding attack model based on node importance is proposed to evaluate the comprehensive impact of cascading failure phenomenon on network connectivity and information integrity under selective forwarding attacks.
Journal ArticleDOI

ANCR-an Adaptive Network Coding Routing Scheme For WSNs with Different-Success-Rate Links

TL;DR: This paper proposes a new routing strategy, named Adaptive Network Coding Routing (ANCR), which firstly establishes a routing path with the traditional network coding routing (NCR), and then applies the neighborhood search algorithm to adaptively determine nodes’ coding opportunities based on the links’ transmission success rates, with the target of reducing the total number of transmission.
Proceedings ArticleDOI

Recruiting MCS Workers Strategy with Non-Fixed Reward in Social Network

TL;DR: In this paper, a novel influence and cost trade-off (ICT) algorithm is proposed to apply the worker recruitment strategy in the real world, where the influence model based on social interaction is used to select a near-optimal set of seeds by the revenue-cost-ratio.
Journal ArticleDOI

Evolution model of high quality of service for spatial heterogeneous wireless sensor networks

TL;DR: In this article , the authors proposed two self-organizing evolution models based on the topology hops for heterogeneous WSNs, which can effectively reduce the reverse connection and balance the load of nodes around the sink in network evolution process.
References
More filters
Journal ArticleDOI

Collective dynamics of small-world networks

TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Journal ArticleDOI

Emergence of Scaling in Random Networks

TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Journal ArticleDOI

Error and attack tolerance of complex networks

TL;DR: It is found that scale-free networks, which include the World-Wide Web, the Internet, social networks and cells, display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected even by unrealistically high failure rates.
Journal ArticleDOI

An efficient k-means clustering algorithm: analysis and implementation

TL;DR: This work presents a simple and efficient implementation of Lloyd's k-means clustering algorithm, which it calls the filtering algorithm, and establishes the practical efficiency of the algorithm's running time.
Journal ArticleDOI

Error and attack tolerance of complex networks

TL;DR: This work represents communication/transportation systems as networks and studies their ability to resist failures simulated as the breakdown of a group of nodes of the network chosen at random (chosen accordingly to degree or load).
Related Papers (5)