Hybrid Target Tracking Scheme in Wireless Sensor Networks

International Research Journal of Engineering and Technology (IRJET)

e-ISSN: 2395-0056

Volume: 04 Issue: 08 | Aug -2017

p-ISSN: 2395-0072

www.irjet.net

Hybrid Target Tracking Scheme in Wireless Sensor Networks Abha Tiwari1 Student Mtech, Department of Electronics and Communication Engineering, IGDTUW, Delhi, India ---------------------------------------------------------------------***--------------------------------------------------------------------2. LOCALIZATION PROBLEMS IN WSNS Abstract - The continuously widening variety of Wireless 1

Sensor Networks (WSNs) applications requires node this is certainly precise which needs efficient and error free localization practices. Localization methods created in past times are totally centered on really good computation this is certainly numerical of network variables for example transmission range, propagation form, transmitted or received power, delivering or arrival time, connection information etc.

These variables are susceptible towards ecological presence and circumstance of hurdles in environment. As wireless sensor companies tend to be ubiquitous in general, localization is a factor this is certainly essential to be fixed. Localization of a node that is unknown be identified through a collection of research nodes. In this work, we provide a novel hybrid localization strategy, which determines the location this is certainly exact of an unknown node through the mixture of both range free and range based practices.

Localization [3] bypass on to the skill of ascertaining the locale (relative or absolute) of a sensor node, alongside a satisfactory precision. In a WSN, localization is a tremendously vital task; though, localization is not the goal of the network. In reality localization is a main ability as it is relevant to countless requests (intruder detection, target pursuing, environmental monitoring, etc.), that depend on knowing the locale of nodes. Localization is relevant to the Network main functions: contact, cluster conception, Network coverage geographical routing, etc. Even collaboration naturally depends on localization of nodes .

Keywords: wireless sensor network, sensor placement, wireless sensor networks, DOA localization, RSS localization

1. WIRELESS SENSOR NETWORK The word "wireless" has come to be a generic and allencompassing word utilized to delineate contact in that electromagnetic waves are utilized to hold a gesture above portion or the whole contact path. Wireless knowledge can able to grasp nearly every single locale on the external of the earth. Due to incredible accomplishment of wireless voice and messaging services, it is hardly stunning that wireless contact is commencing to be requested to the area of confidential and company computing. Ad- hoc [1] and Sensor Networks[2] are one of the portions of the wireless communication.

Figure-1: Localization in Wireless Sensor Network

3. TARGET TRACKING Since sensor Networks are normally utilized to monitor the nature, one frank subject is the location-tracking setback, whose aim is to draw the roaming trails of advancing objects/individuals in the span in that sensors are used [4].

This setback is challenging in two senses:

In ad-hoc Network every single nodes are permit to converse alongside every single supplementary lacking each fixed infrastructure. This is truly one of the features that differentiate amid ad-hoc and supplementary wireless knowledge like cellular Networks and wireless LAN that truly needed groundwork established contact like across a little center station.

(a) There no central manipulation mechanisms and backbone Network in such an environment. (b) The wireless contact is extremely limited.

At present, locale pursuing is completed employing GPS. Though, GPS has its limitations. It cannot be utilized in most indoor environments. It depends on Line of Sight.

Additionally in non-urban outdoor settings, GPS does not yield precise aftermath because it depends too far on factors such as terrain, foliage and topographical settings of the locale where the object is located. Since, GPS receivers could

“A Sensor Network is a placement of large numbers of tiny, inexpensive, self-powered mechanisms that can sense, compute, and converse alongside supplementary mechanisms for the intention of meeting innate data to make globe decisions concerning a physical nature”.

© 2017, IRJET

|

Impact Factor value: 5.181

|

ISO 9001:2008 Certified Journal

| Page 122

International Research Journal of Engineering and Technology (IRJET)

e-ISSN: 2395-0056

Volume: 04 Issue: 08 | Aug -2017

