Energy-Based Target Localization in Multi-Hop Wireless Sensor Networks Zhenxing Luo and Thomas C. Jannett Department of Electrical and Computer Engineering, The University of Alabama at Birmingham, Birmingham, AL, 35294, USA Abstract — This paper considers energy-based target localization in multi-hop wireless sensor networks. The multi-hop transmission scheme was modeled using a binary symmetric channel (BSC). The equivalent BSC model was integrated into a maximum likelihood estimation framework for energy-based target localization. We present a direct method for finding the coefficients in the equivalent BSC model. Simulations showed our approach can achieve performance close to the Cramer-Rao lower bound. Index Terms — Wireless sensor networks, communication channels, Cramer-Rao bounds, maximum likelihood estimation.

I. INTRODUCTION Wireless sensor networks (WSNs) have recently drawn a lot of attention. Target localization is a particularly important research area in WSNs [1], [2]. Target localization methods include time delay of arrival (TDOA), direction of arrival (DOA), and energy-based methods. TDOA methods require time synchronization among sensors. DOA methods require sensors that measure incoming signal directions. In contrast, energybased target localization methods do not require such information and therefore are easier to implement. A maximum likelihood estimation (MLE) approach for energy-based target localization was presented in [1]. In [2], the authors considered three different one-hop communication channels between the sensors and fusion center. However, in multi-hop WSNs, decisions from sensors have to be transmitted several times before reaching the fusion center. As described in [3], the communication channel between two relay nodes can be modeled as a Binary Symmetric Channel (BSC) under certain conditions. In [3], a recursive method was used to derive the transmission relation between sensors and the fusion center. Our main contribution is a direct method that is more convenient to use in finding the coefficients in the equivalent BSC model for the multi-hop transmission scheme. Moreover, we integrated the equivalent BSC model into the MLE framework presented in [1] and [2] to allow energy-based target localization in sensor networks that use a multi-hop communication scheme.

The energy-based target localization method is presented in Section II, followed by the multi-hop transmission scheme in Section III. In Section IV, we prove that coefficients in the equivalent BSC model for the multi-hop transmission scheme can be derived by the expansion of a binomial. Simulation results and discussion are provided in Section V. Conclusions are presented in Section VI. II. MLE APPROACH FOR TARGET LOCALIZATION USING DECISIONS TRANSMITTED OVER A BSC A typical sensor field is shown in Fig. 1. As in [1], a target emits a signal that decays according to the model ai2 =

Gi P0'

 di

d0 

2

(1)

where the gain of the ith sensor is Gi , the signal strength at the ith sensor is ai , and P0' is the power of the target measured at a reference distance d0 . The distance between a target located at (xt , yt ) and the ith sensor located at (xi , yi ) is defined as di = (xi - xt )2 + (yi - yt ) 2 .

(2)

We assume Gi  1 and d0  1 . Then the model (1) can be simplified as ai2 =

P0 . d i2

(3)

Throughout this paper, the target is assumed to be at least d0 meters away from any sensor. The signal received at sensor i is si = ai + wi

(4)

where wi is a Gaussian noise following distribution wi ~ N  0,σ 2  .

(5)

100 Sensors True target location

80

Next, the BSC model is incorporated into the MLE framework. The probability that m i is equal to m is

Sensor Field Y-coordinate (m)

60 40

p(m i  m  ) =

20 0

p (m i  m mi )p (mi  )

(9)

where p(m i  m mi ) denotes the applicable transition

-20

probability for the BSC model (Fig. 2).

-40

For Μ  [m 1 m 2 ... m N ]T received at the fusion center, the fusion center estimates   [ P0 xt yt ]T by maximizing

-60 -80 -100 -100



mi 1,1

-80

-60

-40 -20 0 20 40 Sensor Field X-coordinate (m)

60

80

100

Fig. 1. Sensor field layout.

N   ln p(M  ) =  ln   p(m i  m mi )p(mi  )  . (10) i=1   mi 1,1

The maximum likelihood estimator is Each sensor quantizes the signal si to a value mi according a pre-determined threshold  i . The process is denoted by:

   si   i .  i  si  

1 mi   1 The

