scholarly journals Boundary Detection Method for Large-Scale Coverage Holes in Wireless Sensor Network Based on Minimum Critical Threshold Constraint

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Rong Jing ◽  
Lingfu Kong ◽  
Liang Kong

The existing coverage hole boundary detection methods cannot detect large-scale coverage hole boundary in wireless sensor network quickly and efficiently. Aiming at this problem, a boundary detection method for large-scale coverage holes in wireless sensor network based on minimum critical threshold constraint is proposed. Firstly, the optimization problem of minimum critical threshold is highlighted, and its formulaic description is constructed according to probabilistic sensing model. On the basis of this, the distributed gradient information is used to approximately solve the optimization problem. After that, local-scale rough boundary detection algorithm incorporating the minimum critical threshold and its iterative thinning algorithm are proposed according to blocking flow theory. The experimental results show that the proposed method has low computational complexity and network overhead when detecting large-scale coverage hole boundary in wireless sensor network.

2014 ◽  
Vol 2014 ◽  
pp. 1-15 ◽  
Author(s):  
Shailaja Patil ◽  
Ashish Gupta ◽  
Mukesh Zaveri

The prediction based target tracking in wireless sensor network is being studied from many years. However, the presence of a coverage hole(s) in the network may hamper tracking by causing temporary loss of target, which is a crucial issue in mission critical applications. This raises the need for robust recovery mechanism to capture the lost target. However, the problem of recovery of lost target during tracking has received less attention in the literature. In this paper, we present an energy efficient recovery mechanism. The performance of proposed algorithm for lost target recovery using different tracking filters has been evaluated with and without awakening hole boundary nodes. The efficacy of the algorithm has been tested using various causes of losing target with and without energy saving modes. We have conducted exhaustive simulations for recovery of the lost target and presented the analysis of how the recovery gets affected with linear and nonlinear filters. From the simulation results and energy analysis, it is evident that the proposed recovery algorithm outperforms the existing work in the literature.


2018 ◽  
Vol 7 (3.12) ◽  
pp. 1322 ◽  
Author(s):  
Vrince Vimal ◽  
Madhav J Nigam

Clustering of the sensors in wireless sensor network is done to achieve energy efficiency. The nodes, which are unable to join any cluster, are referred to as isolated nodes and tend to transfer information straight to the base station. It is palpable that isolated nodes and cluster heads communicate with the base station and tend to exhaust their energy leaving behind coverage holes. In this paper, we propose the innovative clustering scheme using mobile sink approach to extend networks lifetime. The proposed (ORP-MS) algorithm is implemented in MATLAB 2017a and the results revealed that the proposed algorithm outdid the existing algorithms in terms networks lifetime and energy efficiency simultaneously achieved high throughput.  


2018 ◽  
Vol 14 (8) ◽  
pp. 155014771879584 ◽  
Author(s):  
Danyang Qin ◽  
Yan Zhang ◽  
Jingya Ma ◽  
Ping Ji ◽  
Pan Feng

Due to the advantages of large-scale, data-centric and wide application, wireless sensor networks have been widely used in nowadays society. From the physical layer to the application layer, the multiply increasing information makes the data aggregation technology particularly important for wireless sensor network. Data aggregation technology can extract useful information from the network and reduce the network load, but will increase the network delay. The non-exchangeable feature of the battery of sensor nodes makes the researches on the battery power saving and lifetime extension be carried out extensively. Aiming at the delay problem caused by sleeping mechanism used for energy saving, a Distributed Collision-Free Data Aggregation Scheme is proposed in this article to make the network aggregate data without conflicts during the working states periodically changing so as to save the limited energy and reduce the network delay at the same time. Simulation results verify the better aggregating performance of Distributed Collision-Free Data Aggregation Scheme than other traditional data aggregation mechanisms.


Water distribution system is a network that supplies water to all the consumers through different means. Proper means of providing water to houses without compromising in quantity and quality is always a challenge. As it is a huge network keeping track of the utilization is difficult for the utility. Hence through this project we come up with a solution to solve this issue. Current technologies like Low Power Wide Area Networks, LoRa and sensor deployment techniques have been in research and were also tested in few rural areas but issues due to hardware deployment and large scale real time implementation was a challenge hence through this system we aim to create and simulate a real time scenario to test a sensor network model that could be implemented in large scale further. This project aims in building a wireless sensor network model for a smart water distribution system. In this system there is bidirectional communication between the consumer and the utility. Each house has a meter through which the amount of water consumed is sent to the utility board. The data has two fields containing the house ID and the data (water consumed); it is being sent to the data collection unit (DCU) which in-turn sends it to the central server so that the consumption is monitored in real time. All this is simulated using NETSIM and MATLAB.


Sign in / Sign up

Export Citation Format

Share Document