Scribd
Upload
52 views22 pages

WSN - Distance Estimation

The document proposes a Hop Count based Neighbor Partition localization method for wireless sensor networks. It describes the system model and divides nodes into rings based on hop count from anchors. The method estimates the intersection areas of these rings to calculate distances to anchors. It assumes an imperfect hopping model with Gaussian distributed distances within each hop. Simulation results show it provides better localization accuracy than the basic DV-Hop method, with increased improvement at higher node densities.

Uploaded by

Sreeraj S J ee17d033
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
52 views22 pages

WSN - Distance Estimation

The document proposes a Hop Count based Neighbor Partition localization method for wireless sensor networks. It describes the system model and divides nodes into rings based on hop count from anchors. The method estimates the intersection areas of these rings to calculate distances to anchors. It assumes an imperfect hopping model with Gaussian distributed distances within each hop. Simulation results show it provides better localization accuracy than the basic DV-Hop method, with increased improvement at higher node densities.

Uploaded by

Sreeraj S J ee17d033
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 22

1

Sreeraj S J
CB.EN.P2CSP15021
 Introduction
 Wireless Sensor Networks
 Localization

 Proposed Method
 System Model
 Hop Count based Neighbour Partition(HCNP)
 Intersection Area Estimation
 Implementation Issues

 Simulation Methods
 Conclusion

2
 Wireless Sensor Networks
 Localization

3
WIRELESS SENSOR NETWORKS

 Spatially distributed autonomous sensors


 Components – Sensors, Processors, Transceivers, Antenna
 Monitor physical or environmental conditions, such as
temperature, sound, pressure, machine health monitoring,
structural health monitoring

4
LOCALIZATION

 Important function of a sensor network is to collect and


forward data to destination
 Hence it is very important to know about the location of
collected data
 Localization - process of finding the position of nodes
 GPS (global positioning system) is the simplest method for
localization of nodes, but very expensive
 Search for low cost localization techniques – calculating
relative distance from anchors(nodes whose positions are
known)
 If one node estimates its wrong location, then this error
propagates to overall network and gets accumulated

5
LOCALIZATION

 Localization summarised :
 Distance estimation from Anchors
 Triangulation with estimated distances from multiple anchors

 To find the position of nodes is mainly based on distance


between anchor node
 Range based and Range free methods
 Range based methods – signal strength, angle of arrival etc.
are calculated ; require extra hardware
 Eg : Received Signal Strength Indication (RSSI)
Angle of Arrival (AOA)

6
 Hop Count based Neighbour Partition(HCNP)
 Range free method
 Uses hop-count information and geometric characteristics

 Provides improvement to the basic DV-hop(Direct Vector)


algorithm
 DV-hop method simply uses hop count.

7
SYSTEM MODEL

 Node can communicate with all nodes in the radius r –


(communication range)
 Number of Nodes – N
Number of Anchors – M
N >> M
 Nodes and Anchors uniformly distributed
 Why uniform distribution.?
 Appropriate model for large scale WSNs

8
HOP COUNT BASED NEIGHBOUR PARTITION (HCNP)

 Let h be the hop count of a node with respect to an anchor


h = 0 for anchor
h > 0 for all other nodes
 Natural geometric division based on hop count
 A ring labelled h contains all the nodes with hop count h
 Ring h is defined by
𝒅𝒉𝒎𝒊𝒏 - inner circle radius
𝒅𝒉𝒎𝒂𝒙 - outer circle radius
 Perfect Hoping
𝒉
 C = 𝒅𝒉
𝒎𝒂𝒙 - 𝒅𝒎𝒊𝒏 (C : hop boundary distance)
𝒉+𝟏
𝒎𝒂𝒙 = 𝒅𝒎𝒊𝒏
 𝒅𝒉
 𝐂𝒛< r ( for any anchor j )

9
HOP COUNT BASED NEIGHBOUR PARTITION (HCNP)

 In practical cases,

C ≠ 𝒅𝒉𝒎𝒂𝒙 - 𝒅𝒉𝒎𝒊𝒏

𝒅𝒉𝒎𝒂𝒙 ≠ 𝒅𝒉+𝟏
𝒎𝒊𝒏

10
HOP COUNT BASED NEIGHBOUR PARTITION (HCNP)

 Assumes perfect hoping scenario


 For a node i , the neighbours are partitioned into three sets –
those with hop count h-1, h and h+1
Let 𝑺𝒉−𝟏 , 𝑺𝒉 and 𝑺𝒉+𝟏 be the respective sets

11
INTERSECTION AREA ESTIMATION

12
INTERSECTION AREA ESTIMATION

13
INTERSECTION AREA ESTIMATION

14
INTERSECTION AREA ESTIMATION

 Estimated areas of intersection regions are used to compute d


 Let f denote the nonlinear function in the previous equations,
then d is numerically solved by secant method

 We get three values for d, from the areas which are not perfect
estimates. Hence we go for an average value

15
INTERSECTION AREA ESTIMATION

 Perfect hop boundary does not exist in an imperfect hoping


network

Distribution of
distance in each
hop in a 450
nodes network

16
INTERSECTION AREA ESTIMATION

 To address the issue, we assume a pseudo-hop boundary


distance. Assuming an attenuated Gaussian distribution

The pseudo-hop boundary


distance is fixed where

17
Distance estimation error with Distance estimation error with
varying parameter: number of varying parameter: anchor%.
nodes.
18
Localization error with varying Localization error with varying
parameter: number of nodes parameter: anchor%
19
Percentage of improvement
20
 The algorithm divides a node’s neighbors based on their hop
count and then derives the node-to-anchor distance based on
its neighbor sets and their geometric relations.
 Performance is better than those of DV-Hop and the
improvement increases with the increase of the node density

21
22

You might also like