probability

that

mi

assumes

value

 i  ai  1  Q (  ) ( m  1) p (mi  m  )    Q(  i  ai ) (m  1)  

(6)

m

is (7)



1

x

2

e



t2 2

dt .

(8)

The decision mi is transmitted to the fusion center through a BSC channel. The decision received at the fusion center is denoted by m i . The transition relation of a BSC channel is shown in Fig. 2, where the crossover probability is p and the probability of correct transmission is q .

mi

m i

q  1 p



(11)

For an unbiased estimate of  , the Cramer-Rao lower bound (CRLB) is

E{[ˆ(M )   ][ˆ(M )   ]T }  J 1

(12)

J   E  T lnp  M    .

(13)

The derivation of the CRLB matrix is presented in [2]. III. THE MULTI-HOP DECISION TRANSMISSION MODEL

where Q  x  is defined as: Q  x  

ˆ  max lnp  M   .

Under some assumptions, such as phase coherent reception and binary decisions, each hop can be modeled using a BSC [3]. In this case, a multi-hop transmission scheme has an equivalent BSC model (Fig. 3). We extended the MLE framework to address multi-hop transmission by replacing the BSC model (Fig. 2) with the equivalent BSC model for multi-hop transmission (Fig. 3); in (9), we set p  pBSC and q  qBSC . For multi-hop transmission, the transition probabilities in (9) are defined for the equivalent BSC model in terms of the crossover probability pBSC and the probability of correct transmission qBSC as follows: p(m i  1 mi = 1)  p (m i  -1 mi = -1) = qBSC =1-pBSC (14)

p

p (m i  1 mi = -1) = p (m i  -1 mi = 1)=pBSC .

p

However, in [3], the overall transmission relation between sensors and the fusion center is determined recursively, which is not very convenient and intuitive.

q  1 p Fig. 2. Binary symmetric channel.

(15)

m i

mi p p

q  1 p

q  1 p

p p

mi

q  1 p

q  1 p







p







p

q  1 p

q  1 p

expansion of (q  p )1 ). Therefore, our theory is valid for n  1 . If the number of hops is 2, then by inspection of Fig. 3, the coefficients in the corresponding BSC model are

m i

qBSC  1  pBSC

p(m i  1 mi = 1) = p(m i  -1 mi = -1) = q 2  p 2

pBSC

qBSC  1  pBSC

From

Fig. 3. Equivalent BSC model for multi-hop transmission.

IV. DIRECT METHOD TO CALCULATE COEFFICIENTS FOR THE EQUIVALENT BSC MODEL OF MULTI-HOP TRANSMISSION We use a direct method based on the binomial theorem to derive all transmission coefficients in the equivalent BSC model (Fig. 3) for multi-hop transmission. Our theory is proved using mathematical induction. Theorem: Consider n hops, where every hop has the same crossover probability p and the same probability of correct transmission q . According to the binomial theorem [4], the algebraic expansion of (q  p) n can be sorted and written in descending order of q n n (q  p) n     q n  k p k k 0  k   q n  Cn1 q n 1 p  Cn2 q n  2 p 2  Cn3 q n 3 p 3

(16)

For the BSC equivalent model for multi-hop transmission, the probability of correct transmission qBSC is the sum of

q , C q 2 n

n2

theory,

2 BSC

C q 1 n

n 1

expansion The

of

(q  p) 2

coefficients

p 2 , in (16).

p, Cn3 q n  3 p 3 , in (16).

k n

Here, C denotes the number of possible k combinations from a set of n objects. Proof: Basis: For a single hop model (Fig. 2) the coefficients are:

2

2 expansion of (q  p) 2 ) and pBSC  2qp (the sum of all

even numbered terms in the expansion of (q  p) 2 ). Therefore, our theory is valid for n  2 . For the multi-hop n denotes the transmission scheme using n hops, qBSC probability of correct transmission for the equivalent BSC n model and pBSC denotes the crossover probability. Induction steps: Assume our theory applies for n hops. From (16), we have the following results. 1) If n is an odd number, (q  p) n has an even number of terms.

n pBSC  Cn1 q n 1 p  Cn3 q n  3 p 3    Cnn  2 q 2 p n  2  p n .

