-
Open Access Article
1 - An Efficient Approach to Detect Faulty Readings: Applicability in Long-Thin Wireless Sensor Networks
Seyyed Jalaleddin DastgheibWireless 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 MoreWireless 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 - Energy-efficient and Privacy preserving Data Aggreration in wireless sensor networks
zahra zareEnergy 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 MoreEnergy 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
3 - Increasing the value of collected data and reducing energy consumption by using network coding and mobile sinks in wireless sensor networks
ehsan kharatiThe 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 MoreThe 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
4 - Improving imperialist competitive algorithm for solving the nodes placement problem in three-dimensional grid wireless sensor networks
Sayed Wafa Barkhoda Hemmat Sheikhi sudabeh mohammadiOne 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 MoreOne 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
5 - Increasing the lifetime of underwater acoustic sensor networks by optimal relay node placement
zahra mihamadi mohadeseh soleimanpour daryush avasimoghaddam Siamak TalebiUnderwater 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 MoreUnderwater 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
6 - A Unicast Tree-Based Data Gathering Protocol for Delay Tolerant Mobile Sensor Networks
Zeynab Mottaginia Ali GhaffariThe Delay Tolerant Mobile Sensor Networks (DTMSNs) distinguish themselves from conventional sensor networks by means of some features such as loose connectivity, node mobility, and delay tolerability. It needs to be acknowledged that traditional end-to-end routing proto MoreThe Delay Tolerant Mobile Sensor Networks (DTMSNs) distinguish themselves from conventional sensor networks by means of some features such as loose connectivity, node mobility, and delay tolerability. It needs to be acknowledged that traditional end-to-end routing protocols cannot be applied usefully in such challenging network conditions because of intermittent connections and/or long delays. Hence, this research is intended to propose a Unicast Tree-based Data Gathering protocol (UTDG) to resolve this problem. A UTDG includes 3 phases: tree formation phase, data collection and data transmission phase, and finally the updating phase. The proposed protocol constructs a tree in each community on the basis of transmission ranking, contact probability and the link expiration time. The selection of the next-hop node is based on the tree structure rather than forwarding the message to the neighbor node directly. Each node unicasts the data to its parent in the related community, and the root of the tree successively sends the data to the sink node. The authors contend, based on the simulation results of the study, that the proposed protocol can gain significantly higher message delivery rates with lower transmission overhead and also lower delay in data delivery than the other existing DTMSNs routing protocols in some applications. Manuscript profile -
Open Access Article
7 - Coverage Improving with Energy Efficient in Wireless Sensor Networks
Amir Pakmehr Ali GhaffariWireless 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 MoreWireless 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 TalebiWireless 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 MoreWireless 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 - Clustering for Reduction of Energy Consumption in Wireless Sensor Networks by AHP Method
Mohammad Reza Taghva Robab Hamlbarani Haghi Aziz Hanifi Kamran feiziDue to the type of applications, wireless sensor nodes must always be energy efficient and small. Hence, some studies have been done in order to the reduction in energy consumption. Data collection in wireless sensor networks is one of the most important operations of t MoreDue to the type of applications, wireless sensor nodes must always be energy efficient and small. Hence, some studies have been done in order to the reduction in energy consumption. Data collection in wireless sensor networks is one of the most important operations of these networks. Due to the energy limitation of nodes, energy efficiency is considered as a key objective in the design of sensor networks. In this paper, we present a method in which, in the first phase, nodes obtain their position by using the position of the base station and two other two nodes informed geographic position and are out of covered environment. In the second phase, the optimal location of the base station is determined. In the third phase, we determine the cluster heads based on the criteria such as the remaining energy, the distance (the distance from the cluster head and the distance from the base station), the number of neighbors (the one-step neighbors and the two-step neighbors) and the centrality. Using the multi-as criteria to select optimally cluster heads by decision making method. We implement the proposed method in the NS2 environment and evaluate its effect and compare it with the NEECP E-LEACH protocols. Simulation results show that by reducing energy consumption, the proposed method enhances the network life time expectancy. In addition it improves average packet delivery and the average delay. Manuscript profile -
Open Access Article
10 - Using Residual Design for Key Management in Hierarchical Wireless Sensor Networks
Vahid Modiri Hamid Haj Seyyed Javadi Amir Masoud Rahmani Mohaddese AnzaniCombinatorial 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 MoreCombinatorial 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
11 - Energy Efficient Clustering Algorithm for Wireless Sensor Networks
Maryam Bavaghar Amin Mohajer Sarah Taghavi MotlaghIn 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 MoreIn 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
12 - Confronting DDoS Attacks in Software-Defined Wireless Sensor Networks based on Evidence Theory
Nazbanoo Farzaneh Reyhaneh HoseiniDDoS 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 MoreDDoS 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
13 - A New Game Theory-Based Algorithm for Target Coverage in Directional Sensor Networks
Elham Golrasan marzieh varposhtiOne of the challenging problems in directional sensor networks is maximizing target coverage while minimizing the amount of energy consumption. Considering the high redundancy in dense directional sensor networks, it is possible to preserve energy and enhance coverage q MoreOne of the challenging problems in directional sensor networks is maximizing target coverage while minimizing the amount of energy consumption. Considering the high redundancy in dense directional sensor networks, it is possible to preserve energy and enhance coverage quality by turning off redundant sensors and adjusting the direction of the active sensor nodes. In this paper, we address the problem of maximizing network lifetime with adjustable ranges (MNLAR) and propose a new game theory-based algorithm in which sensor nodes try to adjust their working direction and sensing range in a distributed manner to achieve the desired coverage. For this purpose, we formulate this problem as a multiplayer repeated game in which each sensor as a player tries to maximize its utility function which is designed to capture the tradeoff between target coverage and energy consumption. To achieve an efficient action profile, we present a distributed payoff-based learning algorithm. The performance of the proposed algorithm is evaluated via simulations and compared to some existing methods. The simulation results demonstrate the performance of the proposed algorithm and its superiority over previous approaches in terms of network lifetime. Manuscript profile -
Open Access Article
14 - Cluster-based Coverage Scheme for Wireless Sensor Networks using Learning Automata
Ali Ghaffari Seyyed Keyvan MousaviNetwork 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 MoreNetwork 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
15 - Secure Key Management Scheme for Hierarchical Network Using Combinatorial Design
Siddiq Iqbal B R SujathaThe 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 MoreThe 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
16 - A Novel Approach for Establishing Connectivity in Partitioned Mobile Sensor Networks using Beamforming Techniques
Abbas Mirzaei Shahram ZandianNetwork connectivity is one of the major design issues in the context of mobile sensor networks. Due to diverse communication patterns, some nodes lying in high-traffic zones may consume more energy and eventually die out resulting in network partitioning. This phenomen MoreNetwork connectivity is one of the major design issues in the context of mobile sensor networks. Due to diverse communication patterns, some nodes lying in high-traffic zones may consume more energy and eventually die out resulting in network partitioning. This phenomenon may deprive a large number of alive nodes of sending their important time critical data to the sink. The application of data caching in mobile sensor networks is exponentially increasing as a high-speed data storage layer. This paper presents a deep learning-based beamforming approach to find the optimal transmission strategies for cache-enabled backhaul networks. In the proposed scheme, the sensor nodes in isolated partitions work together to form a directional beam which significantly increases their overall communication range to reach out a distant relay node connected to the main part of the network. The proposed methodology of cooperative beamforming-based partition connectivity works efficiently if an isolated cluster gets partitioned with a favorably large number of nodes. We also present a new cross-layer method for link cost that makes a balance between the energy used by the relay. By directly adding the accessible auxiliary nodes to the set of routing links, the algorithm chooses paths which provide maximum dynamic beamforming usage for the intermediate nodes. The proposed approach is then evaluated through simulation results. The simulation results show that the proposed mechanism achieves up to 30% energy consumption reduction through beamforming as partition healing in addition to guarantee user throughput. Manuscript profile -
Open Access Article
17 - Cache Point Selection and Transmissions Reduction using LSTM Neural Network
Malihe Bahekmat Mohammad Hossein Yaghmaee MoghaddamReliability 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 MoreReliability 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
18 - Simplify Programming of TinyOS Applications for Wireless Sensor Networks
M. Khezri M. Sarram F. AdibniaSensor 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 MoreSensor 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
19 - PLAER: Penalty Base Learning Automata for Energy Aware Routing in WSN
M. Parvizi Omran A. Moeni H. Haj Seyyed JavadiSensors 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 MoreSensors 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
20 - A Goal-Based Approach for the Holonification of Holonic Multi-Agent Systems
Ahmad Esmaeili N. Mozayani M. R. Jahed MotlaghHolonic 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 MoreHolonic 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
21 - A Novel Energy-Efficient Algorithm to Enhance Load Balancing and Lifetime of Wireless Sensor Networks
S. Abbasi-Daresari J. AboueiWireless 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 MoreWireless 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
22 - 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. ShahrokhzadehIn 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 MoreIn 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
23 - An Efficient Hybrid Routing Protocol in Underwater Wireless Sensor Networks
J. Tavakoli N. MoghimUnderwater 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 MoreUnderwater 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
24 - Introducing a Fog-Based Algorithm for Routing in Wireless Sensor Networks
E. Mirzavand Borujeni D. Rahbari M. NickrayWireless 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 MoreWireless 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
25 - 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 ArdestaniWith 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 MoreWith 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
26 - A Lightweight Intrusion Detection System Based on Two-Level Trust for Wireless Sensor Networks
M. sadeghizade O. R. MarouziWireless 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 MoreWireless 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
27 - Propose a New Clustering Algorithm for Data Transmission in Wireless Sensor Networks by Using Apollonius Circle
Sh. Pourbahrami E. Khaledi Alamdari L. Mohammad KhanliWireless 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 MoreWireless 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
28 - An Adaptive Multi-Objective Clustering Algorithm based on Auction_Prediction for Mobile Target Tracking in Wireless Sensor Network
Roghieh Alinezhad Sepideh Adabi arash SharifiOne 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 MoreOne 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
29 - Optimal Resource Allocation in Multi-Task Software-Defined Sensor Networks
S. A. Mostafavi M. Agha Sarram T. SalimianUnlike 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 MoreUnlike 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
30 - Autonomous Controlling System for Structural Health Monitoring Wireless Sensor Networks
Sahand Hashemi Seyyed Amir Asghari Mohammad Reza Binesh MarvastiNowadays, 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 MoreNowadays, 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
Rimag
Rimag is an integrated platform to accomplish all scientific journal requirements such as submission, evaluation, reviewing, editing, DOI assignment and publishing in the web.
Links
Related Centers
Technical Support
Official pages
The rights to this website are owned by the Raimag Press Management System.
Copyright © 2017-2024