Wireless sensor network

Open Access Article

1 - An Efficient Approach to Detect Faulty Readings: Applicability in Long-Thin Wireless Sensor Networks
Seyyed Jalaleddin Dastgheib

Wireless sensor networks (WSN) are composed of thousands small nodes (sensors), which work together and are associated with specific tasks to do. A long-thin network topology of wireless sensor can produce errors in network localization due to special deployment of node More

Wireless sensor networks (WSN) are composed of thousands small nodes (sensors), which work together and are associated with specific tasks to do. A long-thin network topology of wireless sensor can produce errors in network localization due to special deployment of nodes also, In this structure, failure of some close together nodes may pull some parts of network into isolation, or in a worse case the entire network may stop working.. In this paper, we propose an optimized algorithm to detect faulty readings using Debraj de localization error detection algorithm. The proposed algorithm uses correlation of average readings of two nodes to detect nodes with faulty readings. This algorithm reduces computational complexity of the correlation algorithm and has high accuracy. Manuscript profile

Open Access Article

2 - Wireless Sensor Network Based Vehicle Tracking System
Ali Pourghaffari

In this paper, a wireless sensor network based vehicle tracking system with its hardware and software components is introduced. In this system, the mica2 sensor node and MTS310 sensing board of Crossbow company products are used. In this system a GPS based localization More

In this paper, a wireless sensor network based vehicle tracking system with its hardware and software components is introduced. In this system, the mica2 sensor node and MTS310 sensing board of Crossbow company products are used. In this system a GPS based localization is used and its purpose is to track passing vehicles. Performance of this system, as a pilot system in laboratory scale is approved in practical tests with different vehicles. Sensor nodes in this system, track passing around vehicles and report it to the base station. The tinyOS operating system is used for sensor nodes in this system and application program codes are written with NesC language, an open source language suitable for sensor network nodes the same as tinyOS. NesC language in syntax is much like C. Manuscript profile

Open Access Article

3 - Energy-efficient and Privacy preserving Data Aggreration in wireless sensor networks
zahra zare

Energy consumption is ranked among the major problems of research in wireless sensor networks(WSNs). The main reason for nodes failure is the discharge of batteries in sensor networks. Therefore, energy consumption plays an important role in wireless sensor networks. Da More

Energy consumption is ranked among the major problems of research in wireless sensor networks(WSNs). The main reason for nodes failure is the discharge of batteries in sensor networks. Therefore, energy consumption plays an important role in wireless sensor networks. Data aggregation can greatly help to reduce this consumption by eliminating redundant data, and using clustering methods for data aggregation helps to further reduce energy consumption. Sensor nodes are prone to node compromise attacks which cause an adversary to change the aggregation result and inject false data into the WSN, hence security issues such as data confidentiality and integrity are extremely important. Because both data aggregation and security are critical for wireless sensor networks, achieving secure data aggregation that protects integrity is a critical issue. In this paper, we present a secure data aggregation method called Energy-Efficient and Privacy-Preserving Data Aggregation using our clustering algorithm which is an improvement on LEACH protocol and Homomorphic Encryption technique. Manuscript profile

Open Access Article

4 - Increasing the value of collected data and reducing energy consumption by using network coding and mobile sinks in wireless sensor networks
ehsan kharati

The wireless sensor network includes a number of fixed sensor nodes that move sink nodes to collect data between nodes. To reduce energy consumption and increase the value of collected data, it is necessary to determine the optimum route and residence location of mobile More

The wireless sensor network includes a number of fixed sensor nodes that move sink nodes to collect data between nodes. To reduce energy consumption and increase the value of collected data, it is necessary to determine the optimum route and residence location of mobile sinks, which increases the life of wireless sensor networks. Using network coding, this paper presents a Mixed Integer Linear Programming Model to determine the optimal multicast routing of source sensor nodes to mobile sinks in wireless sensor networks, which determines the time and location of sinks to collect maximum coded data and reduces the delay in sink movement and energy consumption. Solving this problem in polynomial time is not possible due to the involvement of various parameters and the constrained resources of wireless sensor networks. Therefore, several exploratory and greedy and fully distributed algorithms are proposed to determine the movement of sinks and their residence location based on maximizing the value of coded data and the type of data dead time. By simulating, the optimal method and the use of coding and proposed algorithms, reduce the runtime and energy consumption and increase the value of collected data and network lifetime than non-coding methods. Manuscript profile

Open Access Article

5 - Improving imperialist competitive algorithm for solving the nodes placement problem in three-dimensional grid wireless sensor networks
Sayed Wafa Barkhoda Hemmat Sheikhi sudabeh mohammadi

One of the basic and important research fields in wireless sensor networks is how to place sensor nodes where by using minimum number of sensor nodes all target points are covered and all sensor nodes are connected to the sink. In this paper, a novel method based on imp More

One of the basic and important research fields in wireless sensor networks is how to place sensor nodes where by using minimum number of sensor nodes all target points are covered and all sensor nodes are connected to the sink. In this paper, a novel method based on imperialist competitive algorithm is used for solving the mentioned problem. In the proposed method, a colony can immigrate from a weak empire to more powerful empire. The idea of immigration is inspired from human society in which a human can emigrate from a country to another country. The network is supposed to be a three-dimensional grid network and the sensor nodes can be only placed at cross-points of the grids while the target points can be deployed at each point of three-dimensional space. The simulation results show that the proposed method uses fewer number of sensor nodes than other similar algorithms and has the less running time. Manuscript profile

Open Access Article

6 - Node to Node Watermarking in Wireless Sensor Networks for Authentication of Self Nodes
Hassan Farsi Seyed Morteza Nourian

10.7508/jist.2014.02.008

In order to solve some security issues in Wireless Sensor Networks (WSNs), node to node authentication method based on digital watermarking technique for verification of relative nodes is proposed. In the proposed method, some algorithms with low computational for gener More

In order to solve some security issues in Wireless Sensor Networks (WSNs), node to node authentication method based on digital watermarking technique for verification of relative nodes is proposed. In the proposed method, some algorithms with low computational for generation, embedding and detection of security ID are designed. The collected data packets by the nodes are marked using security ID. In the proposed method, header is used to mark the packets. Since the nature of the sensor networks is cooperative, using the head of the packets is proposed for authentication. Also using the marked head can prevent from sending and receiving fake data in the other nodes. Simulations have been performed in environments with imposing unrealistic data and having a probability from 1% to 10%. Comparing the proposed method with other methods shows that the proposed method in term of security, reducing traffic and increasing network lifetime is more effective. Manuscript profile

Open Access Article

7 - Coverage Improving with Energy Efficient in Wireless Sensor Networks
Amir Pakmehr Ali Ghaffari

10.7508/jist.2017.17.008

Wireless sensor networks (WSNs) are formed by numerous sensors nodes that are able to sense different environmental phenomena and to transfer the collected data to the sink. The coverage of a network is one of the main discussion and one of the parameters of service qua More

