حسگر

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 - A New Method to computational intelligence to improve network lifetime in wireless sensor networks
faezeh talebian hassan khotanloo mansour esmaeilpour

Recent advances in wireless electronic and communications provide us the ability to build small, economical sensors with low power consumption and many diverse applications. Limited energy capacity of sensors is a huge challenge that will affect these networks. Clusteri More

Recent advances in wireless electronic and communications provide us the ability to build small, economical sensors with low power consumption and many diverse applications. Limited energy capacity of sensors is a huge challenge that will affect these networks. Clustering has been used as a well-known method to handle this challenge. To find appropriate location of clusters' heads, imperialist competitive algorithm as an emerging topic in computational intelligence has been used. Clusters' heads are connected in a three-level model so that cluster heads with low energy capacity and far from station are considered as level three indirectly communicating with base station. This eventually increases lifetime of wireless sensor networks. 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 - Improvement of the bulk sensitivity and FoM of the plasmonic nanodipole antenna array
Samira Amiri Najmeh Nozhat

In this paper, the sensitivity of a plasmonic nanodipole antenna array for different materials of the metal nanodipole and substrate is calculated by changing the refractive index of the surrounding medium. The performance of our proposed array is studied at two wavelen More

In this paper, the sensitivity of a plasmonic nanodipole antenna array for different materials of the metal nanodipole and substrate is calculated by changing the refractive index of the surrounding medium. The performance of our proposed array is studied at two wavelengths of 1310 and 1550 nm, the wavelengths of the second and third telecommunications windows. It is shown that by using the silver (Ag) nanodipole instead of the gold (Au) one, the bulk sensitivity of the nanostructure is improved. By replacing the substrate material from Si to SiO2, the sensitivity increases up to 1220 and 1150 nm/RIU at the wavelengths of 1310 and 1550 nm, respectively, that is very suitable for sensing applications. Moreover, the figure of merit (FoM) of the plasmonic sensor is calculated for both substrates and nanodipole materials. The maximum value of the FoM is obtained for the nanoantenna array with SiO2 substrate and Ag nanodipole and it is equal to 14.35. Furthermore, it is shown that by increasing the thickness of the nanodipole, the nanostructure sensitivity and FoM are enhanced Manuscript profile

Open Access Article

5 - 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

6 - 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

7 - Increasing the lifetime of underwater acoustic sensor networks by optimal relay node placement
zahra mihamadi mohadeseh soleimanpour daryush avasimoghaddam Siamak Talebi

Underwater acoustic sensor networks (UASNs) have gained growing importance due to their desirable features and wide spread practical applications in many communication fields. Due to the high cost of underwater sensor nodes as well as implementation complexity, increasi More

Underwater acoustic sensor networks (UASNs) have gained growing importance due to their desirable features and wide spread practical applications in many communication fields. Due to the high cost of underwater sensor nodes as well as implementation complexity, increasing the lifetime of UASNs is an important issue. Although relay nodes have an important role in reducing the transmission distance and energy consumption. But the efficient RNP (Relay Node Placement) to avoid the critical sensor nodes' elimination is the main problem, i.e., to preserve the connected network. For this aim this paper presents an innovative solution called an Efficient Relay node Setting (ERS) algorithm, which involves formulating the Relay Node Placement (RNP) as a non-convex optimization problem. Actually, due to the Difference Convex (DC) constraints the proposed RNP problem is a non-convex problem and finding an optimal solution is complicated. However, a novel transformation can be applied to DC constraints which converts the problem into its convex programming equivalent. Application of the convex programming offers the advantage of readily computing a global optimal solution. Simulation results confirm the superiority of the proposed scheme over the competing RA method in terms of network lifetime and efficiency. Manuscript profile

Open Access Article

8 - Smart Farming Based on Internet of Things
GholamReza Farrokhi Mahboobeh Gapeleh

10.52547/jstpi.20750.15.59.29

Nowadays, with the increasing population of the world and the need for food on the one hand and the scarcity of water, energy and arable land on the other hand, traditional agriculture is no longer responsive to the food demand of the world population, so smart farming More

Nowadays, with the increasing population of the world and the need for food on the one hand and the scarcity of water, energy and arable land on the other hand, traditional agriculture is no longer responsive to the food demand of the world population, so smart farming has become more and more popular. The IoT is a new technology that is capable of providing many solutions for modernizing agriculture. IoT provides reliable information on the seed to be sown, the seed rate, the best time to plant and harvest, as well as the prediction of the amount of crop to be harvested. In this article, by studying research and research through library data collection and the study of scientific resources in the field of IoT, as well as the infrastructure required for deployment, we discuss the potentials and capabilities of this technology In the field of agriculture. The present study reviews the benefits of using IoT in smart agriculture such as increasing crop yields due to proper planning of seed planting time, crop harvesting, water use optimization. Planning to apply appropriate irrigation methods according to the amount of water required for each plant and each climatic zone, identifying pests and plant diseases at the real time, and alerting the farmer to the necessary decisions and actions to be taken. Pest utilization of information obtained from sensors established in the field is another benefit that has been addressed in this study. Manuscript profile

