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
Journal ArticleDOI

A Time and Location Correlation Incentive Scheme for Deep Data Gathering in Crowdsourcing Networks

TL;DR: A Time and Location Correlation Incentive (TLCI) scheme for deep data gathering in crowdsourcing networks and two incentive algorithms are proposed to satisfy QoISD with different view to justify the effectiveness of the scheme.
Journal ArticleDOI

An Efficient Network Coding-Based Fault-Tolerant Mechanism in WBAN for Smart Healthcare Monitoring Systems

TL;DR: A design in healthcare monitoring systems for a proactive reliable data transmission mechanism with resilience requirements in a many-to-one stream model and results indicate that this transmission scheme works better than traditional methods in reducing the probability of packet loss, the resource redundant rate, and average delay, and can increase the effective throughput rate.
Journal ArticleDOI

Robust manifold broad learning system for large-scale noisy chaotic time series prediction: A perturbation perspective.

TL;DR: The robust manifold broad learning system (RM-BLS) is proposed for system modeling and large-scale noisy chaotic time series prediction and the equivalence between perturbations to manifold embedding and Tikhonov regularization is proved.
Journal ArticleDOI

The shared bicycle and its Network-Internet of Shared Bicycle (IoSB): a review and survey

TL;DR: The concept of the Internet of Shared Bicycle (IoSB) is proposed for the first time, as far as the authors know, to find a feasible solution for those technical problems of the shared bicycle.
Journal ArticleDOI

IGRC: An improved grid-based joint routing and charging algorithm for wireless rechargeable sensor networks

TL;DR: An improved grid-based joint routing and charging algorithm (IGRC) is proposed to implement path planning for a mobile charger, aiming to achieve energy balance in WRSNs by providing real-time charging services.
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)