n qBSC  q n  Cn2 q n  2 p 2    Cnn  2 q 2 p n  2  p n

p

n BSC

C q 1 n

n 1

pC q 3 n

n 3

p   Cnn 3 q 3 p n  3  Cnn 1q1 p n 1 .

(q  p) n 1  (q  p ) n (q  p )  q n 1  Cn1 q n p  Cn2 q n 1 p 2  Cn3 q n  2 p 3  

p (m i  1 mi = -1)=p (m i  -1 mi = 1) = (1 - q ) = p.

(18)

Cn2 q n  2 p 3  Cn3 q n  3 p 4    Cnn 1qp n  p n 1

the

expansion

of

(q  p )1 is

(q  p)1  q  p . We have q1BSC  q (the sum of all odd

numbered terms in the expansion of (q  p )1 ) and

(24)

Now, we consider the transmission coefficients in the equivalent BSC model for a multi-hop transmission scheme using n  1 hops:

Cnn 1q 2 p n 1  qp n  q n p  Cn1 q n 1 p 2 

theory,

(23)

3

(17)

our

(22)

2) If n is an even number, (q  p) n has an odd number of terms.

p (m i  1 mi = 1)  p (m i  -1 mi = -1) = q

From

are

 q  p (the sum of all odd numbered terms in the 2

The crossover probability pBSC is the sum of all of the even numbered terms

the

(q  p) 2  q 2  2qp  p 2 .

is q

our

n qBSC  q n  Cn2 q n  2 p 2    Cnn 3 q 3 p n 3  Cnn 1q1 p n 1 (21)

   Cnn 1q1 p n 1  p n .

n

(19)

p (m i  -1 mi = 1)  p (m i  1 mi = -1) = (1 - q ) = 2 pq . (20)

pBSC

all of the odd numbered terms

p1BSC  p (the sum of all even numbered terms in the

 q n 1  (Cn1  1)q n p  (Cn2  Cn1 )q n 1 p 2 

(Cn3  Cn2 )q n  2 p 3   (Cnn 1  1)qp n  p n 1 .

From our theory:

(25)

1) If n  1 is odd, (q  p) n 1 has an even number of terms n 1 qBSC  q n 1  (Cn2  Cn1 )q n 1 p 2    (Cnn 1  1)qp n (26) n 1 pBSC  (Cn1  1)q n p  (Cn3  Cn2 )q n  2 p 3    p n 1 . (27)

The results (34) and (35) from the diagram (Fig. 3) are the same as the results (28) and (29) from our theory. In summary, the results from our theory match those obtained from inspection of the multi-hop transmission model.

2) If n  1 is even, (q  p ) n 1 has an odd number of terms (28)

n 1 pBSC  (Cn1  1)q n p 

(29)

(Cn3  Cn2 )q n  2 p 3   (Cnn 1  1)qp n .

Next, we show that the theoretical results (26)-(29) are the same as those obtained from analysis of the multi-hop transmission diagram (Fig. 3). From Fig. 3, we have: n 1 n n qBSC =qBSC  q  pBSC p

(30)

n 1 n n qBSC =qBSC  p  pBSC q .

(31)

1) If n is even, n  1 is odd and (q  p) has an odd number of terms. Then, we have

V. RESULTS AND DISCUSSION We used Monte Carlo simulation (1000 runs) to demonstrate the effect of the number of hops, n , on localization performance for the target location ( xt , yt )  (12,13) . We set σ 2  1 , p  0.01 , P0  10000 , and used  i  3 for all sensors. The RMS estimation errors increased as the number of hops increased (Fig. 4). Estimation errors corresponded to the CRLB. 1000 500

n

C

n 3 n

pC q 3 n

3

q p

n 3

n 3

C

p 

n 1 1 n

q p n 1 )  p

(32)

(33)

 (1  Cn1 )q n p  (Cn2  Cn3 )q n  2 p 3    (Cnn  2  Cnn 1 )q 2 p n 1  p n 1 .