Open Access Article

9 - Introducing a new optimal energy method for targets tracking in wireless sensor network using a hunting search algorithm
Shayesteh Tabatabaei Hassan Nosrati Nahook

In this paper, in order to increase the accuracy of target tracking, it tries to reduce the energy consumption of sensors with a new algorithm for tracking distributed targets called hunting search algorithm. The proposed method is compared with the DCRRP protocol and t More

In this paper, in order to increase the accuracy of target tracking, it tries to reduce the energy consumption of sensors with a new algorithm for tracking distributed targets called hunting search algorithm. The proposed method is compared with the DCRRP protocol and the NODIC protocol, which uses the OPNET simulator version 11.5 to test the performance of these algorithms. The simulation results show that the proposed algorithm performs better than the other two protocols in terms of energy consumption, healthy delivery rate and throughput rate. Manuscript profile

Open Access Article

10 - 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

11 - 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

12 - 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

13 - 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

14 - 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

15 - 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

16 - Improving Target Coverage in Visual Sensor Networks by Adjusting the Cameras’ Field-of-View and Scheduling the Cover sets Using Simulated Annealing
B. Shahrokhzadeh M. Dehghan M. R. Shahrokhzadeh

In recent years, target coverage is one of the important problems in visual sensor networks. An efficient use of energy is required in order to increase the network lifetime, while covering all the targets. In this paper, we address the Maximum Lifetime with Coverage Sc More

In recent years, target coverage is one of the important problems in visual sensor networks. An efficient use of energy is required in order to increase the network lifetime, while covering all the targets. In this paper, we address the Maximum Lifetime with Coverage Scheduling (MLCS) problem that maximizes the network lifetime. We develop a simulated annealing (SA) algorithm that divides the sensors’ Field-of-View (FoV) to a number of cover sets that can cover all the targets and then applies a sleep-wake scheduling algorithm. On the other hand, we have to identify the best possible FoV of sensors according to the targets’ location using rotating cameras, to reduce the solution space and find a near-optimal solution. It also provides the balanced distribution of energy consumption by introducing a new energy and neighbor generating function as well as escaping from local optima. Finally, we conduct some simulation experiments to evaluate the performance of our proposed method by comparing with well-known solutions in the literature such as greedy algorithms. Manuscript profile

Open Access Article

17 - 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

18 - 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

19 - Next Hop Selection to Configuring the Route in LEAP Protocol Based on Fuzzy Logic in WSNs
Vahid Sattari-Naeini F. Movahhedi

Since in wireless sensor networks, selection of next hop is critical in attack avoidance and lowering the power consumption, a method based on fuzzy logic is proposed in this paper considering status and report transmission of the nodes. In this method, the next hop is More

Since in wireless sensor networks, selection of next hop is critical in attack avoidance and lowering the power consumption, a method based on fuzzy logic is proposed in this paper considering status and report transmission of the nodes. In this method, the next hop is selected considering four factors, based on fuzzy logic system. These factors, indicating four optimized parameters; i.e., degree of node proximity to the shortest path, degree of node proximity to the sink, residual energy ratio of each node, and the number of false filtered messages. This method leads to an increase in energy level as well as maintaining security level in comparison with LEAP protocol. Meanwhile, it is possible to identify safe paths. Comparing with other related methods, it is shown that this method leads to significant reduction in energy consumption level and consequently the life-time of the network is increased. Meanwhile with selecting the appropriate next hop, packet drops are reduced as well. Manuscript profile

Open Access Article

20 - 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

21 - The Effect of MIMO Channel Estimator in the Precoder Design of Wireless Sensor Networks
H. Rostami A. Falahati

One of the most important applications of wireless sensor networks was to estimate the unknown phenomenon. The cooperative activities of wireless sensors and scattered information of sensor nodes over network are used to decentralized estimation. Precoder design done on More