Wireless sensor networks (WSNs) are formed by numerous sensors nodes that are able to sense different environmental phenomena and to transfer the collected data to the sink. The coverage of a network is one of the main discussion and one of the parameters of service quality in WSNs. In most of the applications, the sensor nodes are scattered in the environment randomly that causes the density of the nodes to be high in some regions and low in some other regions. In this case, some regions are not covered with any nodes of the network that are called covering holes. Moreover, creating some regions with high density causes extra overlapping and consequently the consumption of energy increases in the network and life of the network decreases. The proposed approach causes an increase in life of the network and an increase in it through careful selection of the most appropriate approach as cluster head node and form clusters with a maximum length of two steps and selecting some nodes as redundancy nodes in order to cover the created holes in the network. The proposed scheme is simulated using MATLAB software. The function of the suggested approach will be compared with Learning Automata based Energy Efficient Coverage protocol (LAEEC) approach either. Simulation results shows that the function of the suggested approach is better than LAEEC considering the parameters such as average of the active nodes, average remaining energy in nodes, percent of network coverage and number of control packets. Manuscript profile

Open Access Article

8 - Data Aggregation Tree Structure in Wireless Sensor Networks Using Cuckoo Optimization Algorithm
Elham Mohsenifard Behnam Talebi

10.7508/jist.2016.03.006

Wireless sensor networks (WSNs) consist of numerous tiny sensors which can be regarded as a robust tool for collecting and aggregating data in different data environments. The energy of these small sensors is supplied by a battery with limited power which cannot be rech More

Wireless sensor networks (WSNs) consist of numerous tiny sensors which can be regarded as a robust tool for collecting and aggregating data in different data environments. The energy of these small sensors is supplied by a battery with limited power which cannot be recharged. Certain approaches are needed so that the power of the sensors can be efficiently and optimally utilized. One of the notable approaches for reducing energy consumption in WSNs is to decrease the number of packets to be transmitted in the network. Using data aggregation method, the mass of data which should be transmitted can be remarkably reduced. One of the related methods in this approach is the data aggregation tree. However, it should be noted that finding the optimization tree for data aggregation in networks with one working-station is an NP-Hard problem. In this paper, using cuckoo optimization algorithm (COA), a data aggregation tree was proposed which can optimize energy consumption in the network. The proposed method in this study was compared with genetic algorithm (GA), Power Efficient Data gathering and Aggregation Protocol- Power Aware (PEDAPPA) and energy efficient spanning tree (EESR). The results of simulations which were conducted in matlab indicated that the proposed method had better performance than GA, PEDAPPA and EESR algorithm in terms of energy consumption. Consequently, the proposed method was able to enhance network lifetime. Manuscript profile

Open Access Article

9 - Crisis management using spatial query processing in wireless sensor networks
mohammad shakeri seyyed majid mazinani

10.7508/jist.2017.18.004

Natural disasters are an inevitable part of the world that we inhabit. Human casualties and financial losses are concomitants of these natural disasters. However, by an efficient crisis management program, we can minimize their physical and social damages. The real chal More

Natural disasters are an inevitable part of the world that we inhabit. Human casualties and financial losses are concomitants of these natural disasters. However, by an efficient crisis management program, we can minimize their physical and social damages. The real challenge in crisis management is the inability to timely receive the information from the stricken areas. Technology has come to the aid of crisis management programs to help find an answer to the problem. One of these technologies is wireless sensor network. With recent advances in this field, sensor nodes can independently respond to the queries from the users. This has transformed the processing of the queries into one of the most useful chapters in sensor networks. Without requiring any infrastructure, the sensor network can easily be deployed in the stricken area. And with the help of spatial query processing, it can easily provide managers with the latest information. The main problem, however, is the irregular shape of the area. Since these areas require many points to present them, the transmission of the coordinates by sensor nodes necessitates an increase in the number of data packet transmissions in the sensor network. The high number of packets considerably increases energy consumption. In related previous works, to solve this problem, line simplification algorithm s, such as Ramer-Douglas-Peucker (RDP), were used. These algorithms could lessen energy consumption by reducing the number of points in the shape of the area. In this article, we present a new algorithm to simplify packet shapes which can reduce more points with more accuracy. This results in decreasing the number of transmitted packets in the network, the concomitant reduction of energy consumption, and, finally, increasing network lifetime. Our proposed method was implemented in different scenarios and could on average reduce network’s energy consumption by 72.3%, while it caused only 4.5% carelessness which, when compared to previous methods, showed a far better performance. Manuscript profile

Open Access Article

10 - Security Enhancement of Wireless Sensor Networks: A Hybrid Efficient Encryption Algorithm Approach
Omid Mahdi Ebadati Farshad Eshghi Amin Zamani

10.7508/jist.2018.03.007

Wireless sensor networks are new technologies that are used for various purposes such as environmental monitoring, home security, industrial process monitoring, healthcare programs and etc. Wireless sensor networks are vulnerable to various attacks. Cryptography is one More

Wireless sensor networks are new technologies that are used for various purposes such as environmental monitoring, home security, industrial process monitoring, healthcare programs and etc. Wireless sensor networks are vulnerable to various attacks. Cryptography is one of the methods for secure transmission of information between sensors in wireless sensor networks. A complete and secure encryption system must establish three principles of confidentiality, authentication and integrity. An encryption algorithm alone cannot provide all the principles of encryption. A hybrid encryption algorithm, consisting of symmetric and asymmetric encryption algorithms, provides complete security for a cryptographic system. The papers presented in this area over the last few years, and a new secure algorithm present with regard to the limitations of wireless sensor networks, which establishes three principles of cryptography. The details of the algorithm and basic concepts are presented in such a way that the algorithm can be operational and showed a very high efficiency in compare to the current proposed methods. Manuscript profile

Open Access Article

11 - Using Residual Design for Key Management in Hierarchical Wireless Sensor Networks
Vahid Modiri Hamid Haj Seyyed Javadi Amir Masoud Rahmani Mohaddese Anzani

10.7508/jist.2020.01.006

Combinatorial designs are powerful structures for key management in wireless sensor networks to address good connectivity and also security against external attacks in large scale networks. Many researchers have used key pre-distribution schemes using combinatorial stru More

Combinatorial designs are powerful structures for key management in wireless sensor networks to address good connectivity and also security against external attacks in large scale networks. Many researchers have used key pre-distribution schemes using combinatorial structures in which key-rings, are pre-distributed to each sensor node before deployment in a real environment. Regarding the restricted resources, key distribution is a great engagement and challenging issue in providing sufficient security in wireless sensor networks. To provide secure communication, a unique key should be found from their stored key-rings. Most of the key pre-distribution protocols based on public-key mechanisms could not support highly scalable networks due to their key storage overhead and communication cost that linearly increasing. In this paper, we introduce a new key distribution approach for hierarchical clustered wireless sensor networks. Each cluster has a construction that contains new points or that reinforces and builds upon similar ideas of their head clusters. Based on Residual Design as a powerful algebraic combinatorial architecture and hierarchical network model, our approach guarantees good connectivity between sensor nodes and also cluster heads. Compared with similar existing schemes, our approach can provide sufficient security no matter if the cluster head or normal sensor node is compromised Manuscript profile