p-ISSN: 2395-0072

www.irjet.net

3.1 Key Aspects of Localization Algorithms

be too colossal, too luxurious or too manipulation intensive, employing wireless sensor Networks provides us alongside a larger alternate for locale pursuing as the nodes are moderately tiny, inexpensive and low manipulation devices.

They are far extra viable pondering commercial and ease constraints.

There are a little aspects that have to be believed after arranging or selecting a localization algorithm, like: manipulated resources, density of nodes, number Network topology, kinds of signals utilized, attendance of obstacles or terrain irregularities, and node mobility (if nodes are stationary or mobile). Most of the continuing algorithms can accomplish good localization accuracy. But, normally, they can merely change to a little of these key aspects.

Some supplementary methods have additionally been counseled in the past as alternates to the trilateration technique. They are: (a) Infrared: RFID tags emit infrared radiations grasping an exceptional ID. This is consented by a number of receivers dispersed across an ability that as certain the locale of the badge established on distance. (b) Ultrasound: These are additionally distance established arrangements but furnish a larger guesstimate by computing time-of-flight of ultrasound alongside respect to a reference RF signal. MIT’s Cricket arrangement is an example of this. (c) Radio: The arrangements that use wireless waves furnish a larger approximation for locale detection because of the skill of these waves to penetrate assorted materials. Instead of employing contrasts in entrance periods as in Ultrasound, these arrangements use gesture strength to compute the location.

(a) Limited resources Usually, a sensor node embodies in four frank components: detecting (transmitter and receiver) and manipulation (usually, a battery) units, processing, transceiver. New advancements permit for the present creation of sensor nodes to come to be yet tinier and cheaper. Therefore, nodes have decreased recollection and processing capacity. Battery is, limited. Furthermore, due to a short transmission scope (caused by restrained transmission power), nodes can merely converse alongside its innate neighbors. A fine localization resolution has to ponder all these resource borders (computational, transmission minimizing energetic and hardware costs).

(b) Number and density of nodes

The finished pursuing strategies in words of selecting that nodes are activated for pursuing intentions i.e. in words of power efficiency are:

Most localization algorithms are receptive to the number of nodes and/or to the density of nodes (amount of localizing nodes each span unit). On one hand, a little algorithms cannot associate to low density WSNs because they will reason momentous localization errors. On the supplementary hand, after employing a little algorithms in exceedingly density WSNs, localization can be an expensive procedure.

(a) Naïve Activation (NA): In such a pursuing scheme all nodes are in pursuing mode all the time. This strategy proposals the worst power efficiency. As it proposals the best pursuing aftermath, it is a functional baseline for comparison. (b) Randomized Activation (RA): In this strategy, every single node is on alongside a precise probability p. On an average, a fraction p of all nodes will be on and in the pursuing mode. It is a extra power effectual resolution than NA. (c) Discerning Activation (SA): In this activation method, insufficient selected nodes in the Network are selected at a period reliant on their distance from the object. As and after the object moves, the distances additionally change from those nodes and therefore, ‘handovers’ seize locale amid nodes. It proposals a good balance amid power efficiency and pursuing precision. (d) Duty-Cycled Activation (DA): In this, the whole sensor Network periodically turns on and off alongside a usual obligation cycle. The main supremacy of this scheme is that it be utilized in conjunction alongside the three methods remarked above. It is not the shrewdest of resolutions in words of power efficiency but fares larger than NA.

© 2017, IRJET

|

Impact Factor value: 5.181

(c) Network topology adaptability A number of the localization algorithms compute the Euclidian distance amid a pair of nodes, ponder the shortest trail amid them. Though, this is merely valid to such cases whereas shortest trails are comparable a straight line. In Networks whereas the used span has a concave topology (naturally, S or C form settings, for instance: streams, metropolis roads, valleys, etc.), this is normally not valid.

|

ISO 9001:2008 Certified Journal

