Image Processing and Data Storage for Fire Alarm

Rahman, Muhammad Zia ur; Waseem, Saba; Riaz, Sidra; Riaz, Zainab; Asif, Aneeq; Saddiqa, Ayesha; Ali, Asghar

doi:10.55708/js0104012

Cited by 2 publications

(2 citation statements)

References 46 publications

(41 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Younis et al [24] gave a survey on the models and strategies that affect the sensor deployment. Sensor networks are also useful in image processing and for data storage [20]. Dahiya ey.al.…”

Section: Introductionmentioning

confidence: 99%

Coverage problem in two and three dimension

2023

Eur. J. Math. Appl.

View full text Add to dashboard Cite

Coverage in wireless sensor networks (WSNs) is a well known problem. Here we consider that problem in continuous domain. In this paper, we discuss coverage criteria and placement of sensors optimally in R 2 and R 3 . Coverage is important in WSNs. WSNs may be two and three dimensional in real life. In practice, sensors usually dropped randomly from space on previously determined positions (called, vertices) of the ROI (Region of Interest). But sensors will not place on the proper vertices in many times. Hence ROI will not be totally covered by the deployed sensors. The question is, how we reduced the area which is not covered by sensors? Usually extra sensors are dropped on some randomly but previously chosen points to minimize the uncovered area. In the current paper, we develop another strategy for deployment of those sensors. We partition the ROI in regular hexagons in two dimension and face-centered cubes in three dimension. Our new strategy is to reduce the side of hexagons or cubes. The amount of reduction depends on the number of extra sensors used. Here we target to deploy exactly one sensor randomly on each vertices. We compare uncovered volume for the two strategies, for two distributions (uniform and normal), and several number of excess sensors used. Simulation result shows that our new strategy is better for lower variance of the randomness but old one is better for higher variance.

show abstract

Section: Introductionmentioning

confidence: 99%

Coverage problem in two and three dimension

2023

Eur. J. Math. Appl.

View full text Add to dashboard Cite

show abstract

“…In some networks, there is a type of sensor which can move, and can put itself at a neighbouring point without any robot. Since a movable sensor needs large amount of battery capacity or others type of energy, robot assisted sensor placement is more feasible [9,10].…”

Section: Introductionmentioning

confidence: 99%

A New Mixed Strategy to Cover Continuous Region

Nandi

2023

JAMCS

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) is now a developing area. The coverage problem is an important part of that. WSNs contain sensors which cover a three or two-dimensional bounded convex set. In general, the sensors are deployed randomly from the air. Sometimes sensors are placed by robot(s) or sensor can move to placed themselves on some points of a pre-assigned region, known as Region of Interest (ROI). Since there is a randomness of placing the sensors, they may not be placed on the pre-assigned points. Hence, ROI may not completely cover by the sensors. So, the problem is, how one decrease the uncovered area? Most of the situations, extra sensors are deployed on some randomly chosen points to cover the ROI. In one of our previous work, we reduced the distance between two adjacent vertices and drop exactly one sensor on each vertex. We compare the uncovered area using two strategies (the general one and our previous one), for normal and uniform distributions, and for a different percentages of extra sensors. We observed that our strategy is better for low variance-distribution, but not for high variance-distribution. So, we combined the two strategies in this paper.We partitioned the ROI in regular hexagons and develop a new mixed strategy, for dropping the sensors. The extra sensors are divides in two groups. One group is used for reducing the distance between the two adjacent vertices and other parts is used for deploying an extra sensor on randomly selected points. We simulate with a non parametric distribution also along with above two. Simulation shows the optimal trade-off between the percentage of these two groups, which change with the variance of randomness.

show abstract

Image Processing and Data Storage for Fire Alarm

Cited by 2 publications

References 46 publications

Coverage problem in two and three dimension

Coverage problem in two and three dimension

A New Mixed Strategy to Cover Continuous Region

Contact Info

Product

Resources

About