Extensive use of sensor and actuator networks in many real-life applications introduced several new performance metrics at the node and network level. Since wireless sensor nodes have significant battery constraints, therefore, energy efficiency, as well as network lifetime, are among the most significant performance metrics to measure the effectiveness of given network architecture. This work investigates the performance of an event-based data delivery model using a multipath routing scheme for a wireless sensor network with multiple sink nodes. This routing algorithm follows a sink initiated route discovery process with the location information of the source nodes already known to the sink nodes. It also considers communication link costs before making decisions for packet forwarding. Carried out simulation compares the network performance of a wireless sensor network with a single sink, dual sink, and multi sink networking approaches. Based on a series of simulation experiments, the lifetime aware multipath routing approach is found appropriate for increasing the lifetime of sensor nodes significantly when compared to other similar routing schemes. However, energy-efficient packet forwarding is a major concern of this work; other network performance metrics like delay, average packet latency, and packet delivery ratio are also taken into the account.
相似文献Wireless sensor network (WSN) is a wireless network composed of a large number of static or mobile sensors in a self-organizing and multi-hop manner. In WSN research, node placement is one of the basic problems. In view of the coverage, energy consumption and the distance of node movement, an improved multi-objective optimization algorithm based on NSGA2 is proposed in this paper. The proposed algorithm is used to optimize the node placement of WSN. The proposed algorithm can optimize both the node coverage and lifetime of WSN while also considering the moving distance of nodes, so as to optimize the node placement of WSN. The experiments show that the improved NSGA2 has improvements in both searching performance and convergence speed when solving the node placement problem.
相似文献The method for optimal allocation of network resources based on discrete probability model is proposed. In order to take into account multiple coverage of the monitored points, the method constructs the discrete probability perception model of the network nodes. The model is introduced into the solution of the node coverage area, and the optimized parameters of the sensor optimization arrangement are used to optimize the layout of the multimedia sensor nodes. After setting the node scheduling standard, the interaction force between the sensor nodes and the points on the curve path is analyzed by the virtual force analysis method based on the discrete probability model At the same time On this basis, the path coverage algorithm based on the moving target is used to optimize the coverage of the wireless sensor network node in order to achieve optimal configuration of network resources. The experimental results show that the proposed method has good convergence and can complete the node coverage process in a short time. The introduction of the node selection criteria and the adoption of the dormant scheduling mechanism greatly improve the energy saving effect and enhance the network resource optimization effect.
相似文献Coverage of the bounded region gets importance in Wireless Sensor Network (WSN). Area coverage is based on effective surface coverage with a minimum number of sensor nodes. Most of the researchers contemplate the coverage region of interest as a square and manifest the radio ranges as a circle. The area of a circle is much higher than the area of a square because of the perimeter. To utilize the advantage of the circle, the coverage region of interest is presumed as a circle for sensor node deployment. This paper proposes a novel coverage improved disc shape deployment strategy. Comparative analysis has been observed between circle and square regions of interest based on the cumulative number of sensor nodes required to cover the entire region. A new strategy named as disc shape deployment strategy is also proposed. Traditional hexagon and strip-based deployment strategies are compared with the disc shape deployment strategy. The simulation result shows that the circle shape coverage region of interest extremely reduces the required number of sensor nodes. The proposed deployment strategy provides desirable coverage, and it requires few more sensor nodes than hexagon shape deployment strategy.
相似文献The core objective behind this research paper is to implement a hybrid optimization technique along with proactive routing algorithm to enhance the network lifetime of wireless sensor networks (WSN). The combination of two soft computing techniques viz. genetic algorithm (GA) and bacteria foraging optimization (BFO) techniques are applied individually on destination sequence distance vector (DSDV) routing protocol and after that the hybridization of GA and BFO is applied on the same routing protocol. The various simulation parameters used in the research are: throughput, end to end delay, congestion, packet delivery ratio, bit error rate and routing overhead. The bits are processed at a data rate of 512 bytes/s. The packet size for data transmission is 100 bytes. The data transmission time taken by the packets is 200 s i.e. the simulation time for each simulation scenario. Network is composed of 60 nodes. Simulation results clearly demonstrates that the hybrid approach along with DSDV outperforms over ordinary DSDV routing protocol and it is best suitable under smaller size of WSN.
相似文献In Wireless Sensor Network (WSN), securable data transmission is one of the most challenges. During the transmission between the source and a destination node, routing information of the particular path may be misbehaved by the particular nodes which are known as wormhole nodes/attackers. The paths which include the wormhole nodes are known as wormhole attacked paths. For improving security in WSN, these wormhole attacked paths should be identified. To achieve this, wormhole attack detection method and optimal or secure path selection are presented in this paper. Initially, ‘K’ paths or multiple paths are generated between source and destination using Ad-hoc On demand Multipath Distance Vector (AOMDV) routing protocol. Then, the source node identifies the wormhole attacked path by verifying the Detection Packet (DP) and Feedback Packet (FP) from the destination. After detecting the wormhole attacked paths, the source node selects the optimal path among the attacker free paths using Particle Swarm Optimization (PSO) algorithm. Simulation results show that the performance of the proposed approach improves energy efficiency and network lifetime of the network.
相似文献The wide range of wireless sensor network applications has made it an interesting subject for many studies. One area of research is the controlled node placement in which the location of nodes is not random but predetermined. Controlled node placement can be very effective when either the price of the sensor nodes is high or the sensor coverage is of a specific type and it is necessary to provide special characteristics such as coverage, lifetime, reliability, delay, efficiency or other performance aspects of a wireless sensor network by using the minimum number of nodes. Since node placement algorithms are NP-Hard problems, and characteristics of a network are often in conflict with each other, the use of multi-objective evolutionary optimization algorithms in controlled node placement can be helpful. Previous research on node placement has assumed a uniform pattern of events, but this study shows if the pattern of events in the environment under investigation is geographically dependent, the results may lose their effectiveness drastically. In this study, a controlled node placement algorithm is proposed that aims to increase network lifetime and improve sensor coverage and radio communication, assuming that the event pattern is not uniform and has a geographical dependency. The proposed placement algorithm can be used for the initial placement or, for repairing a segmented network over time. In this study, multi-objective evolutionary optimization algorithms based on decomposition (MOEA/D) have been used, and the performance results have been compared with other node placement methods through simulation under different conditions.
相似文献The wireless sensor network based IoT applications mainly suffers from end to end delay, loss of packets during transmission, reduced lifetime of sensor nodes due to loss of energy. To address these challenges, we need to design an efficient routing protocol that not only improves the network performance but also enhances the Quality of Service. In this paper, we design an energy-efficient routing protocol for wireless sensor network based IoT application having unfairness in the network with high traffic load. The proposed protocol considers three-factor to select the optimal path, i.e., lifetime, reliability, and the traffic intensity at the next-hop node. Rigorous simulation has been performed using NS-2. Also, the performance of the proposed protocol is compared with other contemporary protocols. The results show that the proposed protocol performs better concerning energy saving, packet delivery ratio, end-to-end delay, and network lifetime compared to other protocols.
相似文献The paper presents a technique called as Mobility-Enabled Multi Level Optimization (MeMLO) that addressing the existing problem of clustering in wireless sensor net-work (WSN). The technique enables selection of aggregator node based on multiple optimization attribute which gives better decision capability to the clustering mechanism by choosing the best aggregator node. The outcome of the study shows MeMLO is highly capable of minimizing the halt time of mobile node that significantly lowers the transmit power of aggregator node. The simulation outcome shows negligible computational complexity, faster response time, and highly energy efficient for large scale WSN for longer simulation rounds as compared to conventional LEACH algorithm.
相似文献