Open Access Article

12 - Energy Efficient Clustering Algorithm for Wireless Sensor Networks
Maryam Bavaghar Amin Mohajer Sarah Taghavi Motlagh

10.7508/jist.2019.04.001

In Wireless Sensor Networks (WSNs), sensor nodes are usually deployed with limited energy reserves in remote environments for a long period of time with less or no human intervention. It makes energy efficiency as a challenging issue both for the design and deployment o More

In Wireless Sensor Networks (WSNs), sensor nodes are usually deployed with limited energy reserves in remote environments for a long period of time with less or no human intervention. It makes energy efficiency as a challenging issue both for the design and deployment of sensor networks. This paper presents a novel approach named Energy Efficient Clustering Algorithm (EECA) for Wireless Sensor Networks which is based on two phases clustering model and provides maximum network coverage in an energy efficient way. In this framework, an effective resource-aware load balancing approach applied for autonomous methods of configuring the parameters in accordance with the signaling patterns in which approximately the same bit rate data is provided for each sensor. This resource-efficient clustering model can also form energy balanced clusters which results in increasing network life time and ensuring better network coverage. Simulation results prove that EECA is better than LEACH, LEA2C and EECS with respect to network lifetime and at the same time achieving more network coverage. In addition to obtained an optimal cluster size with minimum energy loss, the proposed approach also suggests new and better way for selecting cluster heads to reduce energy consumption of the distributed nodes resulting in increased operational reliability of sensor networks. Manuscript profile

Open Access Article

13 - Energy Efficient Cross Layer MAC Protocol for Wireless Sensor Networks in Remote Area Monitoring Applications
R Rathna L Mary Gladence J Sybi Cynthia V Maria Anu

10.52547/jist.9.35.207

Sensor nodes are typically less mobile, much limited in capabilities, and more densely deployed than the traditional wired networks as well as mobile ad-hoc networks. General Wireless Sensor Networks (WSNs) are designed with electro-mechanical sensors through wireless d More

Sensor nodes are typically less mobile, much limited in capabilities, and more densely deployed than the traditional wired networks as well as mobile ad-hoc networks. General Wireless Sensor Networks (WSNs) are designed with electro-mechanical sensors through wireless data communication. Nowadays the WSN has become ubiquitous. WSN is used in combination with Internet of Things and in many Big Data applications, it is used in the lower layer for data collection. It is deployed in combination with several high end networks. All the higher layer networks and application layer services depend on the low level WSN in the deployment site. So to achieve energy efficiency in the overall network some simplification strategies have to be carried out not only in the Medium Access Control (MAC) layer but also in the network and transport layers. An energy efficient algorithm for scheduling and clustering is proposed and described in detail. The proposed methodology clusters the nodes using a traditional yet simplified approach of hierarchically sorting the sensor nodes. Few important works on cross layer protocols for WSNs are reviewed and an attempt to modify their pattern has also been presented in this paper with results. Comparison with few prominent protocols in this domain has also been made. As a result of the comparison one would get a basic idea of using which type of scheduling algorithm for which type of monitoring applications. Manuscript profile

Open Access Article

14 - Confronting DDoS Attacks in Software-Defined Wireless Sensor Networks based on Evidence Theory
Nazbanoo Farzaneh Reyhaneh Hoseini

10.52547/jist.9.33.25

DDoS attacks aim at making the authorized users unable to access the network resources. In the present paper, an evidence theory based security method has been proposed to confront DDoS attacks in software-defined wireless sensor networks. The security model, as a secur More

DDoS attacks aim at making the authorized users unable to access the network resources. In the present paper, an evidence theory based security method has been proposed to confront DDoS attacks in software-defined wireless sensor networks. The security model, as a security unit, is placed on the control plane of the software-defined wireless sensor network aiming at detecting the suspicious traffic. The main purpose of this paper is detection of the DDoS attack using the central controller of the software-defined network and entropy approach as an effective light-weight and quick solution in the early stages of the detection and, also, Dempster-Shafer theory in order to do a more exact detection with longer time. Evaluation of the attacks including integration of data from the evidence obtained using Dempster-Shafer and entropy modules has been done with the purpose of increasing the rate of detection of the DDoS attack, maximizing the true positive, decreasing the false negative, and confronting the attack. The results of the paper show that providing a security unit on the control plane in a software-defined wireless sensor network is an efficient method for detecting and evaluating the probability of DDoS attacks and increasing the rate of detection of an attacker. Manuscript profile

Open Access Article

15 - Sailor Localization in Oceans Beds using Genetic and Firefly Algorithm
Shruti Gupta Dr Ajay Rana Vineet Kansal

10.29252/jist.8.31.175

The Localization is the core element in Wireless Sensor Network WSN, especially for those nodes without GPS or BDS; leaning towards improvement, based on its effective and increased use in the past decade. Localization methods are thus very important for estimating the More

The Localization is the core element in Wireless Sensor Network WSN, especially for those nodes without GPS or BDS; leaning towards improvement, based on its effective and increased use in the past decade. Localization methods are thus very important for estimating the position of relative nodes in the network allowing a better and effective network for increasing the efficiency and thus increasing the lifeline of the network. Determining the current limitations in FA that are applied for solving different optimization problems is poor exploitation capability when the randomization factor is taken large during firefly changing position. This poor exploitation may lead to skip the most optimal solution even present in the vicinity of the current solution which results in poor local convergence rate that ultimately degrades the solution quality. This paper presents GEFIR (GenFire) algorithm to calculate position of unknown nodes for the fishermen in the ocean. The proposed approach calculates the position of unknown nodes, the proposed method effectively selects the anchor node in the cluster head to reduce the energy dissipation. Major benefits over other similar localization algorithms are a better positioning of nodes is provided and average localization error is reduced which eventually leads to better efficiency thus optimize the lifetime of the network for sailors. The obtained results depict that the proposed model surpasses the previous generation of localization algorithm in terms of energy dispersion and location estimation which is suitable for fishermen on the ocean bed. Manuscript profile

Open Access Article

16 - Training and Learning Swarm Intelligence Algorithm (TLSIA) for Selecting the Optimal Cluster Head in Wireless Sensor Networks
Ali Sedighimanesh Hessam Zandhessami Mahmood Alborzi mohammadsadegh Khayyatian

10.52547/jist.15638.10.37.37

Background: Wireless sensor networks include a set of non-rechargeable sensor nodes that interact for particular purposes. Since the sensors are non-rechargeable, one of the most important challenges of the wireless sensor network is the optimal use of the energy of sen More

