scholarly journals SARSA based access control with approximation by TileCoding

2019 ◽  
Vol 16 (3) ◽  
pp. 689-704
Author(s):  
Fei Zhu ◽  
Pai Peng ◽  
Quan Liu ◽  
Yuchen Fu ◽  
Shan Zhong

Traditional sensor nodes ignore the packet loss rate during information transmission and the access control security problem caused by server utilization when uploading data. To solve the problem, we propose a SARSA based access control method with approximation by TileCoding (SACT), which takes the sensor packet loss rate and the server error rate into account. The network state is estimated by the packet loss rate and variable bit error rate to get a server access control strategy to improve security performance. The eventual strategy complies with the minimum information loss and the maximum server utilization. Results of experiments show that the algorithm is capable of achieving good results in the total amount of information received by the server system. The SACT improves the server utilization rate and the overall security performance of the network.

2019 ◽  
Vol 2019 ◽  
pp. 1-11
Author(s):  
Kehua Zhao ◽  
Yourong Chen ◽  
Siyi Lu ◽  
Banteng Liu ◽  
Tiaojuan Ren ◽  
...  

To solve the problem of sensing coverage of sparse wireless sensor networks, the movement of sensor nodes is considered and a sensing coverage algorithm of sparse mobile sensor node with trade-off between packet loss rate and transmission delay (SCA_SM) is proposed. Firstly, SCA_SM divides the monitoring area into several grids of same size and establishes a path planning model of multisensor nodes’ movement. Secondly, the social foraging behavior of Escherichia coli in bacterial foraging is used. A fitness function formula of sensor nodes’ moving paths is proposed. The optimal moving paths of all mobile sensor nodes which can cover the entire monitoring area are obtained through the operations of chemotaxis, replication, and migration. The simulation results show that SCA_SM can fully cover the monitoring area and reduce the packet loss rate and data transmission delay in the process of data transmission. Under certain conditions, SCA_SM is better than RAND_D, HILBERT, and TCM.


2021 ◽  
Author(s):  
John Clement Sunder A ◽  
K.P. Sampoornam KP ◽  
R.Vinodkumar R

Abstract Detection and isolation of Sybil and wormhole attack nodes in healthcare WSN is a significant problem to be resolved. Few research works have been designed to identify Sybil and wormhole attack nodes in the network. However, the detection performance of Sybil and wormhole attack nodes was not effectual as the false alarm rate was higher. In order to overcome such limitations, Delta Ruled First Order Iterative Deep Learning based Intrusion Detection (DRFOIDL-ID) Technique is proposed. The DRFOIDL-ID Technique includes two main phase namely attack detection and isolation. The DRFOIDL-ID Technique constructs Delta Ruled First Order Iterative Deep Learning in attack detection phase with aim of detecting the occurrence of Sybil and wormhole attacks in healthcare WSN. After detecting the attack nodes, DRFOIDL-ID Technique carried outs isolation process with the objective of increasing the routing performance. During the isolation phase, DRFOIDL-ID Technique keep always the identified Sybil and wormhole attack nodes through transmitting the isolation messages to all sensor nodes in healthcare WSN. Hence, DRFOIDL-ID Technique improves the routing performance with lower packet loss rate. The DRFOIDL-ID Technique conducts the simulation process using factors such as attack detection rate, attack detection time, false alarm rate and packet loss rate with respect to a diverse number of sensor nodes and data packets. The simulation result proves that the DRFOIDL-ID Technique is able to improve the attack detection rate and also reduces the attack detection time as compared to state-of-the-art works.


Author(s):  
Sachin D. Babar ◽  
Parikshit N. Mahalle

The growth of wireless sensor networks (WSNs) in the last few years, enhances the use, efficiency, and accuracy of a large number of applications such as defense, habitat monitoring, industrial, and many more. The performance of WSNis largely affected by the security, as large numbers of security attack are happening on the WSN. Therefore, it is necessary to have a security solution to use theWSN proficiently. The objective of this paper is to address the security problem of WSN by proposing the key management mechanism to establish the secure link for communication. The paper proposes the cluster-based key management technique based on hash key mechanism. The mechanism considers the key establishment and verification at two levels, one at onehop distance and the other at multi-hop destination. The proposed work is evaluated by considering the varying number of attackers in the network. The mechanism shows reduced packet lost rate and energy consumption as compared with one-hop key management solutions, by making the tradeoff of delay. The results shows the improvement in packet loss rate i.e., without any solution, if attack happens obviously the attack performance reduces with an increase in pack loss rate and after applying the solution, the packet loss rate is reduced.  


