1,558 research outputs found

    Coverage Protocols for Wireless Sensor Networks: Review and Future Directions

    Full text link
    The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field is monitored by its sensor nodes. This problem has attracted a lot of interest over the years and as a result, many coverage protocols were proposed. In this survey, we first propose a taxonomy for classifying coverage protocols in WSNs. Then, we classify the coverage protocols into three categories (i.e. coverage aware deployment protocols, sleep scheduling protocols for flat networks, and cluster-based sleep scheduling protocols) based on the network stage where the coverage is optimized. For each category, relevant protocols are thoroughly reviewed and classified based on the adopted coverage techniques. Finally, we discuss open issues (and recommend future directions to resolve them) associated with the design of realistic coverage protocols. Issues such as realistic sensing models, realistic energy consumption models, realistic connectivity models and sensor localization are covered

    3D Multi-Objective Deployment of an Industrial Wireless Sensor Network for Maritime Applications Utilizing a Distributed Parallel Algorithm

    Get PDF
    Effective monitoring marine environment has become a vital problem in the marine applications. Traditionally, marine application mostly utilizes oceanographic research vessel methods to monitor the environment and human parameters. But these methods are usually expensive and time-consuming, also limited resolution in time and space. Due to easy deployment and cost-effective, WSNs have recently been considered as a promising alternative for next generation IMGs. This paper focuses on solving the issue of 3D WSN deployment in a 3D engine room space of a very large crude-oil carrier (VLCC), in which many power devices are also considered. To address this 3D WSN deployment problem for maritime applications, a 3D uncertain coverage model is proposed with a new 3D sensing model and an uncertain fusion operator, is presented. The deployment problem is converted into a multi-objective problems (MOP) in which three objectives are simultaneously considered: Coverage, Lifetime and Reliability. Our aim is to achieve extensive Coverage, long Lifetime and high Reliability. We also propose a distributed parallel cooperative co-evolutionary multi-objective large-scale evolutionary algorithm (DPCCMOLSEA) for maritime applications. In the simulation experiments, the effectiveness of this algorithm is verified in comparing with five state-of-the-art algorithms. The numerical outputs demonstrate that the proposed method performs the best with respect to both optimization performance and computation time

    Problem Specific MOEA/D for Barrier Coverage with Wireless Sensors

    Get PDF
    Barrier coverage with wireless sensors aims at detecting intruders who attempt to cross a specific area, where wireless sensors are distributed remotely at random. This paper considers limited-power sensors with adjustable ranges deployed along a linear domain to form a barrier to detect intruding incidents. We introduce three objectives to minimize: 1) total power consumption while satisfying full coverage; 2) the number of active sensors to improve the reliability; and 3) the active sensor nodes' maximum sensing range to maintain fairness. We refer to the problem as the tradeoff barrier coverage (TBC) problem. With the aim of obtaining a better tradeoff among the three objectives, we present a multiobjective optimization framework based on multiobjective evolutionary algorithm (MOEA)/D, which is called problem specific MOEA/D (PS-MOEA/D). Specifically, we define a 2-tuple encoding scheme and introduce a cover-shrink algorithm to produce feasible and relatively optimal solutions. Subsequently, we incorporate problem-specific knowledge into local search, which allows search procedures for neighboring subproblems collaborate each other. By considering the problem characteristics, we analyze the complexity and incorporate a strategy of computational resource allocation into our algorithm. We validate our approach by comparing with four competitors through several most-used metrics. The experimental results demonstrate that PS-MOEA/D is effective and outperforms the four competitors in all the cases, which indicates that our approach is promising in dealing with TBC

    Joint optimization for wireless sensor networks in critical infrastructures

    Get PDF
    Energy optimization represents one of the main goals in wireless sensor network design where a typical sensor node has usually operated by making use of the battery with limited-capacity. In this thesis, the following main problems are addressed: first, the joint optimization of the energy consumption and the delay for conventional wireless sensor networks is presented. Second, the joint optimization of the information quality and energy consumption of the wireless sensor networks based structural health monitoring is outlined. Finally, the multi-objectives optimization of the former problem under several constraints is shown. In the first main problem, the following points are presented: we introduce a joint multi-objective optimization formulation for both energy and delay for most sensor nodes in various applications. Then, we present the Karush-Kuhn-Tucker analysis to demonstrate the optimal solution for each formulation. We introduce a method of determining the knee on the Pareto front curve, which meets the network designer interest for focusing on more practical solutions. The sensor node placement optimization has a significant role in wireless sensor networks, especially in structural health monitoring. In the second main problem of this work, the existing work optimizes the node placement and routing separately (by performing routing after carrying out the node placement). However, this approach does not guarantee the optimality of the overall solution. A joint optimization of sensor placement, routing, and flow assignment is introduced and is solved using mixed-integer programming modelling. In the third main problem of this study, we revisit the placement problem in wireless sensor networks of structural health monitoring by using multi-objective optimization. Furthermore, we take into consideration more constraints that were not taken into account before. This includes the maximum capacity per link and the node-disjoint routing. Since maximum capacity constraint is essential to study the data delivery over limited-capacity wireless links, node-disjoint routing is necessary to achieve load balancing and longer wireless sensor networks lifetime. We list the results of the previous problems, and then we evaluate the corresponding results
    • …
    corecore