Background: Wireless sensor networks include a set of non-rechargeable sensor nodes that interact for particular purposes. Since the sensors are non-rechargeable, one of the most important challenges of the wireless sensor network is the optimal use of the energy of sensors. The selection of the appropriate cluster heads for clustering and hierarchical routing is effective in enhancing the performance and reducing the energy consumption of sensors. Aim: Clustering sensors in different groups is one way to reduce the energy consumption of sensor nodes. In the clustering process, selecting the appropriate sensor nodes for clustering plays an important role in clustering. The use of multistep routes to transmit the data collected by the cluster heads also has a key role in the cluster head energy consumption. Multistep routing uses less energy to send information. Methods: In this paper, after distributing the sensor nodes in the environment, we use a Teaching-Learning-Based Optimization (TLBO) algorithm to select the appropriate cluster heads from the existing sensor nodes. The teaching-learning philosophy has been inspired by a classroom and imitates the effect of a teacher on learner output. After collecting the data of each cluster to send the information to the sink, the cluster heads use the Tabu Search (TS) algorithm and determine the subsequent step for the transmission of information. Findings: The simulation results indicate that the protocol proposed in this research (TLSIA) has a higher last node dead than the LEACH algorithm by 75%, ASLPR algorithm by 25%, and COARP algorithm by 10%. Conclusion: Given the limited energy of the sensors and the non-rechargeability of the batteries, the use of swarm intelligence algorithms in WSNs can decrease the energy consumption of sensor nodes and, eventually, increase the WSN lifetime. Manuscript profile

Open Access Article

17 - Cluster-based Coverage Scheme for Wireless Sensor Networks using Learning Automata
Ali Ghaffari Seyyed Keyvan Mousavi

10.52547/jist.9.35.197

Network coverage is one of the most important challenges in wireless sensor networks (WSNs). In a WSN, each sensor node has a sensing area coverage based on its sensing range. In most applications, sensor nodes are randomly deployed in the environment which causes the d More

Network coverage is one of the most important challenges in wireless sensor networks (WSNs). In a WSN, each sensor node has a sensing area coverage based on its sensing range. In most applications, sensor nodes are randomly deployed in the environment which causes the density of nodes become high in some areas and low in some other. In this case, some areas are not covered by none of sensor nodes which these areas are called coverage holes. Also, creating areas with high density leads to redundant overlapping and as a result the network lifetime decreases. In this paper, a cluster-based scheme for the coverage problem of WSNs using learning automata is proposed. In the proposed scheme, each node creates the action and probability vectors of learning automata for itself and its neighbors, then determines the status of itself and all its neighbors and finally sends them to the cluster head (CH). Afterward, each CH starts to reward or penalize the vectors and sends the results to the sender for updating purposes. Thereafter, among the sent vectors, the CH node selects the best action vector and broadcasts it in the form of a message inside the cluster. Finally, each member changes its status in accordance with the vector included in the received message from the corresponding CH and the active sensor nodes perform environment monitoring operations. The simulation results show that the proposed scheme improves the network coverage and the energy consumption. Manuscript profile

Open Access Article

18 - Secure Key Management Scheme for Hierarchical Network Using Combinatorial Design
Siddiq Iqbal B R Sujatha

10.52547/jist.15691.10.37.20

The wireless sensor network (WSN) signifies to a gathering of spatially spread and committed sensors for observing and logging the physical states of the environment and for organizing the information gathered at the central Base station. Many security threats may affec More

The wireless sensor network (WSN) signifies to a gathering of spatially spread and committed sensors for observing and logging the physical states of the environment and for organizing the information gathered at the central Base station. Many security threats may affect the functioning of these networks. Security of the data in the system depends on the cryptographic procedure and the methods where encryption and decryption keys are developed among the sensors. Symmetric key foundation is one of the best applicable ideal models for safe exchanges in WSNs. The main goal is to improve and evaluate certain issues, such as node attack, to provide better key strength, connectivity, security for node interaction, and throughput. Uniform Balanced Incomplete Block Design (UBIBD) is used to generate the keys allocated by the base station to the cluster head. The cluster head distributes keys to its members using Symmetric Balanced Incomplete Block Design (SBIBD), and the keys are refreshed on a regular basis to avoid out-of-date entries. In wireless sensor networks, compromised nodes can be used to inject false reports. The concept of interacting between sensor nodes using keys and establishing a secure connection aids in ensuring the network's security. Manuscript profile

Open Access Article

19 - A Hybrid Approach based on PSO and Boosting Technique for Data Modeling in Sensor Networks
hadi shakibian Jalaledin Nasiri

10.52547/jist.19789.10.40.259

An efficient data aggregation approach in wireless sensor networks (WSNs) is to abstract the network data into a model. In this regard, regression modeling has been addressed in many studies recently. If the limited characteristics of the sensor nodes are omitted from c More

An efficient data aggregation approach in wireless sensor networks (WSNs) is to abstract the network data into a model. In this regard, regression modeling has been addressed in many studies recently. If the limited characteristics of the sensor nodes are omitted from consideration, a common regression technique could be employed after transmitting all the network data from the sensor nodes to the fusion center. However, it is not practical nor efferent. To overcome this issue, several distributed methods have been proposed in WSNs where the regression problem has been formulated as an optimization based data modeling problem. Although they are more energy efficient than the centralized method, the latency and prediction accuracy needs to be improved even further. In this paper, a new approach is proposed based on the particle swarm optimization (PSO) algorithm. Assuming a clustered network, firstly, the PSO algorithm is employed asynchronously to learn the network model of each cluster. In this step, every cluster model is learnt based on the size and data pattern of the cluster. Afterwards, the boosting technique is applied to achieve a better accuracy. The experimental results show that the proposed asynchronous distributed PSO brings up to 48% reduction in energy consumption. Moreover, the boosted model improves the prediction accuracy about 9% on the average. Manuscript profile

Open Access Article

20 - Dynamic Tree- Based Routing: Applied in Wireless Sensor Network and IOT
Mehdi Khazaei

10.52547/jist.22504.10.39.191

The Internet of Things (IOT) has advanced in parallel with the wireless sensor network (WSN) and the WSN is an IOT empowerment. The IOT, through the internet provides the connection between the defined objects in apprehending and supervising the environment. In some app More

The Internet of Things (IOT) has advanced in parallel with the wireless sensor network (WSN) and the WSN is an IOT empowerment. The IOT, through the internet provides the connection between the defined objects in apprehending and supervising the environment. In some applications, the IOT is converted into WSN with the same descriptions and limitations. Working with WSN is limited to energy, memory and computational ability of the sensor nodes. This makes the energy consumption to be wise if protection of network reliability is sought. The newly developed and effective hierarchical and clustering techniques are to overcome these limitations. The method proposed in this article, regarding energy consumption reduction is tree-based hierarchical technique, used clustering based on dynamic structure. In this method, the location-based and time-based properties of the sensor nodes are applied leading to provision of a greedy method as to form the subtree leaves. The rest of the tree structure up to the root, would be formed by applying the centrality concept in the network theory by the base station. The simulation reveals that the scalability and fairness parameter in energy consumption compare to the similar method has improved, thus, prolonged network lifetime and reliability. Manuscript profile

