-
Open Access Article
1 - An efficient solution for management of pre-distribution in wireless sensor networks
Asghar Dolatabadi Hamid Haj Seyyed javadi -
Open Access Article
2 - Hybrid Key pre-distribution scheme for wireless sensor network based on combinatorial design
Hamid Haj Seyyed Javadi Mohaddese Anzani -
Open Access Article
3 - Coverage Improvement In Wireless Sensor Networks Based On Fuzzy-Logic And Genetic Algorithm
Elaheh Radmehr HASSAN SHAKERI -
Open Access Article
4 - Routing Hole Handling Techniques for Wireless Sensor Networks: A Review
Swathi B H Gururaj H L -
Open Access Article
5 - Improving the security of wireless sensor networks using Game Theory
Behzad Seif mohammad goodarzi -
Open Access Article
6 - A fault tolerance routing protocol considering defined reliability and energy consumption in wireless sensor networks
Hamid Hassan Kashi Amir Masoud Rahamni Mehdi Hoseinzadeh Vahid Sadatpour -
Open Access Article
7 - Compressive Sensing-based Data Aggregation in Wireless Sensor Networks: A Review
Gholamreza Imanian Mohammad ali Pourmina AHMAD SALAHIIn this review article, we aim to describe recent advances in compressive sensing-based data aggregation techniques in wireless sensor networks, including current research efforts, challenges, and research trends. Sparse and compressible signals are present in many appl MoreIn this review article, we aim to describe recent advances in compressive sensing-based data aggregation techniques in wireless sensor networks, including current research efforts, challenges, and research trends. Sparse and compressible signals are present in many applications of sensor networks, such as environmental monitoring and vehicle surveillance. Compressive sensing has many properties such as simplicity of sensing and compression operations, universality, and an acceptable decrease in the quality of signal reconstruction, which makes it attractive for use in sensor networks. Packet drops do not damage the network as much as other protocols, and only for each measurement that does not reach the sink will cause a slight decrease in the quality of signal reconstruction. We begin the discussion with a brief introduction to compressive sensing theory and then describe the use of this technique in wireless sensor networks. Finally, the research issues and challenges ahead are discussed to provide a perspective for future research Manuscript profile -
Open Access Article
8 - A Combined Method for Dynamic Routing in Mobile Ad-Hoc Networks
Fatemeh Shabih Jalil azimpour Marziye DadvarWireless sensor networks are a large number of sensor nodes with limited energy in a scattered geographically limited area. Due to limited resources in wireless sensor networks, increasing the lifetime of the networks by reducing energy consumption is always considered. MoreWireless sensor networks are a large number of sensor nodes with limited energy in a scattered geographically limited area. Due to limited resources in wireless sensor networks, increasing the lifetime of the networks by reducing energy consumption is always considered. More nodes to send data to the central station energy consumption. Sequential routing based on clustering, this responsibility falls on the head, and this increases the energy consumption of cluster heads. In recent years later all the energy of cluster heads, routing protocols and a lot of clustering is proposed. The purpose of this study, the combination of clustering and routing in order to extend the lifetime of this type of network. For clustering of genetic algorithm with fixed and harmony search algorithm is used for routing. Customize search algorithm for routing in harmony, three criteria neighborhood, reducing energy consumption and proper distribution of energy consumption is taken into account. Harmony algorithm is proposed to establish a proper balance between the criteria listed will generate more efficient routes. Finally change the routing cluster heads in each round will be balancing energy consumption between nodes per cluster. The results of the tests show the superiority of 2.14% proposed increase in messaging as well as 24.84% Lifetime network protocol is DEEC. Manuscript profile -
Open Access Article
9 - Energy-Efficient Wireless Sensor Networks Using Flat Cluster-based Routing Protocol and Evolutionary Algorithms
masoud negahdari Marziye DadvarWireless sensor networks have a large number of limited-energy sensor nodes dispersed in a finite area. Most node energies are used to send data to the central station. Due to the energy constraints in this type of grid, increasing life expectancy has always been a conc MoreWireless sensor networks have a large number of limited-energy sensor nodes dispersed in a finite area. Most node energies are used to send data to the central station. Due to the energy constraints in this type of grid, increasing life expectancy has always been a concern with decreasing energy consumption. The aim of this study is to provide surface clustering based on genetic algorithm in order to increase the life span of these networks. In proposed surface clustering, the geographic area is divided into three levels according to the radio range and the clustering of the nodes of each level is done individually. The cluster heads use more energy than other nodes to send information, so the proposed algorithm aims to reduce the number of cluster heads in order to increase the network lifetime. Finally, by changing the clusters in each routing round, there is a greater energy balance between the nodes. The results from the experiments indicate the superiority of the proposed algorithm in transmitting messages and network lifetimes over other similar protocols. Manuscript profile -
Open Access Article
10 - An Optimal Routing Protocol Using Multi-Objective Cultural Algorithm for Wireless Sensor Networks (ORPMCA)
Seyed Reza Nabavi Mehdi Najafi -
Open Access Article
11 - Improved Cuckoo Search-based Clustering Protocol for Wireless Sensor Networks
Hossein Sadeghian Mohammadreza Soltan Aghaei -
Open Access Article
12 - Improvement of Energy, Lifetime and Delays in Underwater Wireless Sensor Networks by Effective Deployment of Relay Nodes
Reyhane Zehtabzadeh Reza Gholamrezayi -
Open Access Article
13 - Fault Tolerance and Interference Aware Topology Control in Wireless Sensor Networks using NSGA-II
Nahid Sarbandi Farahani Asad Vakili -
Open Access Article
14 - An Approach to Integrate Wireless Sensor Networks with Cloud Computing Technology in Medical Context
Mohsen Norouzi Ali Arshaghi Mohsen Ashourian -
Open Access Article
15 - A Two-Layered Trust Management Approach in Software Defined Wireless Sensor Networks
Navid Mohammad Ebadati Esfahani Mehrdad Ashtiani Nasrin Hamzelou Background and Purpose: The main purpose of software-defined networks is to separate data from the control. That is, the elements are obtained through centralized remote controllers, rather than through distributed control protocols. Identifying a trusted node fro More Background and Purpose: The main purpose of software-defined networks is to separate data from the control. That is, the elements are obtained through centralized remote controllers, rather than through distributed control protocols. Identifying a trusted node from an unsafe node is also one of the challenges in this area. By finding and removing malicious nodes from secure nodes, packets are re-sent and energy is prevented, and network life is increased. On the other hand, the existence of hostile nodes to collect information or destroy sensitive data, as well as disabling the network and disrupting it in various ways, has made this area of great importance. In cases where the workspace and environment are secured, the sensor node may become a selfish node for the rest of its life, refusing to send or receive information. In this way, the data that exists in the previous path to the destination node will never be collected and without trust management, the validity of the received information will remain unclear. Therefore, the failure of a sensor node or its death due to lack of energy should not cause failure or disruption of the entire network, and the existence of various routes to send data using the calculated trust can be considered as a way to do this. Even so, they are often controlled in a distributed way. However, their potential challenges are more complex and can theoretically be solved with better network knowledge. In software-defined wireless sensor networks, security and energy are two critical issues. However, few studies have provided these two aspects simultaneously. With the widespread deployment and use of sensor networks, security and trust management issues are becoming a major concern. So far, the main focus of different research has been on building practical and useful sensor networks, with less emphasis on security.Methods: This research examines the security challenges in software-defined wireless sensor networks and summarizes the key issues that need to be addressed to achieve security. In this study, sensors were studied that, to conserve their energy, became selfish nodes and refused to receive or send data. Trust in such nodes will be discussed through the four criteria of honesty, intimacy, energy, and humility. In this regard and as the first step, the clustering is taking place by a software-defined network, to cluster the number of distributed sensors. For this purpose, the combination of two algorithms, which are k-means and kNN, is done based on the number of sensors used by the software-defined network, and then the optimal routing, which is based on energy consumption and trust priority is considered.Results: The proposed model is deployed for three different scenarios, with 50, 100, and 200 sensors with random distribution. Furthermore, some safe methods for achieving security in wireless sensor networks are described, and finally, a proposed integrated approach based on trust to ensure the security of sensor networks is presented.Discussion and Conclusion: The results of this study show that the proposed model has been able to have optimal energy consumption due to building trust. Manuscript profile -
Open Access Article
16 - Increasing Lifetime Using Whale Optimization Routing Algorithm in Wireless Sensor Networks
Hassan Nouri Esmaeil Zeinali -
Open Access Article
17 - A Rssi Based Localization Algorithm for WSN Using a Mobile Anchor Node
Fereydoon Abdi Abolfazl Toroghi Haghighat -
Open Access Article
18 - A Novel Ensemble Approach for Anomaly Detection in Wireless Sensor Networks Using Time-overlapped Sliding Windows
Zahra Malmir Mohammad Hossein Rezvani -
Open Access Article
19 - Cluster-head Election in Wireless Sensor Networks Using Fuzzy Logic
Hamid Reza Bakhshi Maryam Benabbas -
Open Access Article
20 - A Cutting-edge Metaheuristic Approach Based on The Manifold Distance for Energy-efficient Clustering in WSN
Faraein Aeini -
Open Access Article
21 - Wireless Sensor Networks Routing Using Clustering Based on Multi-Objective Particle Swarm Optimization Algorithm
Seyed Reza Nabavi Nafiseh Osati Eraghi Javad Akbari TorkestaniWith the spread of applications of wireless sensor networks, in recent years, the use of this type of network in order to monitor the environment and analyze data collected from specific environments in a variety of ways has become very common. Wireless sensor networks MoreWith the spread of applications of wireless sensor networks, in recent years, the use of this type of network in order to monitor the environment and analyze data collected from specific environments in a variety of ways has become very common. Wireless sensor networks are one of the best options for collecting data from the environment due to their easy configuration and no need for expensive equipment. The energy of sensors in wireless sensor networks is limited, which is a major challenge due to the lack of a fixed charge source. Because most of the sensors' energy is wasted during data transmission, a sensor that transmits more data than others and transmits data over long distances with packets will run out of energy sooner than others. When a sensor in the network runs out of energy, the network process may be disrupted. Therefore, due to the dynamic topology and distributed nature of wireless sensor networks, designing energy efficient routing protocols is one of the main challenges. Therefore, in this article, energy-aware routing protocol based on multi-objective particle swarm optimization algorithm is presented. In the proposed approach, the fitness function of the particle swarm optimization algorithm for selecting the optimal cluster head based on quality-of-service goals including residual energy, link quality, end-to-end delay and delivery rate. The simulation results show that the proposed approach has less energy consuming and extend network lifetime due to balancing the goals of quality-of-service criteria than other approaches. Manuscript profile -
Open Access Article
22 - A High Performance and Secure Way to Time Synchronization in Wireless Sensor Network
Mehdi Bagherizadeh Rezvan Kazemi -
Open Access Article
23 - An Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
Meisam Kamarei Ghasem Kamarei Zohreh Shahsavari -
Open Access Article
24 - Improve range-free localization accuracy in wireless sensor network using DV-hop and zoning
Fahimeh Doagoey -
Open Access Article
25 - Representing a Model for Improving Connectivity and Power Dissipation in Wireless Networks Using Mobile Sensors
Nasrin Elyasi Omid Pourgalehdari -
Open Access Article
26 - Localization of Underwater Wireless Sensor Network Nodes Using Cuckoo Optimization Algorithm
Leila Falahatpisheh -
Open Access Article
27 - A New Greedy Geographical Routing in Wireless Sensor Networks
Majid Hatamian Hamid Barati Ali Movaghar -
Open Access Article
28 - An Efficient Protocol for Data Aggregation In Wireless Sensor Networks
Mohammad Karim Sohrabi Elahe Khorramian -
Open Access Article
29 - Proposing a Novel Algorithm for Fault-Tolerant Relay Node Placement in Wireless Sensor Networks
Hamid Barati Mohsen Sedighi Ali Movaghar Iman Attarzadeh -
Open Access Article
30 - MAC Protocols in Underwater Wireless Sensor Networks: Issues and Simulations
Reza Mohammadi Seyyed Yahya Nabavi Reza Javidan -
Open Access Article
31 - Coverage Improvement Using GLA (Genetic Learning Automata) Algorithm in Wireless Sensor Networks
Shirin Khezri Amjad Osmani Behdis Eslamnour -
Open Access Article
32 - A Routing Algorithm based on Fuzzy Clustering and Minimum Cost Tree (FCMCT) in Wireless Sensor Network
Maryam Javaherian Abolfazl T.Haghighat -
Open Access Article
33 - Optimization of Mobile Base Station Placement to Reduce Energy Consumption in Multi-hop Wireless Sensor Network
Gholamreza Farahani Ameneh FarahaniNowadays, wireless sensor networks (WSNs) are widely used in different sectors. The problem in these networks is the non-rechargeable batteries of these sensors, which limit the lifetime of the network. Therefore, the optimal energy consumption of sensors is an open res MoreNowadays, wireless sensor networks (WSNs) are widely used in different sectors. The problem in these networks is the non-rechargeable batteries of these sensors, which limit the lifetime of the network. Therefore, the optimal energy consumption of sensors is an open research topic. In this paper, a new algorithm with the Development of Genetic Algorithm with the Floyd Warshall (DGAFW) has been proposed. Using the proposed DGAFW algorithm, the number of clusters and nodes assigned to each cluster is first determined with the Floyd Warshall algorithm and then the Cluster Head (CH) is selected using fuzzy logic. Finally, the optimal placement of the base station is specified by the combination of the Genetic Algorithm and the Floyd Warshall. The DGAFW algorithm is based on minimizing the distance of sending multi-hop messages. The simulation is carried out in MATLAB 2023a online software. The simulation results obtained from the DGAFW algorithm have been compared based on the distance, the amount of remaining energy in each round, and the number of rounds of network activity in the case where the location of the base station is fixed or randomly determined in each round. The results obtained show that the DGAFW algorithm compared to the case of random base station and fixed station respectively, has 12.7% and 14.3% shorter average message-sending distance in each round, 14.7% and 19.1% more residual energy and also 36% and 48% more rounds of network activity. Manuscript profile -
Open Access Article
34 - An Energy-Efficient Fuzzy Logic-based Fault-Tolerant Routing Protocol for Wireless Sensor Networks
Alireza Allahverdi Mamaghani Shayesteh Tabatabaei Mohammad Reza Ebrahimi Dishabi -
Open Access Article
35 - A Novel Secure Routing Method based on Hybrid Encryption in Heterogeneous Wireless Sensor Networks
Milad Jafari Mohsen Chekin Amin Mehranzadeh -
Open Access Article
36 - An Optimal Routing Protocol Using Multi-Objective Whale Optimization Algorithm for Wireless Sensor Networks
Seyed Reza Nabavi -
Open Access Article
37 - Optimum Cluster Head Selection with a Combination of Multi-Objective Grasshopper Optimization Algorithm and Harmony Search in Wireless Sensor Networks
Seyed Reza Nabavi Mehdi Najafi -
Open Access Article
38 - An Efficient Cluster Head Selection Algorithm for Wireless Sensor Networks Using Fuzzy Inference Systems
Mohsen Jahanshahi Shaban Rahmani Shaghayegh Ghaderi -
Open Access Article
39 - Intrusion Detection in Wireless Sensor Networks using Genetic Algorithm
Elham Yazdankhah Fardad Farokhi Reza Sabbaghi-Nadooshan -
Open Access Article
40 - ENERGY AWARE DISTRIBUTED PARTITIONING DETECTION AND CONNECTIVITY RESTORATION ALGORITHM IN WIRELESS SENSOR NETWORKS
M. Jahanshahi M. Maddah N. Najafizadegan