Wireless sensor networks consist of independent sensors that sense and monitor the area of deployment and distributedly communicate this information to base station. The desirables of WSN are to have long longevity and high reliability along with maximized coverage. LEACH is one of the most discussed hierarchical, cluster-based routing protocols for sensor networks owing to its load-balancing characteristics. In this paper, we have presented a hybrid approach (H-LEACH) in which the clusters are fixed, but the cluster heads are chosen dynamically. The approach shows an improved performance that is duly supported by the simulation results using MATLAB. The paper concludes with the limitations and further scope for improvement in the proposed protocol.

H-LEACH: Modified and Efficient LEACH Protocol for Hybrid Clustering Scenario in Wireless Sensor Networks

In a wireless sensor network, the sensors periodically transmit sensed data from a specific environment to a centralized station by wireless communication. Deployment in an open environment leads to the potential of security attacks. A sinkhole attack is a destructive attack aimed at the network layer, where the sinkhole node attracts other nodes by advertising itself as the best path to the base station. Subsequently receiving other sensor node packets and compromising network security. Hence, this work proposes a lightweight, secure method based on the Threshold Sensitive Energy Efficient Sensor Network protocol and watermarking techniques to ensure data integrity during transmission. The homomorphic encryption used in this scheme is to provide fast and efficient and consumes less energy while identifying sensor nodes for the purpose of sinkhole detection and prevention. The proposed work has been evaluated using OMNET++ simulation environment to measure the proposed work performance in the following metrics: delay, packet delivery ratio, throughput, and average energy consumption. Compared with previous works, the proposed work shows better results in these metrics. In addition, the proposed scheme consumes less energy compared with similar works due to the use of lightweight watermarking and authentication techniques. The results show that the proposed scheme enhances security by detecting the sinkhole attacker node before the attack is even activated. In addition, the proposed method ensures the integrity and authenticity of the sensed data while transmitting them from the sensor node until receiving it in the base station, and it can detect any tampering of the data.

/pdf/efficient-and-secure-data-transmission-and-sinkhole-2nty5zx0no.pdf

Efficient and Secure Data Transmission and Sinkhole Detection in a Multi-Clustering Wireless Sensor Network Based on Homomorphic Encryption and Watermarking

Wireless sensor networks (WSNs) are increasingly gaining popularity, especially with the advent of many artificial intelligence (AI) driven applications and expert systems. Such applications require specific relevant sensors’ data to be stored, processed, analyzed, and input to the expert systems. Obviously, sensor nodes (SNs) have limited energy and computation capabilities and are normally deployed remotely over an area of interest (AoI). Therefore, proposing efficient protocols for sensing and sending data is paramount to WSNs operation. Nodes’ clustering is a widely used technique in WSNs, where the sensor nodes are grouped into clusters. Each cluster has a cluster head (CH) that is used to gather captured data of sensor nodes and forward it to a remote sink node for further processing and decision-making. In this paper, an optimization algorithm for adjusting the CH location with respect to the nodes within the cluster is proposed. This algorithm aims at finding the optimal CH location that minimizes the total sum of the nodes’ path-loss incurred within the intra-cluster communication links between the sensor nodes and the CH. Once the optimal CH is identified, the CH moves to the optimal location. This suggestion of CH re-positioning is frequently repeated for new geometric position. Excitingly, the algorithm is extended to consider the inter-cluster communication between CH nodes belonging to different clusters and distributed over a spiral trajectory. These CH nodes form a multi-hop communication link that convey the captured data of the clusters’ nodes to the sink destination node. The performance of the proposed CH positioning algorithm for the single and multi-clusters has been evaluated and compared with other related studies. The results showed the effectiveness of the proposed CH positioning algorithm.

Optimal Cluster Head Positioning Algorithm for Wireless Sensor Networks.

Wireless sensor network (WSN) is one of the most standard selected services for the use of technical field, industrial applications, or in the market. WSN consists basically independent sensors that sense topographical area of implementation. In WSN, the independent nodes sense observe the area which is enclosing us such as observing, sensing of sound, vibration, temperature etc. WSN can transpose the information to the Base Station (BS) and perform different types of processing like data collection, data sensing, data processing and also used for find the best route between nodes and BS to transmit the data. These days, WSNs is being used in many areas like border security, battle field surveillance, motion tracking etc. The main issue associated with a WSN is to enhance its lifetime. Clustering is an approach to increase the network lifetime. H-LEACH is basically a hybrid clustering hierarchy for wireless sensor network. The nodes in H-LEACH get associated with CH in their respective zone. For the long distance CH guild with CH node. In this paper we use extended H-LEACH approach for clustering. In this approach the CH or zones are increased for reducing the distance between one CH to next CH or BS. The CH are selected one in every zone in rotatory using probability same as H-LEACH. When the re-clustering is done the result show minimum energy by normal node during before the transmission of information.

