Two and three-dimensional intrusion object detection under randomized scheduling algorithms in sensor networks

Xiao, Yang; Zhang, Yanping; Peng, Miao; Chen, Hui; Du, Xiaojiang; Sun, Bo; Wu, Kui

doi:10.1016/j.comnet.2009.05.002

Cited by 20 publications

(21 citation statements)

References 72 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This work also lays a foundation for our future work on sensor network scheduling algorithms. Evidently, we have extended partially this work and investigated the properties of randomized scheduling algorithms in sensor networks where sensor nodes are deployed either on two-dimensional plane or in three-dimensional space and intrusion objects occupy either areas in a two-dimensional plane or volumes in three-dimensional space, respectively [23].…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks

Xiao

Chen

et al. 2010

IEEE Trans. Comput.

Self Cite

View full text Add to dashboard Cite

Abstract-In wireless sensor networks, some sensor nodes are put in sleep mode while other sensor nodes are in active mode for sensing and communication tasks in order to reduce energy consumption and extend network lifetime. This approach is a special case (k ¼ 2) of a randomized scheduling algorithm, in which k subsets of sensors work alternatively. In this paper, we first study the randomized scheduling algorithm via both analysis and simulations in terms of network coverage intensity, detection delay, and detection probability. We further study asymptotic coverage and other properties. Finally, we analyze a problem of maximizing network lifetime under Quality of Service constraints such as bounded detection delay, detection probability, and network coverage intensity. We prove that the optimal solution exists, and provide conditions of the existence of the optimal solutions.

show abstract

Section: Resultsmentioning

confidence: 99%

“…In [9], the analysis on the impact of time asynchrony is provided. In [23], the analysis on coverage intensity of sensor networks where sensor nodes are deployed either on two-dimensional plane or in threedimensional space and intrusion objects occupy either areas in two-dimensional plane or volumes in three-dimensional space is presented.…”

Section: Introductionmentioning

confidence: 99%

Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks

Xiao

Chen

et al. 2010

IEEE Trans. Comput.

Self Cite

View full text Add to dashboard Cite

show abstract

“…The analysis of the randomized scheduling has been usually done using the paper-andpencil based probabilistic technique Hsin and Liu, 2004;Xiao et al, 2009). Such analysis consists in constructing a theoretical model where the required random variables are specified and analyzed together with the associated performance metrics.…”

Section: Related Workmentioning

confidence: 99%

“…Due to the sound formalization of probability and its reasoning support available in the HOL theorem prover, we first provide, in this paper, a formal analysis of the lifetime for randomly-scheduled WSN. Then, we develop the intrusion coverage formalizations of a novel version of the randomized algorithm (Xiao et al, 2009), under new assumptions related to the intrusion object.…”

Section: Related Workmentioning

confidence: 99%

“…As proposed in , the algorithm is abstracting intrusion objects by points, which is an over simplification that is not reflected in all cases of real WSN applications. In the second part of this paper, we tackle the formalization of the intrusion coverage intensity, for a modified version of the algorithm (Xiao et al, 2008a(Xiao et al, ,b, 2009), considering object size and shape in a two or three dimensional plane.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Formal probabilistic performance verification of randomly-scheduled wireless sensor networks

Elleuch

Hasan

Tahar

et al. 2018

IJCCBS

View full text Add to dashboard Cite

Energy efficiency in Wireless Sensor Networks (WSN) is one of the most critical issue regardless of the target application. While scheduling sensors by partitions to preserve energy is a simple and intuitive approach in this context, it is also important to not compromise on the main performance requirements of the considered application. For mission-critical WSN applications, different Quality of Service (QoS) requirements on network performance have to be met. Besides, various assumptions, may effectively impact the sensing performance capabilities of the network. Nevertheless, most analysis techniques focus on the average performance values, and do not consider neither the targeted QoS requirements, nor the probabilistic feature of the algorithm. Based on the theorem proving approach, we first provide, in this paper, an accurate formal analysis of the network lifetime maximization problem, under QoS constraints, for randomlyscheduled wireless sensor networks. After that, we tackle the higher-order-logic formalization of the intrusion coverage intensity, for a modified version of the randomized scheduling, with more realistic assumptions for the intrusion object, in a two or three dimensional plane.

show abstract

Deterministic deployment based on information coverage in wireless sensor networks

Zheng

Huang

Wang

et al. 2012

Wireless Communications

Self Cite

View full text Add to dashboard Cite

In this study, a deterministic deployment problem in wireless sensor networks is examined. On the basis of information coverage, we study equilateral triangle and square deployment strategies, and we provide the maximum distance between sensors in order to reach the required detection probability for any point in the monitoring field. First, we provide a model of the signal attenuation. On the basis of the detected signal from the K sensors, the best linear and unbiased estimation is used to estimate the signal parameter with the corresponding error. For the equilateral triangle deployment, the maximum distance between sensors is computed and provided when the received signal data from two or three sensors is used. Similarly, we have computed and supplied the maximum distance between sensors in the square deployment. Simulations are performed to show the relationship between the number of sensors and the detection probability. The simulation results show that it is not a good choice to improve the detection probability with a larger number of sensors.

show abstract

Two and three-dimensional intrusion object detection under randomized scheduling algorithms in sensor networks

Cited by 20 publications

References 72 publications

Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks

Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks

Formal probabilistic performance verification of randomly-scheduled wireless sensor networks

Deterministic deployment based on information coverage in wireless sensor networks

Contact Info

Product

Resources

About