In the current ongoing crisis, people mostly rely on mobile phones for all the activities, but query analysis and mobile data security are major issues. Several research works have been made on efficient detection of antipatterns for minimizing the complexity of query analysis. However, more focus needs to be given to the accuracy aspect. In addition, for grouping similar antipatterns, a clustering process was performed to eradicate the design errors. To address the above-said issues and further enhance the antipattern detection accuracy with minimum time and false positive rate, in this work, Random Forest Bagging X-means SQL Query Clustering (RFBXSQLQC) technique is proposed. Different patterns or queries are initially gathered from the input SQL query log, and bootstrap samples are created. Then, for each pattern, various weak clusters are constructed via X-means clustering and are utilized as the weak learner (clusters). During this process, the input patterns are categorized into different clusters. Using the Bayesian information criterion, the similarity measure is employed to evaluate the similarity between the patterns and cluster weight. Based on the similarity value, patterns are assigned to either relevant or irrelevant groups. The weak learner results are aggregated to form strong clusters, and, with the aid of voting, a majority vote is considered for designing strong clusters with minimum time. Experiments are conducted to evaluate the performance of the RFBXSQLQC technique using the IIT Bombay dataset using the metrics like antipattern detection accuracy, time complexity, false-positive rate, and computational overhead with respect to the differing number of queries. The results revealed that the RFBXSQLQC technique outperforms the existing algorithms by 19% with pattern detection accuracy, 34% minimized time complexity, 64% false-positive rate, and 31% in terms of computational overhead.

Random Forest Bagging and X-Means Clustered Antipattern Detection from SQL Query Log for Accessing Secure Mobile Data

A cryptographic paradigm to detect and mitigate blackhole attack in VANET environments

A novel trust-based security and privacy model for Internet of Vehicles using encryption and steganography

Hybrid and dynamic clustering based data aggregation and routing for wireless sensor networks

Confidentiality and data integrity are essential paradigms in data aggregation owing to the various cyberattacks in wireless sensor networks (WSNs). This study proposes a novel technique named Lamport certificateless signcryption-based shift-invariant connectionist artificial deep neural networks (LCS-SICADNN) by using artificial deep neural networks to develop the data aggregation security model. This model utilises the input layer with several sensor nodes, four hidden layers to overcome different attacks (data injection, compromised node, Sybil and black hole attacks) and the output layer to analyse the given input. The Lamport one-time certificateless signcryption technique involving three different processes (key generation, signcryption and unsigncryption) is adopted to achieve secure data transmission between the sender and receiver. Firstly, a one-way function is executed to generate the public and private keys for each sensor node in the WSN. Secondly, digital signature generation and encryption are both performed. The sender node, which handles the signature generation and data encryption, forwards the data to the aggregator node. Then, the receiver verifies the data by using the sender’s public key during data decryption. Thus, data aggregation security can be guaranteed. Finally, the authorised node aggregates the data with much higher data confidentiality and privacy. Performance analysis is conducted by simulating the proposed LCS-SICADNN and conventional models. Results of comparison indicate that the LCS-SICADNN can improve data aggregation security with higher throughput and lesser delay, packet drop and overhead compared with the conventional methods. 

/pdf/lamport-certificateless-signcryption-deep-neural-networks-2exlely5.pdf

Lamport Certificateless Signcryption Deep Neural Networks for Data Aggregation Security in WSN

Clustering in wireless sensor networks plays a vital role in solving energy and scalability issues. Although multiple deployment structures and cluster shapes have been implemented, they sometimes fail to produce the expected outcomes owing to different geographical area shapes. This paper proposes a clustering algorithm with a complex deployment structure called radial-shaped clustering (RSC). The deployment structure is divided into multiple virtual concentric rings, and each ring is further divided into sectors called clusters. The node closest to the midpoint of each sector is selected as the cluster head. Each sector’s data are aggregated and forwarded to the sink node through angular inclination routing. We experimented and compared the proposed RSC performance against that of the existing fan-shaped clustering algorithm. Experimental results reveal that RSC outperforms the existing algorithm in scalability and network lifetime for large-scale sensor deployments.

https://www.mdpi.com/1424-8220/20/17/4937/pdf

A Heuristic Angular Clustering Framework for Secured Statistical Data Aggregation in Sensor Networks.

Black Hole and Sink Hole Attack Detection in Wireless Body Area Networks

Transmission of the information in any form requires security. Security protocols used for communication rely on the use of random numbers. Pseudo-random numbers are required with good statistical properties and efficiency. The use of a single chaotic map may not produce enough randomness. The turbulence is padded into the existing map to improve its chaotic behaviour and increase the periodicity. A Pseudo-random number generator (PRNG) with this architecture is devised to generate random bit sequences from secret keys. The statistical properties of newly constructed PRNG are tested with NIST SP 800–22 statistical test suite and were shown to have good randomness. To ensure its usability in cryptographic applications, we analysed the size of its key space, key sensitivity, and performance speed. The test results show that the newly designed PRNG has a 3.6% increase in key space and a 5% increase in its performance speed compared to existing chaotic PRNGs. The novel PRNG with faster performance is found suitable for lightweight cryptographic applications.

Rajesh Kumar Dhanaraj

Papers

A Heuristic Angular Clustering Framework for Secured Statistical Data Aggregation in Sensor Networks.

Black Hole and Sink Hole Attack Detection in Wireless Body Area Networks

Design of pseudo-random number generator from turbulence padded chaotic map

Random Forest Bagging and X-Means Clustered Antipattern Detection from SQL Query Log for Accessing Secure Mobile Data

Bootstrap aggregative mean shift clustering for big data anti-pattern detection analytics in 5G/6G communication networks