Open Access Article

21 - Cache Point Selection and Transmissions Reduction using LSTM Neural Network
Malihe Bahekmat Mohammad Hossein Yaghmaee Moghaddam

10.52547/jist.27279.11.42.123

Reliability of data transmission in wireless sensor networks (WSN) is very important in the case of high lost packet rate due to link problems or buffer congestion. In this regard, mechanisms such as middle cache points and congestion control can improve the performance More

Reliability of data transmission in wireless sensor networks (WSN) is very important in the case of high lost packet rate due to link problems or buffer congestion. In this regard, mechanisms such as middle cache points and congestion control can improve the performance of the reliability of transmission protocols when the packet is lost. On the other hand, the issue of energy consumption in this type of networks has become an important parameter in their reliability. In this paper, considering the energy constraints in the sensor nodes and the direct relationship between energy consumption and the number of transmissions made by the nodes, the system tries to reduce the number of transmissions needed to send a packet from source to destination as much as possible by optimal selection of the cache points and packet caching. In order to select the best cache points, the information extracted from the network behavior analysis by deep learning algorithm has been used. In the training phase, long-short term memory (LSTM) capabilities as an example of recurrent neural network (RNN) deep learning networks to learn network conditions. The results show that the proposed method works better in examining the evaluation criteria of transmission costs, end-to-end delays, cache use and throughput. Manuscript profile

Open Access Article

22 - Simplify Programming of TinyOS Applications for Wireless Sensor Networks
M. Khezri M. Sarram F. Adibnia

Sensor node operating system provides a limited number of common services for developers to construct applications for wireless sensor networks. The sensor network community selected TinyOS as the de facto standard with most existing applications, libraries and device d More

Sensor node operating system provides a limited number of common services for developers to construct applications for wireless sensor networks. The sensor network community selected TinyOS as the de facto standard with most existing applications, libraries and device drivers available for TinyOS. The programming model of TinyOS is event-based and is not easy to use. In this paper, we present a new task scheduler for TinyOS that includes a new computation concept, named Job. Jobs are a collaborative and non-preemptive way of multitasking. On the next step, we propose a programming model which combines the asynchronous basis of event-driven systems with a more classical programming interface for the developer. As a result, developer that uses such an interface in his application will be provided with the sequential view we wanted. This programming model is suitable for applications that have long running computations and there is a data flow dependency between different tasks. Manuscript profile

Open Access Article

23 - A Comprehensive Method to Secure Time Synchronization in Wireless Sensor
Z. Ahmadi

One of the important requirements of sensor networks is synchronization of the nodes. The importance of time in sensor networks causes the adversary tries to disturb time synchronization by altering and faking messages, delaying or replying them, compromising the nodes More

One of the important requirements of sensor networks is synchronization of the nodes. The importance of time in sensor networks causes the adversary tries to disturb time synchronization by altering and faking messages, delaying or replying them, compromising the nodes and sending false messages via them. Up to now, there is no method that is able to provide both synchronization and security needs of sensor networks simultaneously. In this paper, we suggest a method that is capable to provide precise synchronization, along with low communication and computational overhead, low convergence time and high security against internal and external attacks. Simulation and analytic results show the preference of our method compared to other available methods. Manuscript profile

Open Access Article

24 - Topology Control in Wireless Sensor Networks Using Two-Level Fuzzy Logic
A. Abdi Seyedkolaei A. Zakerolhosseini

Wireless sensor networks are a new generation of networks that from sensors uses to get information about itself environment and communication this sensors is as wireless. One of the issues that is very important in wireless sensor networks is Discussion reducing energy More

Wireless sensor networks are a new generation of networks that from sensors uses to get information about itself environment and communication this sensors is as wireless. One of the issues that is very important in wireless sensor networks is Discussion reducing energy consumption and increasing network lifetime. Topology control is one of the methods to reduce energy consumption and increase the lifetime of the network. Since different methods of topology control, to reduce energy consumption and enhance the network lifetime is proposed that including them is the clustering and one of the most famous clustering methods is LEACH. In this paper, we try to present a new clustering method that is superior compared to leach and other improved methods after the LEACH. we use in our clustering method from two-level fuzzy logic that be causing reduce energy consumption and increase the network lifetime compared to other methods and to prove the superiority of our method compared with other methods, we present a comparison using MATLAB software. Manuscript profile

Open Access Article

25 - PLAER: Penalty Base Learning Automata for Energy Aware Routing in WSN
M. Parvizi Omran A. Moeni H. Haj Seyyed Javadi

Sensors in WSN work with batteries that have limited energy capacity. Therefore, reduction in power consumption is a very important issue. In this paper, we present a new routing algorithm to reduce power consumption in wireless sensor networks. This algorithm deploys L More

Sensors in WSN work with batteries that have limited energy capacity. Therefore, reduction in power consumption is a very important issue. In this paper, we present a new routing algorithm to reduce power consumption in wireless sensor networks. This algorithm deploys Learning automata in each node to find a suitable path for routing data packets. In order to aim this goal the algorithm uses penalty based approach in learning automata and considers energy level of nodes and latency of packet delivery as well. Performance of our new developed algorithm has been compared with LABER and BEAR protocols in OMNET++ simulator. Simulation results show that, in a network with static nodes, energy consumption and control packets reduce significantly and network lifetime increases in comparison with two other protocols. Manuscript profile

Open Access Article

26 - A Goal-Based Approach for the Holonification of Holonic Multi-Agent Systems
Ahmad Esmaeili N. Mozayani M. R. Jahed Motlagh

Holonic structures are a hierarchical formation of holons that are developed and used for the purpose of restricting interaction domains, reducing uncertainty, or forming the high level goals of multi-agent systems, in such a way that the system benefits a high degree o More

Holonic structures are a hierarchical formation of holons that are developed and used for the purpose of restricting interaction domains, reducing uncertainty, or forming the high level goals of multi-agent systems, in such a way that the system benefits a high degree of flexibility and dynamism in response to environmental changes. Although the holonic multi-agent systems are extensively used in modeling and solving complex problems, most of its prerequisites, like forming the body holons and dynamically controlling its structure, use very simple application-specific models. This is due to the immaturity of the research literatures in this field. In this article, an endeavor is made to propose a goal-based approach for the formation of holonic structures, using the concepts in social science and organizational theory. The use of concepts like role, skill, and goal structures, makes the proposed method possible to be used in wide range of applications. In order to demonstrate the capabilities of the method and also the way it can be applied in real world problems, a test bed based on the application of wireless sensor networks in object tracking is designed and presented. In this application, the sensors, which are distributed in the environment as simple agents, using holonic structures, are responsible for the track of any alien objects that enter and move in the environment. According to the empirical results of the simulations, the proposed holonic approach has provided successful performance in terms of tracking quality and energy consumption of the sensors. Manuscript profile