One of the most important applications of wireless sensor networks was to estimate the unknown phenomenon. The cooperative activities of wireless sensors and scattered information of sensor nodes over network are used to decentralized estimation. Precoder design done on the sensor nodes in order to provide an optimal estimate of the actual amount. Precoder design is an optimization problem. Since the channel is wireless link on the wireless sensor networks. Therefore, assuming the access of full channel state information isn't correct in this network. Since the perfect channel state information is required in the precoder design process, so the effects of the channel estimation investigated on precoder design process. On the issue of channel estimation, channel estimated by using of the known training sequence method with LS and MMSE criteria. Since power restriction is the key subject in the wireless sensor networks, therefore in this study power restriction considered in the channel estimation and precoder design problem. Manuscript profile

Open Access Article

22 - 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

23 - 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

24 - Optimal and Sub-optimal Transmitter-Receiver Design in Dense Wireless Sensor Networks and the Internet of Things
Farzad H. Panahi Fereidoun H. Panahi Zahra Askarizadeh Ardestani

With the rapid development of new technologies in the field of internet of things (IoT) and intelligent networks, researchers are more interested than ever in the concept of wireless sensor networks (WSNs). The emergence of these densely structured networks in recent ye More

With the rapid development of new technologies in the field of internet of things (IoT) and intelligent networks, researchers are more interested than ever in the concept of wireless sensor networks (WSNs). The emergence of these densely structured networks in recent years has raised the importance of the use of telecommunications technologies, such as ultra-wideband (UWB) technology with high reliability, industrial applications, and appropriate communication security. However, there are still numerous concerns about the extent of inter-network interference, particularly owing to undesired spectral discrete lines in this technology. As a result, it is necessary to provide an optimal solution to eliminate interference and control the power spectrum, and then design the optimal transmitter-receiver structures while considering high sensitivities to the synchronization problem in WSNs based on UWB technology. These goals are pursued in the present study by employing the optimal spectral strategy in the signal model, the structure of the transmitter sensor, and then constructing the optimal or sub-optimal receiver sensor structures, the results of which indicate improved communication performance in WSNs. Manuscript profile

Open Access Article

25 - 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

26 - 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

27 - 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

28 - 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

29 - 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

30 - Improving Energy Consumption in Wireless Sensor Networks Using Shuffled Frog Leaping Algorithm and Fuzzy Logic
Shayesteh Tabatabaey

Wireless sensor networks consist of thousands of sensor nodes with limited energy. Energy efficiency is a fundamental challenge issue for wireless sensor networks. Clustering sensor nodes in separate categories and exchanging information through clusters is one of the w More

Wireless sensor networks consist of thousands of sensor nodes with limited energy. Energy efficiency is a fundamental challenge issue for wireless sensor networks. Clustering sensor nodes in separate categories and exchanging information through clusters is one of the ways to improve energy consumption. This paper presents a new cluster-based routing protocol called SFLCFBA. The proposed protocol biologically uses fast and effective search features inspired by the Shuffled Frog Leaping algorithm, which acts based on the Frog food behavior to cluster sensor nodes. The proposed protocol also uses fuzzy logic to calculate the node fitness, based on the two criteria of distance to the sink and the remaining energy of the sensor node or power of battery level. IEEE 802.15.4 Protocol and NODIC Protocol with the proposed methodology and OPNET Simulator were simulation and the results in terms of energy consumption, end to end delay, signal to noise ratio, the success property data and throughput were compared with each other. The results of the simulation showed that the proposed method outperforms the IEEE 802.15.4 Protocol and NODIC Protocol due to the use of the criteria listed. Manuscript profile

Open Access Article

31 - 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

32 - 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

33 - Design and Simulation of a New Micro-Displacement Sensor Based on Negative Refraction Photonic Crystal
K. Fasihi

In this paper, design and simulation of a new micro-displacement sensor based on photonic crystal fixed and movable segments is presented. It has been shown that using negative refraction photonic crystal in the fixed segment, the transmitted power is concentrated on th More

In this paper, design and simulation of a new micro-displacement sensor based on photonic crystal fixed and movable segments is presented. It has been shown that using negative refraction photonic crystal in the fixed segment, the transmitted power is concentrated on the entrance of the movable segment, and the sensor specifications are improved. Based on the FDTD simulation results, the sensitivity, the operational displacement range and the regression coefficient of the proposed sensor are 1.1 (a-1), 0.35a and 0.99848, respectively. The simulation results show that the proposed sensor has a good performance and could well be used in micro-displacement measuring systems. Manuscript profile

Open Access Article

34 - Energy-Aware Data Gathering in Rechargeable Wireless Sensor Networks Using Particle Swarm Optimization Algorithm
Vahideh Farahani Leili Farzinvash Mina Zolfy Lighvan Rahim Abri Lighvan

This paper investigates the problem of data gathering in rechargeable Wireless Sensor Networks (WSNs). The low energy harvesting rate of rechargeable nodes necessitates effective energy management in these networks. The existing schemes did not comprehensively examine t More

