List of Articles حسگر

• Open Access Article
  • Abstract Page
  • Full-Text
  
  1 - 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
  • Abstract Page
  • Full-Text
  
  2 - Improvement of the bulk sensitivity and FoM of the plasmonic nanodipole antenna array
  Samira  Amiri Najmeh  Nozhat
  20.1001.1.27170411.1396.9.33.4.9
  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
  • Abstract Page
  • Full-Text
  
  3 - Increasing the value of collected data and reducing energy consumption by using network coding and mobile sinks in wireless sensor networks
  ehsan kharati
  20.1001.1.27170414.1399.12.43.3.4
  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
  • Abstract Page
  • Full-Text
  
  4 - Improving imperialist competitive algorithm for solving the nodes placement problem in three-dimensional grid wireless sensor networks
  Sayed Wafa Barkhoda Hemmat Sheikhi sudabeh mohammadi
  20.1001.1.27170411.1399.12.45.5.5
  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
  • Abstract Page
  • Full-Text
  
  5 - Increasing the lifetime of underwater acoustic sensor networks by optimal relay node placement
  zahra mihamadi mohadeseh soleimanpour daryush avasimoghaddam Siamak Talebi
  20.1001.1.27170411.1399.12.45.7.7
  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
  • Abstract Page
  • Full-Text
  
  6 - Introducing a new optimal energy method for targets tracking in wireless sensor network using a hunting search algorithm
  Shayesteh Tabatabaei Hassan Nosrati Nahook
  20.1001.1.27170411.1401.14.51.3.9
  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
  • Abstract Page
  • Full-Text
  
  7 - Two Fuzzy Virtual Force Algorithms to Improve Sensor Deployment in Wireless Sensor Networks
  Vahid Kiani
  20.1001.1.27170411.1401.14.51.4.0
  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
  • Abstract Page
  • Full-Text
  
  8 - Design of Distributed Consensus Controller for Leader-Follower Singular Multi-Agent Systems in the Presence of Sensor Fault
  Saeid Poormirzaee Hamidreza Ahmadzadeh masoud Shafiee
  20.1001.1.27170411.1402.15.55.11.2
  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
  • Abstract Page
  • Full-Text
  
  9 - Improving energy consumption in the Internet of Things using the Krill Herd optimization algorithm and mobile sink
  Shayesteh Tabatabaei
  20.1001.1.27170411.1402.15.55.13.4
  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