Open Access Article

27 - A Novel Energy-Efficient Algorithm to Enhance Load Balancing and Lifetime of Wireless Sensor Networks
S. Abbasi-Daresari J. Abouei

Wireless senor networks (WSNs) are widely used for the monitoring purposes. One of the most challenges in designing these networks is minimizing the data transmission cost with accurate data recovery. Data aggregation using the theory of compressive sampling is an effec More

Wireless senor networks (WSNs) are widely used for the monitoring purposes. One of the most challenges in designing these networks is minimizing the data transmission cost with accurate data recovery. Data aggregation using the theory of compressive sampling is an effective way to reduce the cost of communication in the sink node. The existing data aggregation methods based on compressive sampling require to a large number of nodes for each measurement sample leading to inefficient energy consumption in wireless sensor network. To solve this problem, we propose a new scheme by using sparse random measurement matrix. In this scheme, the formation of routing trees with low cost and fair distribution of load on the network significantly reduces energy consumption. Toward this goal, a new algorithm called “weighted compressive data gathering (WCDG)” is suggested in which by creating weighted routing trees and using the compressive sampling, the data belong to all of nodes of each path is aggregated and then, sent to the sink node. Considering the power control ability in sensor nodes, efficient paths are selected in this algorithm. Numerical results demonstrate the efficiency of the proposed algorithm with compared to the conventional data aggregation schemes in terms of energy consumption, load balancing, and network lifetime. Manuscript profile

Open Access Article

28 - EBONC: A New Energy-Aware Clustering Approach Based on Optimum Number of Clusters for Mobile Wireless Sensor Networks
N. Norouzy N. Norouzy M. Fazlali

The energy constraint is one of the key challenges in wireless sensor networks that directly affects the network lifetime. Clustering the sensor nodes is one of the possible approaches to improving the energy efficiency by uniformly distributing the energy consumption a More

The energy constraint is one of the key challenges in wireless sensor networks that directly affects the network lifetime. Clustering the sensor nodes is one of the possible approaches to improving the energy efficiency by uniformly distributing the energy consumption among the nodes. The number of appropriate clusters plays an important role in the network throughput. A Large number of clusters imply that packets pass more hops to reach the destination, which results in higher energy consumption. In this paper, we devise an energy and location aware clustering scheme that tries to optimize the number of required clusters. Moreover, the cluster heads are chosen according to their energy levels. The devised scheme partitions the network into concentric circles and calculates the appropriate number of clusters to provide an energy efficient network. A gossiping approach is used to provide information exchange mechanism. The performance of the devised approach is compared with ASH scheme. The simulation results show the network lifetime is improved from 25% to 40% in difference network scenarios. Manuscript profile

Open Access Article

29 - Optimization of Adaptive Design of Wireless Sensor Networks Using Binary Quantum-Inspired Gravitational Search Algorithm
M. Mirhosseini F. Barani H. Nezamabadi-pour

In this paper, the binary quantum-inspired gravitational search algorithm is adapted to dynamically optimize the design of a wireless sensor network towards improving energy consumption and extending the lifetime of the network, so that the application-specific requirem More

In this paper, the binary quantum-inspired gravitational search algorithm is adapted to dynamically optimize the design of a wireless sensor network towards improving energy consumption and extending the lifetime of the network, so that the application-specific requirements and communication constraints are fulfilled. The proposed approach is applied on a wireless sensor network used in the application of precise agriculture to monitor environmental conditions. This algorithm would present an optimal design detecting operational mode of each sensor including cluster head, high signal range, low signal range and inactive modes taking into consideration the constraints of the network. The simulation results indicate the most performance of the proposed method in comparison with binary genetic algorithm and particle swarm optimization. Manuscript profile

Open Access Article

30 - An Efficient Hybrid Routing Protocol in Underwater Wireless Sensor Networks
J. Tavakoli N. Moghim

Underwater Wireless Sensor Network (UWSN) is a kind of sensor networks that their operational fields have been developed under water in recent decades, although these networks deal with lots of challenges due to lack of the GPS1. These networks encounter researchers wit More

Underwater Wireless Sensor Network (UWSN) is a kind of sensor networks that their operational fields have been developed under water in recent decades, although these networks deal with lots of challenges due to lack of the GPS1. These networks encounter researchers with many challenges by some limitations like high propagation delay, low bandwidth, high bit error rate, movement, limited battery and memory. In comparison with terrestrial sensor networks, sensors in the UWSN consume energy more because they use acoustic technology to communicate. Motivation of this research is proposing a routing protocol for underwater systematic settings with a limited energy. The settled sensor nodes in underwater cannot communicate directly with nodes near surface, so they need prepared multi hop communications with a proper routing plan. In wireless sensor networks, node clustering is a common way to organize data traffic and to decrease intra-network communications along with scalability and load balance improvement plus reducing of overall energy consumption of system. Therefore, in this article a fuzzy clustering routing protocol with data aggregation and balanced energy consumption for UWSNs is proposed. Simulation results show that in the proposed protocol, energy consumption becomes more uniformly distributed in the network and average of the nodes' energy usage and number of routing packets decreases and finally, packet delivery ratio and throughput are improved in the network in comparison with DABC3 and IDACB4 algorithms. Manuscript profile

Open Access Article

31 - Introducing a Fog-Based Algorithm for Routing in Wireless Sensor Networks
E. Mirzavand Borujeni D. Rahbari M. Nickray

Wireless sensor networks (WSNs) consist of thousands of small nodes. The small and inexpensive parts of these nodes have led to their widespread use in various fields. However, these networks have constraints on energy consumption, processing resources, and storage whic More

Wireless sensor networks (WSNs) consist of thousands of small nodes. The small and inexpensive parts of these nodes have led to their widespread use in various fields. However, these networks have constraints on energy consumption, processing resources, and storage which have caused many studies to find solutions to reduce these constraints. In recent years, with the advent of the concept of Fog computing, many new and effective solutions are represented for routing in wireless sensor networks. Since in WSNs it is important to save alive nodes and reduce the energy consumption of nodes, fog computing is useful for this purpose. In most WSN routing protocols, the best way to send data to cluster heads and the base station is the major part of their studies. In the new protocols, the Fog computing have been used to find the best way. In these methods, we have seen decreasing energy consumption and increasing network lifetime. In this paper, we represent a fog-based algorithm for routing in WSNs. According to the simulation results, the proposed protocol improved energy consumption by 9% meanwhile the number of alive nodes is increased by 74%, compared to the reviewed method. Manuscript profile

Open Access Article

32 - An Improved Grid-Based K-Coverage Technique Using Probabilistic Sensing Model for Wireless Sensor Networks
Abdolreza Vaghefi Mahdi Mollamotalebi