2021 ◽  
Author(s):  
N. Muruganandam ◽  
V. Venkatraman ◽  
R. Venkatesan

Abstract WSN includes a scenario where huge amount of sensor nodes are distributed to monitor environmental conditions with route collected data towards sinks via the internet. WSNs efficiently manage the wider network with available resources, such as residual energy and wireless channel bandwidth. Therefore, routing algorithm is important to enhance battery-constrained networks. Many existing techniques are developed for balancing consumption of energy but efficient routing was not achieved. Multivariate Weighted Isotonic Regressive Modest Adaptive Boosting based Resource Aware Routing (MWIRMAB-RAR) technique is introduced for enhancing routing. The MWIRMAB-RAR technique includes a different process namely resource-aware node selection, route path discovery, and data transmission. Initially, the MWIRMAB-RAR technique uses the Modest Adaptive Boosting technique uses the Multivariate Weighted Isotonic Regression function for detecting resource-efficient sensor nodes for effective data transmission. After that, multiple route paths are established based on the time of flight method. After establishes route path, source node sends data packets to sink node via resource-efficient nodes. The data delivery was enhanced and minimizes packet loss as well as delay. The simulation analysis is carried out on certain performance factors such as energy consumption, packet delivery ratio, packet loss rate, and delay with number of data packets and sensor nodes. The obtained evaluation indicates MWIRMAB-RAR outperforms well in terms of increasing data packet delivery and reduces consumption of energy, packet loss rate, and delay.


2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Saneh Lata Yadav ◽  
R. L. Ujjwal ◽  
Sushil Kumar ◽  
Omprakash Kaiwartya ◽  
Manoj Kumar ◽  
...  

Congestion in wireless sensor networks (WSNs) is an unavoidable issue in today’s scenario, where data traffic increased to its aggregated capacity of the channel. The consequence of this turns in to overflowing of the buffer at each receiving sensor nodes which ultimately drops the packets, reduces the packet delivery ratio, and degrades throughput of the network, since retransmission of every unacknowledged packet is not an optimized solution in terms of energy for resource-restricted sensor nodes. Routing is one of the most preferred approaches for minimizing the energy consumption of nodes and enhancing the throughput in WSNs, since the routing problem has been proved to be an NP-hard and it has been realized that a heuristic-based approach provides better performance than their traditional counterparts. To tackle all the mentioned issues, this paper proposes an efficient congestion avoidance approach using Huffman coding algorithm and ant colony optimization (ECA-HA) to improve the network performance. This approach is a combination of traffic-oriented and resource-oriented optimization. Specially, ant colony optimization has been employed to find multiple congestion-free alternate paths. The forward ant constructs multiple congestion-free paths from source to sink node, and backward ant ensures about the successful creation of paths moving from sink to source node, considering energy of the link, packet loss rate, and congestion level. Huffman coding considers the packet loss rate on different alternate paths discovered by ant colony optimization for selection of an optimal path. Finally, the simulation result presents that the proposed approach outperforms the state of the art approaches in terms of average energy consumption, delay, and throughput and packet delivery ratio.


2021 ◽  
pp. 1-12
Author(s):  
Yinghua Feng ◽  
Wei Yang

In order to overcome the problems of high energy consumption and low execution efficiency of traditional Internet of things (IOT) packet loss rate monitoring model, a new packet loss rate monitoring model based on differential evolution algorithm is proposed. The similarity between each data point in the data space of the Internet of things is set as the data gravity. On the basis of the data gravity, combined with the law of gravity in the data space, the gravity of different data is calculated. At the same time, the size of the data gravity is compared, and the data are classified. Through the classification results, the packet loss rate monitoring model of the Internet of things is established. Differential evolution algorithm is used to solve the model to obtain the best monitoring scheme to ensure the security of network data transmission. The experimental results show that the proposed model can effectively reduce the data acquisition overhead and energy consumption, and improve the execution efficiency of the model. The maximum monitoring efficiency is 99.74%.


Sign in / Sign up

Export Citation Format

Share Document