This paper investigates the problem of data gathering in rechargeable Wireless Sensor Networks (WSNs). The low energy harvesting rate of rechargeable nodes necessitates effective energy management in these networks. The existing schemes did not comprehensively examine the important aspects of energy-aware data gathering including sleep scheduling, and energy-aware clustering and routing. Additionally, most of them proposed greedy algorithms with poor performance. As a result, nodes run out of energy intermittently and temporary disconnections occur throughout the network. In this paper, we propose an energy-efficient data gathering algorithm namely Energy-aware Data Gathering in Rechargeable wireless sensor networks (EDGR). The proposed algorithm divides the original problem into three phases namely sleep scheduling, clustering, and routing, and solves them successively using particle swarm optimization algorithm. As derived from the simulation results, the EDGR algorithm improves the average and standard deviation of the energy stored in the nodes by 17% and 5.6 times, respectively, compared to the previous methods. Also, the packet loss ratio and energy consumption for delivering data to the sink of this scheme is very small and almost zero Manuscript profile

Open Access Article

35 - Design and Simulation of a Lable-Free Nano Biosensor for Detecting Molecules via Nanotube Junctionless Field Effect Transistor
Zahra Ahangari

Biosensors have various applications especially in medical diagnosis. In this paper, nanotube junctionless transistor is employed for label-free detection of biomolecules. The proposed device works based on dielectric modulated principle. In this transistor, the gate vo More

Biosensors have various applications especially in medical diagnosis. In this paper, nanotube junctionless transistor is employed for label-free detection of biomolecules. The proposed device works based on dielectric modulated principle. In this transistor, the gate voltage is responsible for controlling the drain current and in case of gate capacitance variation, the drain current can be modulated. A nanogap is embedded in the gate insulator region for immobilization of biomolecules. Since each individual biomolecule has its specific dielectric constant, the accumulation of different biomolecule in the nanogap changes the dielectric constant of the nanogap, which eventually leads to the variation of gate capacitance and the drain current. Threshold voltage variation and drain current modulation are considered as two measures for detecting biomolecules and determining the biosensor’s sensitivity. The proposed device has two internal and external gates with low static power consumption as well as simpler low temperature fabrication process. One of the main advantages of the proposed device is its high selectivity and sensitivity, especially for biomolecules with low dielectric constant. Impact of critical physical and structural design parameters on the operation of the biosensor are thoroughly investigated. Gate workfunction and channel doping density are two critical parameters that affect the sensitivity of the biosensor and as a consequence, optimum values should be determined for them. Due to the low power consumption and high sensitivity, this sensor can be considered as a potential candidate for applications in nanoscale regime. Manuscript profile

Open Access Article

36 - Distributed Target Tracking by Solving Average Consensus Problem on Sensor Network Measurements
Iman Maghsudlu Meysam r. Danaee Hamid Arezumand

In this paper, a new algorithm is presented to drastically reduce communication overhead in distributed (decentralized) single target tracking in a wireless sensor network. This algorithm is based on a new approach to solving the average consensus problem and the use of More

In this paper, a new algorithm is presented to drastically reduce communication overhead in distributed (decentralized) single target tracking in a wireless sensor network. This algorithm is based on a new approach to solving the average consensus problem and the use of distributed particle filters. For the algorithm of this paper, unlike the common algorithms that solve an average consensus problem just to approximate the global likelihood function to calculate the particle importance weights in distributed tracking, a new model for observation is presented based on the Gaussian approximation, which only solves the problem Consensus is applied to the mean on the received observations of the nodes in the network (and not to approximate the global likelihood function). These innovations significantly reduce the exchange of information between network nodes and as a result uses much less energy resources. In different scenarios, the efficiency of the proposed algorithm has been compared with the centralized algorithm and the distributed algorithm based on the graph, and the simulation results show that the communication overhead of the network is greatly reduced in exchange for an acceptable drop in tracking accuracy by using our proposed algorithm. Manuscript profile

Open Access Article

37 - Two Fuzzy Virtual Force Algorithms to Improve Sensor Deployment in Wireless Sensor Networks
Vahid Kiani

Maximizing area coverage is an important issue in the placement of wireless network sensors, the realization of which helps to improve the network monitoring power. In many applications, the sensors are first randomly distributed in the sensing filed and then their plac More