Coverage of an area, with one or multiple sensors, is one of the fundamental challenges in wireless sensor networks. Since a sensor life span is limited and reliable data is of great importance, sensitive applications like fire\leakage alarm systems, intrusion detection More

Coverage of an area, with one or multiple sensors, is one of the fundamental challenges in wireless sensor networks. Since a sensor life span is limited and reliable data is of great importance, sensitive applications like fire\leakage alarm systems, intrusion detection, etc. need multiple sensors to cover the region of interest, which is called K-coverage. Most of the studies that have been carried out on K-coverage evaluation have used binary sensing model. In this paper, we propose a grid-based K-coverage evaluation technique using probabilistic sensing model to increase evaluation accuracy and decrease evaluation time. The proposed technique is implemented using NS-2 simulator, and its results are compared to probabilistic perimeter-based and binary grid-based techniques. The results indicate that the proposed technique improved accuracy by 14% and 24% compared to the mentioned techniques respectively. It also shows 7% decrease in evaluation time compared to probabilistic perimeter-based technique. Manuscript profile

Open Access Article

33 - A Lightweight Intrusion Detection System Based on Two-Level Trust for Wireless Sensor Networks
M. sadeghizade O. R. Marouzi

Wireless sensor networks (WSNs) are one of the useful and attractive technologies that have received much attention in recent years. These networks have been used in a variety of applications, due to their ease of use and inexpensive deployment. Due to the criticality o More

Wireless sensor networks (WSNs) are one of the useful and attractive technologies that have received much attention in recent years. These networks have been used in a variety of applications, due to their ease of use and inexpensive deployment. Due to the criticality of most applications of these networks, security is considered as one of the essential parameters of the quality of service (QoS), and thus Intrusion Detection System (IDS) is considered as a fundamental requirement for security in these networks. This paper provides a trust-based IDS to protect the WSN against all network layer and routing attacks based on the features extracted from them. Through simulations, the proposed IDS has been evaluated with all performance criteria. The results show that the proposed IDS, in comparison with existing works, which often focuses on a specific attack, covers all network layer and routing attacks in WSNs, and also, due to high detection accuracy, low false alarms rate, and low energy consumption is considered as a desirable and lightweight IDS for WSNs. Manuscript profile

Open Access Article

34 - Propose a New Clustering Algorithm for Data Transmission in Wireless Sensor Networks by Using Apollonius Circle
Sh. Pourbahrami E. Khaledi Alamdari L. Mohammad Khanli

Wireless sensor networks, as an up-to-date technology, are one of the fastest growing technologies in the world today. Since these networks are used in military and agricultural environments as well as for observation of inaccessible environments, these networks need to More

Wireless sensor networks, as an up-to-date technology, are one of the fastest growing technologies in the world today. Since these networks are used in military and agricultural environments as well as for observation of inaccessible environments, these networks need to be organized to achieve goals such as successful and timely sending of data to the main station. Clustering of wireless sensor networks is one of the most widely used methods for organizing these networks. Various ways to cluster these networks are provided, most of which are aimed at preventing energy loss and increasing the lifetime of sensor nodes. The thesis attempts to present a new geometric method for clustering the nodes of wireless sensor networks. In this geometric method, Apollonius circle is used to draw the abstract shape of the clusters and to assemble the nodes around the cluster head. Due to the high accuracy that it has in determining the fit of node distances, this circle can accurately assign nodes to cluster heads and prevent large single-node clusters or faraway nodes. In this algorithm, a main station, a number of nodes are used as a cluster header and a number of nodes as routers. The goal is to find the most accurate cluster heads and create clusters of high coverage in the network. The proposed method is implemented in MATLAB software and comparison of the results obtained from the view of successful data transmission, clustering accuracy, network lifetime and number of coverage areas, is showing accuracy of this method compared to optimal Leach algorithms and K-means presented in this field. Manuscript profile

Open Access Article

35 - An Adaptive Multi-Objective Clustering Algorithm based on Auction_Prediction for Mobile Target Tracking in Wireless Sensor Network
Roghieh Alinezhad Sepideh Adabi arash Sharifi

One of the applications of sensor networks is to track moving target. In designing the algorithm for target tracking two issues are of importance: reduction of energy consumption and improvement of the tracking quality. One of the solutions for reduction of energy consu More

One of the applications of sensor networks is to track moving target. In designing the algorithm for target tracking two issues are of importance: reduction of energy consumption and improvement of the tracking quality. One of the solutions for reduction of energy consumption is to form a tracking cluster. Two major challenges in formation of the tracking cluster are when and how it should be formed. To decrease the number of messages which are exchanged to form the tracking cluster an auction mechanism is adopted. The sensor’s bid in an auction is dynamically and independently determined with the aim of establishing an appropriate tradeoff between network lifetime and the accuracy of tracking. Furthermore, since the tracking cluster should be formed and activated before the target arrives to the concerned region (especially in high speed of target), avoidance from delay in formation of the tracking cluster is another challenge. Not addressing the mentioned challenge results in increased target missing rate and consequently energy loss. To overcome this challenge, it is proposed to predict the target’s position in the next two steps by using neural network and then, simultaneously form the tracking clusters in the next one and two steps. The results obtained from simulation indicate that the proposed algorithm outperforms AASA (Auction-based Adaptive Sensor Activation). Manuscript profile

Open Access Article

36 - Optimal Resource Allocation in Multi-Task Software-Defined Sensor Networks
S. A. Mostafavi M. Agha Sarram T. Salimian

Unlike conventional wireless sensor networks which are designed for a specific application, Software-Defined Wireless Sensor Networks (SDSN) can embed multiple sensors on each node, defining multiple tasks simultaneously. Each sensor node has a virtualization program wh More

Unlike conventional wireless sensor networks which are designed for a specific application, Software-Defined Wireless Sensor Networks (SDSN) can embed multiple sensors on each node, defining multiple tasks simultaneously. Each sensor node has a virtualization program which serves as a common communication infrastructure for several different applications. Different sensor applications in the network can have different target functions and decision parameters. Due to the resource constraints of sensor network nodes, the multiplicity and variety of tasks in each application, requirements for different levels of quality of service, and the different target functions for different applications, the problem of allocating resources to the tasks on the sensors is complicated. In this paper, we formulate the problem of allocating resources to the sensors in the SDSN with different objective functions as a multi-objective optimization problem and provide an effective solution to solve it. Manuscript profile

Open Access Article

37 - DRSS-Based Localization Using Convex Optimization in Wireless Sensor Networks
Hassan Nazari M. R. Danaee M. Sepahvand

Localization with differential received signal strength measurement in recent years has been very much considered. Due to the fact that the probability density function is known for given observations, the maximum likelihood estimator is used. This estimator can be asym More