Optimized H-LEACH algorithm for clustering to improve lifetime of WSN

In the past few years, an evolution in the wireless communication has been emerged, along with the evolution a new type with large potential application of wireless network appears, which is the Mobile Ad-Hoc Network (MANET). Black hole attack consider one of the most affected kind on MANET. Therefore, the use of intrusion detection system (IDS) has a major importance in the MANET protection. In this paper, an optimization of a fuzzy based intrusion detection system is proposed which automate the process of producing a fuzzy system by using an Adaptive Neuro-Fuzzy Inference System (ANFIS) for the initialization of the FIS and then optimize this initialized system by using Genetic Algorithm (GA). In addition, a normal estimated fuzzy based IDS is introduces to see the effect of the optimization on the system. From this study, it is proven that the optimized proposed IDS perform better that the normal estimated systems.

https://www.ijcnis.org/index.php/ijcnis/article/download/2281/221

Black Hole attack Detection using fuzzy based IDS

Due to the positioning in hostile environment, wireless sensor networks (WSNs) are prone to various attacks. Hence, security is one of the most important issues in these networks. Therefore, detecting and preventing several kinds of attacks on WSNs is a popular subject in literature. However, handling these attacks on WSNs requires realistic modeling of these attacks since most of WSNs are application specific. In this paper, two kinds of serious attacks called the sinkhole and the black hole attack are modelled on the LEACH, which is a common clusterbased WSN. Three models are designed for these attacks and the results are evaluated under different performance metrics for different number of nodes. The results show that the black hole attack with a black hole region, which damages the network more than the other attacks, inclines 38% of the packets to be dropped.

A Realistic Modelling of the Sinkhole and the Black Hole Attacks in Cluster-Based WSNs

Major changes in Wireless sensor network (WSN) technology require producing multifunctional small sensing devices, which have low power consumption. On the purpose of high-quality sensing and error-free operation, solidarity and cooperation between sensor nodes are quite significant. Therefore, routing in WSN has become more of an issue. In this paper, a cluster based routing algorithm is designed for WSN. The proposed algorithm is compared with LEACH, which is often used in literature, by simulation method using OMNeT++. The results show that the number of packets that have arrived to the base station has increased by 31,1%, while the number of living nodes has increased by 20%. Even though, the increase in the total amount of energy dissipation is up to 22,5%, when the average energy for each packet that arrives to the base station is taken into consideration, a decrease up to 15,1% is obtained.

Improving the LEACH protocol on Wireless sensor network

This study proposes a robust, low cost, real-time optical mark recognition OMR system that uses a webcam and a small OMR form to read hand-marked data from plain paper. The system is designed to read data from any user-designed OMR form which can be customized for any purpose. It was implemented and tested on examination papers to read students' numbers and their examination results automatically. Results and numbers on 87 out of 88 papers were correctly identified. It was tested under different lighting conditions and with different mark colors. The results indicate that the system is robust and reliable.

Webcam Based Real-Time Robust Optical Mark Recognition

Natural language processing is a branch of computer science that combines artificial intelligence with linguistics. It aims to analyze a language element such as writing or speaking with software and convert it into information. Considering that each language has its own grammatical rules and vocabulary diversity, the complexity of the studies in this field is somewhat understandable. For instance, Turkish is a very interesting language in many ways. Examples of this are agglutinative word structure, consonant/vowel harmony, a large number of productive derivational morphemes (practically infinite vocabulary), derivation and syntactic relations, a complex emphasis on vocabulary and phonological rules. In this study, the interesting features of Turkish in terms of natural language processing are mentioned. In addition, summary info about natural language processing techniques, systems and various sources developed for Turkish are given.

/pdf/challenges-encountered-in-turkish-natural-language-3uvvkek2fi.pdf

Challenges Encountered in Turkish Natural Language Processing Studies

In wireless sensor networks, besides the way and mode the nodes are communicating each other, the location of the base stations has an important effect on the energy efficiency and longevity of the network and as a result the increase of the number of packages. A new dynamic base station positioning algorithm, which incorporates the location as well as the energy of the cluster heads within the network, has been proposed in this study and the performance of this algorithm was investigated in detail on clustering algorithms such as K-means and K-medoid as well as the HEED hierarchical protocol by using various parameters of wireless sensor networks. As a result of the simulation, the lifetime performance of the network has been increased up to 124.2 %, the number of packages reached the base station has been increased up to of 277.52 % via the utilization of dynamic base station in comparison to fixed base station positioning.

Kadir Tohma

Papers

A Realistic Modelling of the Sinkhole and the Black Hole Attacks in Cluster-Based WSNs

Improving the LEACH protocol on Wireless sensor network

Webcam Based Real-Time Robust Optical Mark Recognition

Challenges Encountered in Turkish Natural Language Processing Studies

A new cluster head based dynamic base station positioning for wireless sensor networks