| Page 123

International Research Journal of Engineering and Technology (IRJET)

e-ISSN: 2395-0056

Volume: 04 Issue: 08 | Aug -2017

p-ISSN: 2395-0072

www.irjet.net

distance between the sender and the receiver). So, the receiver only has to measure signal attenuation to approximate the distance to the sender. This method is suitable to outdoor environments. Though, it is not simple to forecast radio signal behaviour indoors [8].

(a) ToA (Time of Arrival) techniques This method measure the distance between nodes using signal propagation time. The nodes transmit a signal to their neighbours at a predefined pace and wait for answers. Their neighbours, send a signal back to them. Inter-node distance is calculated by measuring the difference between sending and receiving times (round trip approach) [9]

Figure-2: Network topology adaptability in WSN

(d) Obstacles and irregularities A number of the proposed localization solutions have low accuracy in obstructed environments. This is due to the survival of obstacles, which block the line-of-sight between nodes. Obstacles and terrain irregularities can cause signal reflections, what lead to incorrect distance estimations.

(b) TDoA (Time-Difference techniques

In a large amount WSNs, nodes are stationary. As a effect, most localization algorithms are designed purposely to this kind of networks. Though, due to the emergence of new applications, algorithms should adjust to the existence of mobile nodes.

(f) Type of signals

(c) AoA (Angle of Arrival) measurement techniques

It is really significant to know the type of signal that is going to be used by an algorithm, owed to its propagation characteristics. Typically, localization algorithms use one type of signal, among three possibilities: acoustic,radio and ultrasounds.

This method makes use of the receiver antenna’s amplitude and receiver antenna’s phase response. The correctness of AoA measurements is narrowed by the directivity of the antenna, by the shadowing effect and by multipath reflections [10].

4. TYPES OF LOCALIZATION ALGORITHMS Localization algorithms can be categorized in two main categories:

4.2 Range-free This cluster of algorithms is established in connectivity data, i.e., “who is inside the contact scope of whom”, to estimation the locale of nodes. The connectivity can be tested by computing the number of consented packets. The principle of these algorithms is: if two nodes can converse, next the distance amid them is, alongside huge probability, less than their highest transmission range. These methods do not need supplementary hardware, as they do not rely in each distance measurements. The main gains of range-free ways are its ease and low cost. Range-free advances can be hopbased, whereas inter-node distance is probable across the number of hops amid the nodes, ponder the shortest trail[11].

4.1 Range-based In range-based approach, distance estimation is generally performed using one of the following techniques: TDoA, RSSI, ToA or AoA/DoA. Then, distance estimation is used to establish nodes position. Range based approaches are called one-hop approaches because nodes have to be at one-hop distance from a minimum of anchor nodes [7]. (a) The RSSI (Received Signal Strength Indicator) technique The RSSI (Received Signal Strength Indicator) method is based in the attenuation of the radio signal with the amplification of distance (according to 1/r2, where r is the

|

Impact Factor value: 5.181

Arrival)

This method compute the distance between nodes employing gesture propagation time. In this method, internode distance measurements demand that nodes transmits two disparate signals, that excursion at varied speeds, to their neighbours. Typically, distance is computed established on the difference in proliferation periods of wireless and aural signals initiate at the alike point. Sender and receiver synchronize their clocks. The sender shows a wireless memo pursued by an aural gesture (chirp). Every single node that detects the chirp, computes the difference amid both signals entrance periods and, as a consequence, the distance.

(e) Stationary or mobile nodes

© 2017, IRJET

of

|

ISO 9001:2008 Certified Journal

| Page 124

International Research Journal of Engineering and Technology (IRJET)

e-ISSN: 2395-0056

Volume: 04 Issue: 08 | Aug -2017

p-ISSN: 2395-0072

www.irjet.net

5. PROPOSED HYBRID LOCALIZATION

where xi is the position of the ith sensor, xs is the position of the source transmitter, and ||x|| denotes the norm of the vector x. The straight dotted lines shown in Figure 1 can be calculated using the following equations: between x1 and x2 :

Hybrid techniques is one of the main categories of distributed techniques. An example of such category is the use of RSS combined with Triangulation. Combining both RSS and Triangulation in one node provide a significant improvement to the accuracy of localization when compared to RSS on its own. Triangulation is considered a computational expensive technique, but the use of it can be justified for some applications that needs higher localization accuracy. In addition, just few nodes in the network are going to use Triangulation to localize other nodes.

between x1 and x3 :

between x2 and x3

The location of the blind node can be determined by solving for xs and ys in equation (3) and (4). In this case, there are only two independent lines, which means that there will be only one intersection. However, as the number of reference nodes increases, the number of independent lines increases, which results in increasing the number of intersections.

Those lines are not going to intersect at the same point due to the error in the distance measurements. Therefore, it is required to use an algorithm to estimate the values xs and ys.

For a system with N reference nodes, there will be N - 1 linear line equations that will intersect at different position forming a polygon. The blind node position can be estimated by averaging the intersection points or calculating the centroid of the polygon.

Figure-3: RSS localization Scenario

The least square method is an alternative approach to estimate the position of the blind node. Each of the N - 1 independent lines is represented in the following form :

5.1 RSS FORMULATION RSS is a common technique in localizing sensor nodes; this is due to the fact that almost all nodes have the ability to measure the strength of the received signal. RSS technique benefits from the fact that radio signals diminish with the square of the distance from the signal source. In other words, the node can calculate its distance from the transmitter using the power of the received signal, knowledge of the transmitted power, and the path-loss model. The RSS between nodes i and j at time t can be calculated using :

where ai,1, ai,2 and bi are known.

This equation can be rewritten as:

The equations describing all of the lines can also be written in matrix form as:

where n is the signal propagation constant (environment dependent), dij is the distance between nodes iand j, and P0 is the Received Signal Strength at a distance of 1 meter. Let us consider the simplest scenario where there are only three reference nodes and a single blind node as shown in Figure 3. Each two circles intersect with one another at two points.

These two points are used to draw a line which will intersect with other line from other anchor nodes.

The distance between the ith reference node and the blind node is given by:

Š 2017, IRJET

|

Impact Factor value: 5.181

., Since the straight lines do not intersect with each other in a single point, there is no solution for the above equation.

However, least square estimation can be used to estimate the values of xsthat are as close as possible to the actual blind node coordinates. The estimated location of the blind node is given by: This algorithm is obviously much less difficult than the geometric one since there is no need to compute intersections of many lines.

|

ISO 9001:2008 Certified Journal

| Page 125

International Research Journal of Engineering and Technology (IRJET)

e-ISSN: 2395-0056

Volume: 04 Issue: 08 | Aug -2017

p-ISSN: 2395-0072

www.irjet.net

5.2 POINT IN TRIANGULATION IN WSN A Network of sensors in a 2D plane is considered. A triangular Network is believed i.e. the sensors are allocated in a triangular fashion. Typically, the Network is believed as a hexagonal mesh. Every single sensor is cognizant of its physical locale and that of its bordering sensors. All the sensors have a processor, a recollection and needed hardware to prop detecting, data meeting and contact capabilities. Every single sensor has a detecting radius, r that is equal to the length of the side of the triangle. Three sensors are utilized to ascertain the locale of the object. The methodology utilized in this case is the triangulation method of noticing the spatial coordinates. The sensors in this case are consented to have disparate detecting radii. The work gave aims to trail the advancing trail of an object in the network. The sensors have an overlapping span of detecting that is recognized as the ‘working area’ and the spans encircling these are recognized as ‘backup areas’ that imply that as quickly as the object moves into these spans a ‘handover’ ought to seize place. As quickly as a movement is noticed, an vote procedure is led amid the sensors established on their distance from the object. The sensor closest to the object is selected as the chief agent as the subsequent two are selected as slave agents.

Figure-4: Working area and backup areas

As quickly as the vote procedure is completed, all the supplementary sensors ar0e prohibited from pursuing the object by dispatching them blocking messages. Employing the trilateration method, these sensors compute the locale of the object. From period to period the slave agents report their aftermath to the chief and the pursuing reports are recorded. They are described by the chief as and after required. To cut the number of overhead, a chief could select to bypass on the gathered data to the locale server from period to time. A chief agent can revoke and reassign a slave established on the movement of the object. Precise gesture strength thresholds law this. Also, in case the object moves out of the detecting span of the chief agent, there is a ability for a reelection procedure and selection of a new chief agent.

The above procedure can be understood by Fig.4.1.1 in that till the period the object moves in the working span (A0), the elected nodes do the detecting, as quickly as the object moves to the backup spans defines (A1, A2 and A3), the sensor node farthest from the object is revoked as the gesture strength falls below the threshold level.

© 2017, IRJET

|

Impact Factor value: 5.181

Figure-5: Position Approximation Algorithm It has been consented that the sensors can discriminate objects that could be due to the exceptional ID sent by the objects. Thus, the nature considers several objects even though the method has been delineated for one object.

Sensors normally have four modes of operation: Transmit, Receive, Inactive and Nap established on the procedure they are performing. Every single of the nodes has a disparate level of manipulation consumption. Initially, all the sensors work in the Inactive mode of procedure in that they unceasingly notice each object inside their detecting scope.

The variance of gesture strength alongside distance is measured and flattened out employing a regression quadratic polynomial. Gesture strengths can vary and the measurements are not extremely accurate. Thus, there are always a little errors amid approximated distances and actual distances. The trilateration method utilized basically uses the intersection of three circles to find out the precise spatial coordinates of the object. In a real globe scenario, the three circles not ever intersect at a public point as shown in

|

ISO 9001:2008 Certified Journal

| Page 126

International Research Journal of Engineering and Technology (IRJET)

e-ISSN: 2395-0056

Volume: 04 Issue: 08 | Aug -2017

p-ISSN: 2395-0072

www.irjet.net

fig 4.1.2. Hence, to minimize error, an approximation algorithm has been utilized in that the difference purpose is minimized. The difference purpose, x, y s is computed as

The projected modeling was a easy scheme lacking convoluted processing. They have uses MATLAB to conduct the simulation and numerical analyses to find the optimal modeling variables. The analyses alongside disparate variables will contain object advancing ideal, detecting radius, ideal weighting value�, and power-level rising ratio k of bordering sensor nodes. Contrasted alongside our work their localization error is on average larger.

-rc|

7. CONCLUSION AND FUTURE WORK

where A, B and C are the sensor nodes and (xA ,yA), (xB ,yB) and (xC ,yC) are their center coordinates and rA, rB and rC are the distances to A, B and C from any point (x,y) on the plane.

In this paper we have discovered a hybrid localization method that uses both RSS and Triangulation methods.

Joining RSS and Triangulation provides countless gains making it outperform methods that uses just RSS technique.

For example, a hybrid node is capable of localizing one more node by itself lacking each assistance from supplementary nodes, and at the alike period it provides a higher localization accuracy after contrasted to nodes that merely use RSS. In supplement, the result of multipath on the presentation of the hybrid method has been illustrated.

Upcoming orders could contain studying the encounter of hybrid method (RSS/Triangulation) on a real Network and the best method to use such node in a given nature.

6. RESULTS AND ANALYSIS In our proposed work Total Average End to End Delay between nodes is around 0.065 seconds which is sufficient for deploying real world sensor nodes using Hop by Hop location tracking mechanisms. The authors have industrialized and counseled the mechanism and procedure to ideal the locale estimation for object pursuing in largescale WSNs. The projected modeling was a simple scheme without complex processing which uses range free positioning knowledge as well as centralized data. The procedure and modeling of location estimation for object pursuing in WSN.

REFERENCES [1]

[2]

[3] Figure-6: End to End Delay between nodes in seconds

[4]

[5]

[6] Figure-7: Estimation Error with Respect to time compared with Base paper (blue) [12] and Proposed work APIT scheme (red).

Š 2017, IRJET

|

Impact Factor value: 5.181

|

Sabokrou, M.; Fathy, M.; Hoseni , M., "Intelligent target tracking in Wireless Visual Sensor Networks", IEEE, Computer and Knowledge Engineering (ICCKE), 2012 2nd International Conference on, 2012 Yadav, A.; Naik, N.; Ananthasayanam, M.R.; Gaur, A.; Singh, Y.N.,"A constant gain Kalman filter approach to target tracking in wireless sensor networks",IEEE,Industrial and Information Systems (ICIIS), 2012 7th IEEE International Conference on, 2012 Gopakumar, A., and Lillykutty Jacob. "Localization in wireless sensor networks using particle swarm optimization." In Wireless, Mobile and Multimedia Networks, 2008. IET International Conference on, pp. 227-230. IET, 2008.

Tseng, Yu-Chee, Sheng-Po Kuo, Hung-Wei Lee, and Chi-Fu Huang. "Location tracking in a wireless sensor network by mobile agents and its data fusion strategies." The Computer Journal 47, no. 4 (2004): 448-460.

Chan, Frankie KW, and Hing-Cheung So. "Accurate distributed range-based positioning algorithm for wireless sensor networks." IEEE Transactions on Signal Processing 57, no. 10 (2009): 4100-4105.

He, Tian, Chengdu Huang, Brian M. Blum, John A. Stankovic, and Tarek Abdelzaher. "Range-free localization schemes for large scale sensor networks." In Proceedings of the 9th annual

ISO 9001:2008 Certified Journal

| Page 127

[7]

[8]

[9]

[10]

[11]

[12]

International Research Journal of Engineering and Technology (IRJET)

e-ISSN: 2395-0056

Volume: 04 Issue: 08 | Aug -2017

p-ISSN: 2395-0072

www.irjet.net

international conference on Mobile computing and networking, pp. 81-95. ACM, 2003.

Liu, Chong, Kui Wu, and Tian He. "Sensor localization with ring overlapping based on comparison of received signal strength indicator."

In Mobile Ad-hoc and Sensor Systems, 2004 IEEE International Conference on, pp. 516-518. IEEE, 2004.

Shen, Hong, Zhi Ding, SouraDasgupta, and Chunming Zhao. "Multiple source localization in wireless sensor networks based on time of arrival measurement." IEEE Transactions on Signal Processing 62, no. 8 (2014): 1938-1949.

Ahmed, Hesham Ibrahim, Ping Wei, Imran Memon, Yanshen Du, and Wei Xie. "Estimation of time difference of arrival (TDoA) for the source radiates BPSK signal." IJCSI Int. J. Comput. Sci 10 (2013): 164-71.

Malajner, Marko, DušanGleich, and Peter Planinšic.

"Angle of arrival measurement using multiple static monopole antennas." IEEE Sensors Journal 15, no. 6 (2015): 3328-3337.

Peng, Jing, JunxiaJia, and Tao Liu. "WSN Node Localization Algorithm Based On Range Free Localization." In 2015 International Industrial Informatics and Computer Engineering Conference.

Atlantis Press, 2015.

Wu, Huafeng, Lei Yang, Ling Liu, Ming Xu, and Xinping Guan. "Real-Time Localization Algorithm for Maritime Search and Rescue Wireless Sensor Network." International Journal of Distributed Sensor Networks 2013 (2013).

© 2017, IRJET

|

Impact Factor value: 5.181

|

ISO 9001:2008 Certified Journal

| Page 128