Maximizing area coverage is an important issue in the placement of wireless network sensors, the realization of which helps to improve the network monitoring power. In many applications, the sensors are first randomly distributed in the sensing filed and then their placement is modified. The virtual force algorithm (VFA) tries to achieve a more desirable deployment from an initial sensing deployment by considering repulsive and attractive forces between the sensors. In this paper, the combination of Takashi-Sugeno fuzzy system with VFA is used to achieve a better redeployment of the sensors. To adaptively adjust optimal distance value of the sensors, two fuzzy methods are proposed in this paper and their role in improving performance of the virtual force algorithm is analyzed. Comparison of the performance of the proposed methods with the state-of-the-art reveals that intelligent and adaptive adjustment of the optimal distance using a fuzzy system leads to higher final coverage ratio over traditional virtual force algorithm (VFA), improved virtual force algorithm (IVFA), fuzzy redeployment algorithm (FRED), and two metaheuristics GA, and PSO. On the other hand, the proposed VF-based methods require much less time to solve the problem than GA and PSO metaheuristic methods. Manuscript profile

Open Access Article

38 - Distributed Primal-Dual Algorithm with Variable Parameters and Bidirectional Incremental Cooperation
Ghanbar Azarnia

Special conditions of wireless sensor networks, such as energy limitation, make it essential to accelerate the convergence of algorithms in this field, especially in the distributed compressive sensing (DCS) scenarios, which have a complex reconstruction phase. This pap More

Special conditions of wireless sensor networks, such as energy limitation, make it essential to accelerate the convergence of algorithms in this field, especially in the distributed compressive sensing (DCS) scenarios, which have a complex reconstruction phase. This paper presents a DCS reconstruction algorithm that provides a higher convergence rate. The proposed algorithm is a distributed primal-dual algorithm in a bidirectional incremental cooperation mode where the parameters change with time. The parameters are changed systematically in the convex optimization problems in which the constraint and cooperation functions are strongly convex. The proposed method is supported by simulations, which show the higher performance of the proposed algorithm in terms of convergence rate, even in stricter conditions such as the small number of measurements or the lower degree of sparsity. Manuscript profile

Open Access Article

39 - 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

40 - Temperature Sensor Based on Terahertz Plasmonic Slot Waveguide Coupled with a Resonator
Alireza Dolatabady

In this paper, the performance of a temperature sensor based on plasmonic structure including a slot waveguide coupled with a stub resonator has been investigated. The results have been attained based on the dependency of dispersion equation, and so, the resonance frequ More

In this paper, the performance of a temperature sensor based on plasmonic structure including a slot waveguide coupled with a stub resonator has been investigated. The results have been attained based on the dependency of dispersion equation, and so, the resonance frequency of the stub, to electric permittivity of the constructing material of the structure, InSb, which is also dependent to the ambient temperature. The design of the structure has been carried out for frequencies in terahertz spectra. The simulation results confirm an approximate linear relation between the resonance frequencies and ambient temperature, between 260-350 Kelvin. Also, a criterion has been assigned for evaluation the sensitivity and the performance temperature span of the proposed sensor. The calculated sensitivity is about 1×10-10 Kelvin per Hertz in the mentioned temperature interval. The sensor measurement resolution depends on the frequency resolution of the detection system. This simple sensor can be utilized in various chemical and bio systems. Manuscript profile

Open Access Article

41 - Design of Distributed Consensus Controller for Leader-Follower Singular Multi-Agent Systems in the Presence of Sensor Fault
Saeid Poormirzaee Hamidreza Ahmadzadeh masoud Shafiee

In this paper, the problem of sensor fault estimation and designing of a distributed fault-tolerant controller is investigated to guarantee the leader-follower consensus for homogeneous singular multi-agent systems for the first time. First, a novel augmented model for More

In this paper, the problem of sensor fault estimation and designing of a distributed fault-tolerant controller is investigated to guarantee the leader-follower consensus for homogeneous singular multi-agent systems for the first time. First, a novel augmented model for the system is proposed. It is shown that the proposed model is regular and impulse-free unlike some similar research works. Based on this model, the state and sensor fault of the system are simultaneously estimated by designing a distributed singular observer. The proposed observer also has the ability to estimate time-varying sensor fault. Then, a distributed controller is designed to guarantee the leader-follower consensus using estimation of state and sensor fault. The sufficeient conditions to ensure the stability of the observer dynamic and consensus dynamic are drived in terms of linear matrix inequalities (LMIs). The gains of observer and controller are computed by solving these conditions with MATLAB software. Finally, the validation and efficiency of the proposed control system for the leader-follower consensus of singular multi-agent systems exposed to sensor faults is illustrated by computer simulations. The simulation results show that the propsed control strategy deeling to the sensor falut in the singular multi-agent systems is effective. Manuscript profile

Open Access Article

42 - 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 حسگر

Rimag

Links

Related Centers

Technical Support

Official pages