The results (32) and (33) from the diagram (Fig. 3) are the same as the theoretical results (26) and (27). 2) If n is odd, then n  1 is even and (q  p ) n has an even number of terms. Then, we have n 1 qBSC =(q n  Cn2 q n  2 p 2    Cnn 1q1 p n 1 )  q

(C q q

n 1

pC q

 (C  C )q 2 n

1 n

p   C 3

n 1

n2 n

2

q p

n2

 p ) p n

(34)

p  2

(Cnn 1  Cnn  2 )q 2 p n 1  p n 1 n 1 pBSC =(q n  Cn2 q n  2 p 2    Cnn 1q1 p n 1 )  p

(Cn1 q n 1 p  Cn3 q n  3 p 3    Cnn  2 q 2 p n  2  p n )  q  (1  C )q p  (C  C )q 1 n

n

2 n

3 n

6

7

8

1

2

3

4

5

6

7

8

1

2

3

6

7

8

n2

p    (C 3

4 5 Number of hops

x, m

VI. CONCLUSION

(Cn1 q n 1 p  Cn3 q n  3 p 3    Cnn 1q1 p n 1 )  q

n 3

5

Fig. 4. RMS estimation errors and CRLB.

n 1 pBSC =(q n  Cn2 q n  2 p 2   Cnn  2 q 2 p n  2  p n )  p

3 n

4

3 2

(Cnn  2  Cnn  3 )q 3 p n  2  (1  Cnn 1 )qp n

n 1

3

4

3

 q n 1  (Cn2  Cn1 )q n 1 p 2  

1 n

2

3 2

y, m

(C q

n 1

1

4

n 1 qBSC =(q n  Cn2 q n  2 p 2    Cnn  2 q 2 p n  2  p n )  q  1 n

CRLB RMS

1500 Po

n 1 qBSC  q n 1  (Cn2  Cn1 )q n 1 p 2    p n 1

n 1 n

(35)

 1)qp . n

We developed an equivalent BSC model for multi-hop transmission of decisions and we integrated this model into a MLE framework for target localization. Our method of finding coefficients in the equivalent BSC model is more convenient and intuitive than the recursive method of [3]. REFERENCES [1] R. Niu and P. K. Varshney, “Target location estimation in sensor networks with quantized data,” IEEE Trans. Signal Process., vol. 54, pp. 4519-4528, Dec. 2006. [2] O. Ozdemir, R. X. Niu, and P. K Varshney, “Channel aware target localization with quantized data in wireless sensor networks,” IEEE Trans. Signal Process., vol. 57, no. 3, pp. 1190-1202, Mar. 2009. [3] Y. Lin, B. Chen, and P. K. Varshney, “Decision fusion rules in multi-hop wireless sensor networks,” IEEE Trans. on Aerosp. Electron. Syst., vol. 41, no. 2, pp. 475-488, 2005. [4] D. A. S. Fraser, Probability and statistics: theory and applications. North Scituate, Mass.: Duxbury Press, 1976.

Submission Format for RWW

integrated into a maximum likelihood estimation framework ...... Electron. Syst., vol. 41, no. 2, pp. 475-488, 2005. n. [4] D. A. S. Fraser, Probability and statistics: ...

265KB Sizes 2 Downloads 218 Views

Recommend Documents

Submission Format for RWW
In practice, the fusion center may have inaccurate information about sensor positions due to errors in the measurement of sensor posi- tions or due to sensor ...

Submission Format for IMS2004 (Title in 18-point ...
The total number of workers, denoted by N, who worked at the site for ... 1:1800. 0.0012. 1:860. 0.0022. 1:461. 0.0036. 1:275. 0.0083. 1:120. OR. (Odds. Ratio).

final submission format instructions for proceedings of ...
coverage and capacity with the least uncovered mobile user. .... dedicated to design the relay architecture in order to achieve cost efficiency [18]. The most ...

RWW entire packet.pdf
This is the link: https://padlet.com/sandersonwis/summer2017 (password: read). SHARE. Draw pictures of the books you read: PRIMARY SCHOOL'S SUMMER READING PROGRAM 2017. Scan the QR. code to open. our Padlet. Password: read. Bring your pictures back t

How to format a submission for DMTCS with the ...
Oct 1, 2013 - Don't include the following “tableofcontentscommand in your file. This is only used for the purpose of this document here. PDF documents as produced with this style will ..... It might stand for mathematical identity that is discovere

CD_Reporting_specimen-submission-requirements-for-clinical ...
laboratory performs additional testing (confirmatory testing, serotyping, serogrouping, pulsed-field gel electrophoresis. [PFGE], whole genome sequencing ...

APPLICATION FORMAT Centre for Materials for Electronics ...
Pay/Pay. band with. Grade Pay. Detailed. nature of. duties. performed. (Use. separate. sheet)*. From To. * duly authenticated by your signature. Page 2 of 5 ...

Submission deadlines for paediatric applications 2018-2021
Feb 7, 2018 - Answers to requests for modification. (resubmission following clock-stop). •. Modifications to an agreed PIP. •. Compliance checks. 12/03/2018. •. Initial applications for requests of PIPs and product specific waivers. 26/03/2018.

AUTHOR GUIDELINE FOR MANUSCRIPT SUBMISSION - ENGLISH ...
AUTHOR GUIDELINE FOR MANUSCRIPT SUBMISSION - ENGLISH.pdf. AUTHOR GUIDELINE FOR MANUSCRIPT SUBMISSION - ENGLISH.pdf. Open. Extract.

Keycode Format 1.0 Abstract 1 Format - GitHub
1.7 The free tag bit. In the specification thus far, the most significant bit ... plays a role in meeting constraint (C). Though the specialized encoding defined in X.

FORMAT FOR ACCEPTANCE OF CAMPUS ... -
FORMAT FOR ACCEPTANCE OF CAMPUS RECRUITMENT. Date: Name of the college: No of candidates expected: Location: Qualification of Students: 1). 2) ...

Submission Form.pdf
been approved by, and is being funded by The American Kennel Club Canine Health Foundation or the Morris Animal. Foundation. It is agreed that this ...

Submission Guidelines
School of Mechanical Engineering. National Technical University of ..... M Abramovicz 'Trial by Market: A Thought Experiment' The George Washington. University Law School (2004) Public Law .... Philosophy Thesis, School of Information Sciences and Te

Submission Protocol.pdf
If the dog is to be euthanized, first take a blood sample if possible, and send both samples. • Place a 1” ... Pack the sample in a small box or insulated container.

Submission Protocol.pdf
Page 1 of 1. UNIVERSITY OF MINNESOTA. Canine Epilepsy Submission Protocol. • Complete the submission form; and for affected dogs, also complete the seizure survey. • Make a copy of your dog's 3 or 5 generation pedigree if available. • Make a co

Patent Offer Submission - Services
as evidence for any purpose in any judicial, administrative, or other proceeding in which infringement of any of Your patents is alleged. You agree that any transfer by You of patent assets part of the Submission ("Submitted Patents") will enforce th

ICIT 2009_final submission
classical Description Logic that will be extended to the management of uncertain information. The proposed solution is based on integration between the ... system components to the level of the global distributive system behaviour. Along with the ...

Call for Papers (Abstract Submission Deadline: 22 Sept. 2013) 11th ...
Sep 2, 2012 - Venue: Conference rooms at 'Titech Front' and lecture rooms of. Tokyo Institute of Technology (Ookayma Campus, 東京工業大学・大岡山地区).

Submission of List of Non-Teaching Personnel for Drug Testing ...
Jan 12, 2018 - UM dated January 12, 2018 - Submission of List of Non-Teaching Personnel for Drug Testing Purposes.pdf. UM dated January 12, 2018 - Submission of List of Non-Teaching Personnel for Drug Testing Purposes.pdf. Open. Extract. Open with. S

Template for Electronic Submission to ACS Journals
Two formal e-waste recycling sites (A and B) and two informal e-waste recycling sites (C and D). Dust. D1. D2. D3. D4. D5. The concrete work floor is housed in ...

Online submission Guidelines for Jurnal Kawistara.pdf
There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item.

Preparation GUIDE for Final-Submission Manuscript
discovery, digital discovery, data recovery, data discovery, computer analysis, and computer examination, is the process of methodically examining computer ...