scholarly journals Adaptive Consensus of Distributed Varying Scale Wireless Sensor Networks under Tolerable Jamming Attacks

2013 ◽  
Vol 2013 ◽  
pp. 1-11
Author(s):  
Jinping Mou
Keyword(s):  
Wireless Sensor Networks ◽  
Dwell Time ◽  
Lyapunov Method ◽  
Wireless Sensor ◽  
Consensus Problem ◽  
Consensus Protocol ◽  
Jamming Attacks ◽  
Jamming Attack ◽  
Average Consensus ◽  
The Given

Consensus problem is investigated for a varying scale wireless sensor network (VSWSN) under tolerable jamming attacks, where the scale of the network is increasing or decreasing due to the newly joined nodes or the removed nodes, respectively; the tolerable jamming attack means that the attack strength is limited. It supposes that during the communications, all nodes may encounter with the tolerable jamming attacks; when the attack power is larger than the given value, the attacked nodes fall asleep, or otherwise the nodes are awakened. Under the sleep method, based on the Lyapunov method, it shows that if the communicating graph is the global limited intersectional connection (GLI connection) and the system has the enough dwell time in the intersectional topology, then under the designed consensus protocol, all nodes achieve the global average consensus.

scholarly journals An Anonymous Channel Categorization Scheme of Edge Nodes to Detect Jamming Attacks in Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (8) ◽  
pp. 2311 ◽  
Author(s):  
Muhammad Adil ◽  
Mohammed Amin Almaiah ◽  
Alhuseen Omar Alsayed ◽  
Omar Almomani
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Wireless Sensor ◽  
Jamming Attacks ◽  
Edge Node ◽  
Jamming Attack ◽  
Proposed Model ◽  
The Media ◽  
Categorization Scheme ◽  
Adjacent Channels

Wireless Sensor Networks (WSNs) are vulnerable to various security threats. One of the most common types of vulnerability threat is the jamming attack, where the attacker uses the same frequency signals to jam the network transmission. In this paper, an edge node scheme is proposed to address the issue of jamming attack in WSNs. Three edge nodes are used in the deployed area of WSN, which have different transmission frequencies in the same bandwidth. The different transmission frequencies and Round Trip Time (RTT) of transmitting signal makes it possible to identify the jamming attack channel in WSNs transmission media. If an attacker jams one of the transmission channels, then the other two edge nodes verify the media serviceability by means of transmitting information from the same deployed WSNs. Furthermore, the RTT of the adjacent channel is also disturbed from its defined interval of time, due to high frequency interference in the adjacent channels, which is the indication of a jamming attack in the network. The simulation result was found to be quite consistent during analysis by jamming the frequency channel of each edge node in a step-wise process. The detection rate of jamming attacks was about 94% for our proposed model, which was far better than existing schemes. Moreover, statistical analyses were undertaken for field-proven schemes, and were found to be quite convincing compared with the existing schemes, with an average of 6% improvement.

scholarly journals Borel Cayley Graph-Based Topology Control for Consensus Protocol in Wireless Sensor Networks

2013 ◽  
Vol 2013 ◽  
pp. 1-15 ◽  
Author(s):  
Junghun Ryu ◽  
Jaewook Yu ◽  
Eric Noel ◽  
K. Wendy Tang
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Interconnection Networks ◽  
Topology Control ◽  
Cayley Graphs ◽  
Small Diameter ◽  
Wireless Sensor ◽  
Control Algorithms ◽  
Transmission Range ◽  
Consensus Protocol

Borel Cayley graphs have been shown to be an efficient candidate topology in interconnection networks due to their small diameter, short path length, and low degree. In this paper, we propose topology control algorithms based on Borel Cayley graphs. In particular, we propose two methods to assign node IDs of Borel Cayley graphs as logical topologies in wireless sensor networks. The first one aims at minimizing communication distance between nodes, while the entire graph is imposed as a logical topology; while the second one aims at maximizing the number of edges of the graph to be used, while the network nodes are constrained with a finite radio transmission range. In the latter case, due to the finite transmission range, the resultant topology is an “incomplete” version of the original BCG. In both cases, we apply our algorithms in consensus protocol and compare its performance with that of the random node ID assignment and other existing topology control algorithms. Our simulation indicates that the proposed ID assignments have better performance when consensus protocols are used as a benchmark application.

Decentralized Average Consensus in Wireless Sensor Networks with Unreliable Communication Channels

2012 ◽  
Vol 3 (3) ◽  
pp. 35-52
Author(s):  
Steve Saed ◽  
Lingxi Li ◽  
Dongsoo S. Kim
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mathematical Analysis ◽  
Communication Channels ◽  
Error Model ◽  
Wireless Sensor ◽  
Signal Model ◽  
Error Models ◽  
Average Consensus ◽  
Signal Error

This study proposes and evaluates an average consensus scheme for wireless sensor networks. For this, two communication error models, the fading signal error model and approximated fading signal error model, are introduced and incorporated into the proposed decentralized average consensus scheme, especially adapted to the constraints of wireless sensor networks. A mathematical analysis is introduced to derive the approximated fading signal model from the fading signal model and different simulation scenarios are introduced and their results analyzed to evaluate the performance of the proposed scheme and its effectiveness in meeting the needs of wireless sensor networks.

Sign in / Sign up

Export Citation Format

Share Document