59,414 research outputs found

    Optimal coverage multi-path scheduling scheme with multiple mobile sinks for WSNs

    Get PDF
    Wireless Sensor Networks (WSNs) are usually formed with many tiny sensors which are randomly deployed within sensing field for target monitoring. These sensors can transmit their monitored data to the sink in a multi-hop communication manner. However, the ‘hot spots’ problem will be caused since nodes near sink will consume more energy during forwarding. Recently, mobile sink based technology provides an alternative solution for the long-distance communication and sensor nodes only need to use single hop communication to the mobile sink during data transmission. Even though it is difficult to consider many network metrics such as sensor position, residual energy and coverage rate etc., it is still very important to schedule a reasonable moving trajectory for the mobile sink. In this paper, a novel trajectory scheduling method based on coverage rate for multiple mobile sinks (TSCR-M) is presented especially for large-scale WSNs. An improved particle swarm optimization (PSO) combined with mutation operator is introduced to search the parking positions with optimal coverage rate. Then the genetic algorithm (GA) is adopted to schedule the moving trajectory for multiple mobile sinks. Extensive simulations are performed to validate the performance of our proposed method

    Water Contaminants Detection Using Sensor Placement Approach in Smart Water Networks

    Get PDF
    Incidents of water pollution or contamination have occurred repeatedly in recent years, causing significant disasters and negative health impacts. Water quality sensors need to be installed in the water distribution system (WDS) to allow real-time water contamination detection to reduce the risk of water contamination. Deploying sensors in WDS is essential to monitor and detect any pollution incident at the appropriate time. However, it is impossible to place sensors on all nodes of the network due to the relatively large structure of WDS and the high cost of water quality sensors. For that, it is necessary to reduce the cost of deployment and guarantee the reliability of the sensing, such as detection time and coverage of the whole water network. In this paper, a dynamic approach of sensor placement that uses an Evolutionary Algorithm (EA) is proposed and implemented. The proposed method generates a multiple set of water contamination scenarios in several locations selected randomly in the WDS. Each contamination scenario spreads in the water networks for several hours, and then the proposed approach simulates the various effect of each contamination scenario on the water networks. On the other hand, the multiple objectives of the sensor placement optimization problem, which aim to find the optimal locations of the deployed sensors, have been formulated. The sensor placement optimization solver, which uses the EA, is operated to find the optimal sensor placements. The effectiveness of the proposed method has been evaluated using two different case studies on the example of water networks: Battle of the Water Sensor Network (BWSN) and another real case study from Madrid (Spain). The results have shown the capability of the proposed method to adapt the location of the sensors based on the numbers and the locations of contaminant sources. Moreover, the results also have demonstrated the ability of the proposed approach for maximising the coverage of deployed sensors and reducing the time to detect all the water contaminants using a few numbers of water quality sensor

    K-coverage in regular deterministic sensor deployments

    Get PDF
    An area is k-covered if every point of the area is covered by at least k sensors. K-coverage is necessary for many applications, such as intrusion detection, data gathering, and object tracking. It is also desirable in situations where a stronger environmental monitoring capability is desired, such as military applications. In this paper, we study the problem of k-coverage in deterministic homogeneous deployments of sensors. We examine the three regular sensor deployments - triangular, square and hexagonal deployments - for k-coverage of the deployment area, for k ≥ 1. We compare the three regular deployments in terms of sensor density. For each deployment, we compute an upper bound and a lower bound on the optimal distance of sensors from each other that ensure k-coverage of the area. We present the results for each k from 1 to 20 and show that the required number of sensors to k-cover the area using uniform random deployment is approximately 3-10 times higher than regular deployments

    Movement-Efficient Sensor Deployment in Wireless Sensor Networks With Limited Communication Range.

    Get PDF
    We study a mobile wireless sensor network (MWSN) consisting of multiple mobile sensors or robots. Three key factors in MWSNs, sensing quality, energy consumption, and connectivity, have attracted plenty of attention, but the interaction of these factors is not well studied. To take all the three factors into consideration, we model the sensor deployment problem as a constrained source coding problem. %, which can be applied to different coverage tasks, such as area coverage, target coverage, and barrier coverage. Our goal is to find an optimal sensor deployment (or relocation) to optimize the sensing quality with a limited communication range and a specific network lifetime constraint. We derive necessary conditions for the optimal sensor deployment in both homogeneous and heterogeneous MWSNs. According to our derivation, some sensors are idle in the optimal deployment of heterogeneous MWSNs. Using these necessary conditions, we design both centralized and distributed algorithms to provide a flexible and explicit trade-off between sensing uncertainty and network lifetime. The proposed algorithms are successfully extended to more applications, such as area coverage and target coverage, via properly selected density functions. Simulation results show that our algorithms outperform the existing relocation algorithms

    Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey

    Full text link
    Wireless sensor networks (WSNs) consist of autonomous and resource-limited devices. The devices cooperate to monitor one or more physical phenomena within an area of interest. WSNs operate as stochastic systems because of randomness in the monitored environments. For long service time and low maintenance cost, WSNs require adaptive and robust methods to address data exchange, topology formulation, resource and power optimization, sensing coverage and object detection, and security challenges. In these problems, sensor nodes are to make optimized decisions from a set of accessible strategies to achieve design goals. This survey reviews numerous applications of the Markov decision process (MDP) framework, a powerful decision-making tool to develop adaptive algorithms and protocols for WSNs. Furthermore, various solution methods are discussed and compared to serve as a guide for using MDPs in WSNs
    • …
    corecore