Statistical location detection with sensor networks

Ray, S. Saha; Wei, Lai; Paschalidis, Ioannis Ch.

doi:10.1109/tit.2006.874376

Cited by 37 publications

(44 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The second inequality is the result of the non-negativity of I 2 . Given (17), it follows that S GLRT ijk,n ⊆ S * ijk,n and Lemma A.1 establishes that the constraint (7) is satisfied for the GLRT. It follows that the Type-II error probability decreases exponentially to zero faster than the Type-II error probability of test S * ijk,n .…”

Section: Discussionmentioning

confidence: 96%

“…Since only K sensors are available, the number of positive indicator variables is limited in the constraint (12), ensures that for every release scenario pair in L , there exists a d ijk at least as large as ǫ. Although shown to be NP-hard, (14) can be solved efficiently for large sets B and L using a special purpose algorithm [17].…”

Section: A Fusing Information From Multiple Sensorsmentioning

confidence: 99%

“…Allowing x * , y * , and ǫ * to represent the optimal decision variables in (14), we have the following result from [17], but now with d ijk 's corresponding to the Markovian rather than the iid case.…”

Section: A Fusing Information From Multiple Sensorsmentioning

confidence: 99%

See 2 more Smart Citations

Model-Free Stochastic Localization of CBRN Releases

Locke

Paschalidis

2013

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

Abstract-We present a novel two-stage methodology for locating a Chemical, Biological, Radiological, or Nuclear (CBRN) source in an urban area using a network of sensors. In contrast to earlier work, our approach does not solve an inverse dispersion problem but relies on data obtained from a simulation of the CBRN dispersion to obtain probabilistic descriptors of sensor measurements under a variety of CBRN release scenarios. At its first stage, subsequent sensor observations under nominal, CBRN event-free conditions are assumed to be independent and identically distributed and we rely on the method of types to detect a CBRN event. Conditional on such an event, subsequent sensor observations are assumed to follow a Markov process. Using composite hypothesis testing we map sensor measurements to a source location chosen out of a discrete set of possible locations. We leverage large deviation techniques to obtain a bound on the localization probability of error and propose several methodologies for fusing sensor data to arrive at a localization decision, including a distributed one. We also address the problem of optimally placing sensors to minimize the localization probability of error. Our techniques are validated numerically using two different CBRN release simulators.

show abstract

Section: Discussionmentioning

confidence: 96%

Section: A Fusing Information From Multiple Sensorsmentioning

confidence: 99%

See 1 more Smart Citation

Model-Free Stochastic Localization of CBRN Releases

Locke

Paschalidis

2013

IEEE Trans. Signal Process.

View full text Add to dashboard Cite

show abstract

“…This approach captures the more important aspects of a physical realization of a deep underwater ALS MIMO channel. Under the MIMO assumption, we can obtain the impulse response function of the deep underwater ALS channel by substituting each input signal z m (t) with the impulse function δ m (t) in Equation (2). We proceed to define the following expression:…”

Section: Delay-doppler Mimo Channel Characterizationmentioning

confidence: 99%

“…From the point of view of computational complexity theory, the combined problem of search, detection, estimation and tracking (SDET) of deep underwater moving objects through active signal sensing is considered an NP-hard problem [1][2][3]. This is in the context of transmitter signal waveform design and signal-to-noise ratio (SNR) optimization.…”

Section: Introductionmentioning

confidence: 99%

A Framework for Multiple Object Tracking in Underwater Acoustic MIMO Communication Channels

Rodriguez

Aceros

Valera

et al. 2017

JSAN

View full text Add to dashboard Cite

This work presents a computational framework for the analysis and design of large-scale algorithms utilized in the estimation of acoustic, doubly-dispersive, randomly time-variant, underwater communication channels. Channel estimation results are used, in turn, in the proposed framework for the development of efficient high performance algorithms, based on fast Fourier transformations, for the search, detection, estimation and tracking (SDET) of underwater moving objects through acoustic wavefront signal analysis techniques associated with real-time electronic surveillance and acoustic monitoring (eSAM) operations. Particular importance is given in this work to the estimation of the range and speed of deep underwater moving objects modeled as point targets. The work demonstrates how to use Kronecker products signal algebra (KSA), a branch of finite-dimensional tensor signal algebra, as a mathematical language for the formulation of novel variants of parallel orthogonal matching pursuit (POMP) algorithms, as well as a programming aid for mapping these algorithms to large-scale computational structures, using a modified Kuck's paradigm for parallel computation.

show abstract

Algorithms for Sink Mobility in Wireless Sensor Networks to Improve Network Lifetime

Koç

Korpeoglu

2011

Computer and Information Sciences II

View full text Add to dashboard Cite

A wireless sensor network (WSN) consists of hundreds or thousands of sensor nodes organized in an ad-hoc manner to achieve a predefined goal. Although WSNs have limitations in terms of memory and processor, the main constraint that makes WSNs different from traditional networks is the battery problem. Since sensor nodes are generally deployed to areas with harsh environmental conditions, replacing the exhausted batteries become practically impossible. This requires to use the energy very carefully in both node and network level. Different approaches are proposed in the literature for improving network lifetime, including data aggregation, energy efficient routing schemes and MAC protocols, etc. Main motivation for these approaches is to prolong the network lifetime without sacrificing service quality. Sink (data collection node) mobility is also one of the effective solutions in the literature for network lifetime improvement.In this thesis, we focus on the controlled sink mobility and present a set of algorithms for different parts of the problem, like sink sites determination, and movement decision parameters. Moreover, a load balanced topology construction algorithm is given as another component of network lifetime improvement. Experiment results are presented which compare the performance of different components of the mobility scheme with other approaches in the literature, and the whole sink mobility scheme with random movement and static sink cases. As a result, it is observed that our algorithms perform better than random movement and static cases for different scenarios. Telsiz algılayıcı aglarıönceden belirlenmiş bir amacı gerçekleştirmek için tasarsız bir biçimdeörgütlenen yüzlerce veya binlerce algılayıcı düǧümden oluşur. Telsiz algılayıcı aǧlarda bellek ve işlemcide sınırlamalar olsa da, onları geleneksel aǧlardan ayıran enönemli kısıt pil problemidir. Algılayıcı düǧümler zorçevresel koşulların olduǧu alanlara yayıldıǧından, biten pilleri yenileriyle deǧiştirmek pratik olarak mümkün olmamaktadır. Bu durum her bir algılayıcı düǧümünün enerjisinin hem düǧüm hem de ag seviyesinde dikkatlice kullanılmasını gerektirmektedir. Literatürde, agömrünü geliştirmek için veri toplaşımı, enerji etkin yönlendirme düzenleri ve ortama erişim protokolleri gibi birçok yaklaşım onerilmiştir. Bu yaklaşımların temel motivasyonu servis kalitesindenödün vermeyerek agömrünü geliştirmektir. Ç ıkış düǧümü (veri toplanan düǧüm) yer deǧişimi literatürde agömrünü geliştirmek için sunulan etkinçözümlerden biridir.Bu tezde, kontrol edilebilirçıkış düǧümü yer deǧişimine odaklanıp, bu probleminçıkış düǧümü yerleri belirleme, hareket kararı parametreleri gibi deǧişik kısımlarınınçözümü için bir algoritma kümesi sunulmuştur. Ayrıca, agömrü uzatmaçözümünün farklı bir bileşeni olarak yük dengeli topoloji yapılandırması konusunda da bir algoritma verilmiştir. Yer deǧişimi düzeninin farklı bileşenlerini literatürdeki diǧer ilgili yaklaşımlarla, bütünçıkış düǧümü yer deǧişimi düzenini ise, rasgele yer deǧişimi ve hareketsizçıkış düǧümü dur...

show abstract

Statistical location detection with sensor networks

Cited by 37 publications

References 17 publications

Model-Free Stochastic Localization of CBRN Releases

Model-Free Stochastic Localization of CBRN Releases

A Framework for Multiple Object Tracking in Underwater Acoustic MIMO Communication Channels

Algorithms for Sink Mobility in Wireless Sensor Networks to Improve Network Lifetime

Contact Info

Product

Resources

About