We present an interactive visualization system for exploring the coverage in sensor networks with uncertain sensor locations. We consider a simple case of uncertainty where the location of each sensor is confined to a discrete number of points sampled uniformly at random from a region with a fixed radius. Employing techniques from topological data analysis, we model and visualize network covera...

Techniques and tools are needed that allow Commanders and Analysts to intelligently plan and re-assess mobile networks that are supporting missions and courses of action in the battlespace and emergency response settings. Many techniques, simulations, and tools are available to model, represent, and analyze the RF environment, however they are typically used for a priori planning or after actio...

Recent investigations have shown that cell radius is a much better metric of RF coverage than area reliability. Given the maximum allowable path loss of the radio equipment and assuming a Hata path loss model, cell radius predictions are shown to be a monotonically decreasing function of the desired area reliability. A useful, technology independent nomograph is given that predicts the cell rad...

Coverage and connectivity are two important problems in wireless sensor network. This paper focuses on the wireless sensor network communication radius in the high density of sensor nodes deployed randomly and two times smaller than the sensing radius; put forward a distributed k coverage multi connected node deployment algorithm based on grid. Simulation results show that the algorithm in this...

Due to random deployment of camera nodes in wireless multimedia sensor network (WMSN) to cover surveillance area [1], there will be increase in overlapped field of view (FOV) and redundant transmission [2] of images in the network. This leads to increase in bandwidth utilization and reduce the network lifetime. This article concentrates on survey of node deployment strategies in WMSN to provide...

Most existing deployment algorithms for event coverage in underwater wireless sensor networks (UWSNs) usually do not consider that network communication has non-uniform characteristics on three-dimensional underwater environments. Such deployment algorithms ignore that the nodes are distributed at different depths and have different probabilities for data acquisition, thereby leading to imbalan...

This paper deals with the coverage problem of wireless sensor network. We use the density based clustering technique OPTICS to cover a target region with less number of sensor nodes. OPTICS works well to identify the outliers, core points and it obtains the denser regions. We define a level of acceptance to find next appropriate sensor in the region. We eliminate overlapped area and obtain a de...

A network is designed to have maximum area coverage with less energy consumption. Energy and coverage both are the current issue of wireless sensor network. The performance of wireless sensor network is affected by these two issues. Several methods are developed to make a network efficient. In this paper PSO Algorithm has been reviewed to resolve the challenges and issues of wireless sensor net...

Wireless sensor networks (WSNs) include sensor nodes in which each node is able to monitor the physical area and send collected information to the base station for further analysis. The important key of WSNs is detection and coverage of target area which is provided by random deployment. This paper reviews and addresses various area detection and coverage problems in sensor network. This paper ...