Localization with differential received signal strength measurement in recent years has been very much considered. Due to the fact that the probability density function is known for given observations, the maximum likelihood estimator is used. This estimator can be asymptotically represented the optimal estimation of the location. After the formation of this estimator, it is observed that the corresponding cost function is highly nonlinear and non-convex and has a lot of minima, so there is no possibility of achieving the global minimum with Newton method and the localization error will be high. There is no analytical solution for this cost function. To overcome this problem, two methods are existed. First, the cost function is approximated by a linear estimator. But this estimator has poor accuracy. The second method is to replace the non-convex cost function with a convex one with the aid of convex optimization methods, in which case the global minimum is obtained. In this paper, we proposed new convex estimator to solve cost function of maximum likelihood estimator. The results of the simulations show that the proposed estimator has up to 20 percent performance improvement compared with existing estimators, moreover, the execution time of proposed estimator is 30 percent faster than other convex estimators. Manuscript profile

Open Access Article

38 - Autonomous Controlling System for Structural Health Monitoring Wireless Sensor Networks
Sahand Hashemi Seyyed Amir Asghari Mohammad Reza Binesh Marvasti

Nowadays, office, residential, and historic buildings often require special monitoring. Obviously, such monitoring involves costs, errors and challenges. As a result of factors such as lower cost, broader application, and ease of installation, wireless sensor networks a More

Nowadays, office, residential, and historic buildings often require special monitoring. Obviously, such monitoring involves costs, errors and challenges. As a result of factors such as lower cost, broader application, and ease of installation, wireless sensor networks are frequently replacing wired sensor networks for structural health monitoring. Depending on the type and condition of a structure, factors such as energy consumption and accuracy, as well as fault tolerance are important. Particularly when wireless sensor networks are involved, these are ongoing challenges which, despite research, have the possibility of being improved. Using the Markov decision process and wake-up sensors, this paper proposes an innovative approach to monitoring stable and semi-stable structures, reducing the associated cost and error over existing methods, and according to the problem, we have advantages both in implementation and execution. Thus, the proposed method uses the Markov decision process and wake-up sensors to provide a new and more efficient technique than existing methods in order to monitor the health of stable and semi-stable structures. This approach is described in six steps and compared to widely used methods, which were tested and simulated in CupCarbon simulation environment with different metrics, and shows that the proposed solution is better than similar solutions in terms of a reduction of energy consumption from 11 to 70%, fault tolerance in the transferring of messages from 10 to 80%, and a reduction of cost from 93 to 97%. Manuscript profile

Open Access Article

39 - A Semi-Central Method to Improve Energy Saving in Real Wireless Sensor Networks Using Clustering and Mobile Sinks
Fatemeh Sadeghi Sepideh Adabi Sahar Adabi

Applying a hierarchical routing approach based on clustering technique and mobile sink has a great impact on reducing energy consumption in WSN. Two important issues in designing such an approach are cluster head selection and optimal allocation of mobile sinks to criti More

Applying a hierarchical routing approach based on clustering technique and mobile sink has a great impact on reducing energy consumption in WSN. Two important issues in designing such an approach are cluster head selection and optimal allocation of mobile sinks to critical regions (i.e., regions those have low remaining energy and thus, high risk of energy hole problem). The limited number of mobile sinks should be utilized due to a high cost. Therefore, allocating the limited number of mobile sinks to the high amount of requests received from the critical regions is categorized as a NP-hard problem. Most of the previous studies address this problem by using heuristic methods which are carried out by sensor nodes. However, this type of solutions cannot be implemented in real WSN due to the sensors’ current technology and their limited processing capability. In other words, these are just theoretical solutions. Consequently, a semi-central genetic algorithm based method using mobile sink and clustering technique is proposed in order to find a trade-off between reduction of computation load on the sensors and increasing accuracy. In our method, lightweight computations are separated from heavyweight computations. While, the former computations are carried out by sensors, the latter are carried out by base station. Following activities are done by the authors: 1) cluster head selection by using effective environmental parameters and defining cost function of cluster membership, 2) mathematical modeling of a region’s chance to achieve mobile sink, and 3) designing a fitness function to evaluate the fitness of each allocation of mobile sinks to the critical regions in genetic algorithm. Furthermore, in our activities minimizing the number and length of messages are focused. In summary, the main distinguishing feature of the proposed method is that it can be implemented in real WSN (due to separation of lightweight computations from heavyweight computations) with respect to early mentioned objectives. The simulation results show the better performance of the proposed method compared to comparison bases. Manuscript profile

Open Access Article

40 - Detection of Quantized Sparse Signals Using Locally Most Power Full Detector in Wireless Sensor NetworkS
Abdolreza Mohammadi Amin Jajarmi

This paper addresses the problem of distributed detection of stochastic sparse signals in a wireless sensor network. Observations/local likelihood ratios in each sensor node are quantized into 1-bit and sent to a fusion center (FC) through non-ideal channels. At the FC, More

This paper addresses the problem of distributed detection of stochastic sparse signals in a wireless sensor network. Observations/local likelihood ratios in each sensor node are quantized into 1-bit and sent to a fusion center (FC) through non-ideal channels. At the FC, we propose two sub-optimal detectors after that the data are fused based on the locally most powerful test (LMPT). We obtain the quantization threshold for each sensor node via an asymptotic analysis of the performance of the detector. It is realized that the quantization threshold depends on the bit error probability of the channels between the sensor nodes and the FC. Simulation results are carried out to confirm our theoretical analysis and to depict the performance of the proposed detectors. Manuscript profile

Open Access Article

41 - Improving energy consumption in the Internet of Things using the Krill Herd optimization algorithm and mobile sink
Shayesteh Tabatabaei

Internet of Things (IoT) technology involves a large number of sensor nodes that generate large amounts of data. Optimal energy consumption of sensor nodes is a major challenge in this type of network. Clustering sensor nodes into separate categories and exchanging info More

Internet of Things (IoT) technology involves a large number of sensor nodes that generate large amounts of data. Optimal energy consumption of sensor nodes is a major challenge in this type of network. Clustering sensor nodes into separate categories and exchanging information through headers is one way to improve energy consumption. This paper introduces a new clustering-based routing protocol called KHCMSBA. The proposed protocol biologically uses fast and efficient search features inspired by the Krill Herd optimization algorithm based on krill feeding behavior to cluster the sensor nodes. The proposed protocol also uses a mobile well to prevent the hot spot problem. The clustering process at the base station is performed by a centralized control algorithm that is aware of the energy levels and position of the sensor nodes. Unlike protocols in other research, KHCMSBA considers a realistic energy model in the grid that is tested in the Opnet simulator and the results are compared with AFSRP (Artifical Fish Swarm Routing ProtocolThe simulation results show better performance of the proposed method in terms of energy consumption by 12.71%, throughput rate by 14.22%, end-to-end delay by 76.07%, signal-to-noise ratio by 82.82%. 46% compared to the AFSRP protocol Manuscript profile

List of Articles Wireless sensor network

Rimag

Links

Related Centers

Technical Support

Official pages