SlideShare a Scribd company logo
1 of 11
Download to read offline
Computer Engineering and Intelligent Systems                                                  www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.7, 2011


    A Robust Frame of WSN Utilizing Localization Technique
                                         J.Jasper Gnana Chandran
                         Department of EEE, Francis Xavier Engineering College
                                  Tirunelveli - 627003, Tamil Nadu, India
                          Tel: +91-9443201279 E-mail: jasper_fx@yahoo.co.uk


                                                S. P. Victor
                   Department of Computer Science, St. Xavier’s College (Autonomous)
                                  Tirunelveli - 627003, Tamil Nadu, India
                         Tel: +91-9486041594     E-mail: victorsp@rediffmail.com


Received: 2011-10-23
Accepted: 2011-10-29
Published: 2011-11-04


Abstract
Wireless sensor networks are becoming increasingly popular due to their low cost and wide applicability to
support a large number of diverse application areas. Localization of sensor nodes is a fundamental
requirement that makes the sensor data meaningful. A wireless sensor network (WSN) consist of spatially
distributed autonomous devices using sensors to monitor cooperatively physical or environmental
conditions such as temperature, sound, vibration, pressure, motion or pollutants at different locations. The
development of wireless sensor networks was originally motivated by a military application like battlefield
surveillance. Node localization is required to report the origin of events, assist group querying of sensors,
routing and to answer questions on the network coverage. One of the fundamental challenges in wireless
sensor network is node localization. This paper discusses different approaches of node localization
discovery in wireless sensor networks. The overview of the schemes proposed by different scholars for the
improvement of localization in wireless sensor networks is also presented.
Keywords: Localization, Particle Swarm Optimization, Received Signal Strength, Angle of Arrival.


1. Introduction+
A wireless sensor network consists of a large set of inexpensive sensor nodes with wireless communication
interface. These sensor nodes have limited processing and computing resources. Thus algorithms designed
for wireless sensor networks need to be both memory and energy efficient. In most of the algorithms for
wireless sensor network, it is assumed that the sensor nodes are aware not only of their locations but also
the locations of their nearby neighbors. Hence, localization is a major research area in wireless sensor
networks. But, this problem has not been studied extensively in three dimensional WSNs due to various
reasons. However, in some real world application scenario the deployed sensor network operates in a three
dimensional volume rather than in a two dimensional area. Deployment of WSNs for surveillance of
terrains, study of underwater ecosystem, space monitoring and exploration are some of the examples of
such applications.

Localization in sensor networks can be defined as ``identification of sensor node's position''. For any
wireless sensor network, the accuracy of its localization technique is highly desired. The existing algorithm
36 | P a g e
www.iiste.org
Computer Engineering and Intelligent Systems                                                  www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.7, 2011

for localization can be broadly classified into two basic categories:
1. Range Based Technique
2. Range Free Technique

In range based mechanisms, the location of a sensor node can be determined with the help of the distance or
angle metrics. These metrics are Time of Arrival (ToA), Time Difference of Arrival (TDoA), Angle of
Arrival (AoA), Received Signal Strength Indicator (RSSI). Though range based techniques are highly
accurate they should be equipped with highly expensive hardware moreover a lot of computation work is
required. It increases the cost of the network and is inefficient in terms of computations. The various range
based techniques are Radio Interferometric Measurement (RIM) (Gezici et al. 2008), Multidimensional
Scaling (MDS) (Cheung et al. 2005), 3D - Landscape (Ji et al. 2004), DV-distance, DV-hop, Euclidean
distance (Costa et al. 2006) etc.

In range free techniques, the position of sensor node is identified on the basis of information transmitted by
nearby anchor node or neighboring nodes based on hop or on triangulation basis. The various range free
techniques are APIT (Boukerche et al. 2007) chord selection approach three dimensional multilateration
approach SerLOC centroid scheme etc . Many more techniques are discussed in (Sayed et al. 2005). The
range free techniques have an error in accuracy up to 10% of the communication range of individual node
(Patwari et al. 2003). But, these techniques are much cheaper compared to the range based techniques.

Energy efficiency is a critical issue in wireless sensor networks (WSNs) since the sensor nodes' batteries
have limited capacit (Boukerche et al. 2007). Once a WSN is in place, its lifetime must last as long as
possible based on the initially provided amount of energy. Consequently, techniques minimizing
energy-consumption are required to improve the network lifetime. A widely employed mechanism is to
schedule sensor nodes activity so that redundant nodes enter the sleep mode as often as possible. So far
various studies have addressed the energy optimization issue without considering the impact of the number
of reporting nodes on the WSN performance. In other words, how the network lifetime evolves with respect
to the number of active reporting nodes.

2. Related Works
Localization approaches can be classified into range-based approaches, and range free approaches. The
main difference between them is the way to get the distance information. The former relies on distance or
angle measurement with radio signals such as TDoA (Doherty et al. 2001) and AoA, and needs expensive
measurement hardware. The latter uses special protocols to eliminate the need for radio signal measurement.
The proposed DRL is a range-free mobile localization approach for outdoor environments.

(Gezici et al. 2008) is a range-based approach for mobile WSNs which use only local information. It uses
range measurements between nodes to build a network co-ordinate system. It has shown that despite
possible range measurement errors and motion of the nodes, the algorithm provides enough stability and
location accuracy. However, the amount of information exchange as well as graph calculation is quite huge,
and it needs hardware capable of supporting the TOA to obtain the range between two mobile nodes.

DV-Hop (Patwari et al. 2003) is used in static wireless networks which make use of multi-hop information.
It is a range-free approach. An anchor floods its location to the whole network with a packet containing the
anchor’s position. With hop-count from that anchor and average hop-distance, this node can derive its own
position by triangulation. In the triangulation, the distance between a node and an anchor is estimated as the
multiplication of hop-count and hop-distance.

MCL (Sayed et al. 2005), is a range-free approach for mobile WSNs. MCL periodically updates its samples,
which are node's probabilistic distribution of locations by repeating the prediction and filtering process. It
predicts samples’ next time step distribution with node velocity and filters out impossible samples with new
37 | P a g e
www.iiste.org
Computer Engineering and Intelligent Systems                                                   www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.7, 2011

observations. Observations include the conditions that the node hears a seed directly (i.e. they are one-hop
away), or some of the node’s neighbors are one-hop away from certain seeds (i.e. such seeds are two-hop
away from the node). However, if a node has no seed within two-hop away from it, it cannot locate itself.
Also, the prediction and filtering process may consume lots of iterations if it keeps failure of guessing a
possible position. Moreover, this repeating failure condition may be an infinite loop if none of the samples
can be filtered successfully. MCL has no solution to this.

Recently (Gezici et al. 2008), a new approach to source localization was proposed. It utilizes Received
Signal Strength (RSS) measurements. In particular, the spatially distributed sensors measure the power of
the signal due to the source that arrives at their location. In the sequel, using an energy-decay model, each
sensor is able to extract some information about its distance to the source of interest. Finally, the required
location of the source is derived by proper fusion of the information extracted at a number of active sensor
nodes. Note that a sensor node is characterized as active if its measurement is greater than a predetermined
threshold. In order to avoid the ambiguities that arise due to the unknown transmit power of the source it
was proposed to compute ratios of measurements taken at pairs of active sensors.

In (Biswas et al. 2006), maximum likelihood multiple-source localization based on RSS measurements was
considered. In the problem of source localization was formulated as a coverage problem and estimates of
the necessary sensor density which can guarantee a localization error bound were derived. In (Albowicz et
al. 2001), a distributed “incremental sub gradient” algorithm was proposed to yield iteratively the source
location estimate.

More recently, a distributed localization algorithm enjoying good convergence properties was proposed. In
(Sayed et al. 2005), a non-linear cost function for localization was proposed and it was proved that its
gradient descent minimization is globally converging. However, all the aforementioned approaches require
knowledge of the energy decay model and/or the transmit power of the source of interest.

In (Doherty et al. 2001), the case of unavailable information about the energy decay model and the transmit
power of the source (i.e. model-independent case) was considered. The location of the source was derived
by properly averaging the locations of active sensor nodes.

3. Approaches to measure distance between two nodes
There are different ranging approaches to measure distance between two nodes.
TOA: time of arrive
AOA: anger of arrive
TDOA: time difference of arrive
RSSI: Received signal strength indication
Noise issue:
Interferometric:

For example, ranging method used in GPS is TOA. By multiplying the time shift to the speed of radio
propagation, we can calculate the distance. The popular approaches used for ranging in WSN are TDOA. A
mote working in TDOA is often equipped with a sound signal or ultra-sound signal transceiver in addition
to the radio transceiver. When a mote does ranging, it sends simultaneously RF signal and sound signal,
known as piggy-back signals. Time stamps are often inserted in the radio messages. When a mote receives a
radio message indicating that a sound signal is accompanying with it, the mote start a counter to count the
time shift between radio arriving and sound arriving. Compared to the propagation speed of radio, the
sound speed is quite slow. We can consider that the time shift of these two signals arriving at the receiver is
the time needed by the sound signal flying from the transmitter to the receiver. By multiplying the time
shift to the speed of wave, we can calculate the distance between these two nodes.


38 | P a g e
www.iiste.org
Computer Engineering and Intelligent Systems                                                      www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.7, 2011

4. Proposed Method
The ad hoc localization problem (AHLP) has the task of finding the physical location of all nodes. Only the
subset of nodes named as location-aware (LA) nodes, know their exact location.

Given a network graph G = (V, E) where {Vgps} is a subset of the nodes in {V} i.e.{Vgps} ⊂ {V} are LA
nodes. The locations of non-LA nodes can be found by {V} – {Vgps}. .

The AHLP is non-trivial for a number of reasons:
To find the location,
1. A node should know
• The locations of at least three LA nodes
• Distance between the node and any of these LA nodes.
2. Or it should measure
• The distance and an (absolute) angle between any one LA node and node
Though the measurements are correct, it is not possible for the LA nodes to surround each regular node.
This is because
• MANETs may be randomly arranged
• Only a small percentage of nodes are LA nodes.

Hence estimating node locations based on other nodes’ location (multi-hop information) is a better solution
for this. Some sensory devices are needed to provide such reading the algorithms require distance or angle
measurements. All nodes do not have the same sensory capacity. These algorithms need to work in a
heterogeneous environment with different location sensory capacities.

Let us first consider the scenario in which the sensor reading consists of no measurement noise interference.
In order to locate a node, at least three RSSI readings from different LA nodes and only two AoA readings
are needed. Only one RSSI reading and one AoA reading from the same LA nodes are essential to locate the
node when both measurement types are available. In such a case, better coverage must be provided by AoA
readings for locating more nodes than RSSI readings.

In PSO the individuals are termed as particles. These particles spread in the multi- dimensional search
space representing a possible solution to the multidimensional problem. Each particle has fitness values for
optimization and it can be evaluated by the fitness function. These particles have velocities to direct their
movements. Initially PSO contains a group of random solutions and by means of updating generations it
searches for optimal solution.

In iteration, updating of each particle is done by following two "best" factors.
Pbest: It is the best fitness the particle has achieved so far and stored in memory.
Gbest: It is the "global best" value obtained so far by any particle in the population
Lbest: It is the "best" value obtained so far by any particle in the population in its topological neighbors.

After every iteration, if more optimal solution is found by the particle and population then the pbest and
gbest (or lbest) are updated respectively. The fitness function, f, is based on the signal strength (RSSI) and
an angle of arrival (AoA) of the LA node. For a node n, the fitness function can be calculated by

 f = A o A(n) / RSSI(n)

The position of the particle is based on its previous position, n p and its velocity over a unit of time:

Pn+1 = Pn + Vn+1


39 | P a g e
www.iiste.org
Computer Engineering and Intelligent Systems                                                    www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.7, 2011

The velocity of a particle is computed as follows:
The pseudo code is as follows:
1. Get AoA and RSSI values for LA node.
2. Initialize population with random positions and velocities
3. Non LA nodes associate with another node based on the maximum signal strength received from each
LA node, thus forming mini swarms
4. Evaluate fitness of each particle in swarm as per (2).
5. For each particle in each mini swarm
5.1. Find particle best ( pbest ) – compute fitness of particle.
5.2. If current pbest pbest < , then
            5.2.1. pbest = current Pbest
         5.2.2. location current location = Pbest
5.3. End if
5.4. Find local best ( lbest ) for the mini swarm
5.5. Lbest location = location of min (all pbest in this mini swarm)
5.6. Update velocity of particle as per (3)
5.7. Update position of particle as per (2)
6. End For
7. Repeat steps 5.1 through 5.7 until termination condition is reached.

5. Evaluation Methods

Measurement error is in proportion to the distance between the sensor and the target. A mean of the
absolute value is 10% of distance, for example, if distance between a sensor and a target is 10m,
measurement error is given as a random value between -2m and 2m. Measurement error is independent of
distance and the mean of the absolute value is 1m. This is based on the assumption that sensors near the
target do not always measure the precise effects of such obstacles. This follows the upper boundaries of
both the above two models. If a system can manage such a large error model, it’s no exaggeration to say
that it is free of measurement error.

6. Challenges exist when implementing localization in WSN

As we discussed earlier, WSN is a resourced constraint network. Because of the battery power supply and
in order to avoid interference, the effective communication range is limited to some extent. The sensed data
may arrive at the destination via multi-hop. The reliability of a routing path is not guaranteed, so the routing
path between the data source and data sink may vary with time. When we try to use multi-hop routing path
to estimate the distance between a node and the beacons, the errors caused in these approximation have
adverse impact on the accuracy of localization in WSN.

Another factor influencing localization accuracy is the ranging errors. Whatever kind of ranging approaches
is adopted, there will always exist some noise in the ranging measurements. Moreover, because the
characteristics between each transmitter-receiver pair may not be the same, this kind of ununiformity
between different motes also exerts negative impact on the accuracy of localization. Before we begin to
implement localization in WSN, we will have to do the simulation first to see what accuracy is expected
concerning localization in multi-hop WSN.

7. How to simulate localization processes using NS2?

If we have a network topology we know the coordinates of each node in the topology and also the distance
matrix between each node. However, as simulation input, we use only part of the distance matrix and
choose three typical nodes as beacons. The localization goal is to figure out the unknown coordinates of
other nodes except the beacons. After that, we can evaluate the error distributions by comparing the
40 | P a g e
www.iiste.org
Computer Engineering and Intelligent Systems                                                   www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.7, 2011

estimated coordinates of each node and their original coordinates.

By specifying the number of nodes, distance of grid unit and the random noise relative to the spacing of
each grid, we can programme to generate a random pattern of the network which means that we can get an
array of nodes with the known co-ordinates and also we know the full distance matrix between any nodes.
In order to simulate the process of localization, instead of using the full distance matrix, we will have to
reduce the direct connectivity in the full distance matrix.

8. Experimental Results

We show that each distinct region formed in this manner can be uniquely identified by a location sequence
that represents the distance ranks of reference nodes to that region. We present an algorithm to construct the
location sequence table that maps all these feasible location sequences to the corresponding regions by
using the locations of the reference nodes. This table is used to localize an unknown node (that is, the node
whose location has to be determined) as follows. The unknown node first determines its own location
sequence based on the measured strength of signals between itself and the reference nodes. It then searches
through the location sequence table to determine the “nearest” feasible sequence to its own measured
sequence. The centroid of the corresponding region is taken to be its location.

In order to evaluate the described approaches to sensor network localization, many numerical tests were
performed. We performed a variety of simulation experiments to cover a wide range of network (number of
nodes), the radio range, and the distance measurement error and computation time. The key metric for
evaluating all the listed methods was the accuracy of the location estimates which versus the deployment,
communication and computation cost. The table 1 shows the transmission ranges of different networks

Due to measurement uncertainty, it is difficult to find a good metric to compare the results obtained using
different localization methods. The localization error is denoted as LE. It is expressed as a percentage error.
It is normalized with respect to the radio range to allow a comparison of results obtained for different size
and range networks. Figure 6 shows that the localization error decreases as the number of nodes increases.
Increasing the density of anchors makes localization easier, but it increases the network size and
deployment cost. The value of the transmission range r determines the number of neighbours of each node
in the network. The radio range considered from the interval [0.21 – 0.02].
9. Conclusion
In the sensor networks the nodes move randomly within the coverage area. The problem considered in this
paper is the exploration of an unknown environment with the goal of finding the nodes at an unknown
location(s) using location aware (LA) nodes. This work has demonstrated the use of a distributed PSO
algorithm with a novel adaptive RSS weighting factor and angle of arrival AoA factor to guide LA nodes
for locating target(s) in high risk environments. Essentially, to reduce the energy consumption only a small
number of sensors are activated to track and localize the target; while others are turned into sleep mode.
The proposed method is evaluated on various mobility models and localization is performed by learning
movement patterns and their parameters. The results show that our approach is better than the previously
proposed approaches for range free localization techniques for three dimensional wireless sensor network in
terms of beacon overhead, localization time, localization error, computation and space required for any
per-cent of mobile sensor nodes.

References

Albowicz.J, A. Chen, and L. Zhang, (2001) “Recursive position estimation in sensor networks,” in Proc. of
International Conference on Network Protocols, pp. 35–41.


41 | P a g e
www.iiste.org
Computer Engineering and Intelligent Systems                                               www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.7, 2011

Biswas.P, T. Liang, T. Wang, and Y. Ye, (2006) “Semidefinite programming based algorithms for sensor
network localization,” ACM Transactions on Sensor Networks (TOSN), vol. 2, no. 2, p. 220.

Boukerche, H. Oliveira, E. Nakamura, and A. Loureiro, (2007) “Localization systems for wireless sensor
networks,” IEEE Wireless Communications, vol. 14, no. 6, pp. 6–12.

Cheung.K and H. So, (2005) “A multidimensional scaling framework for mobile location using
time-of-arrival measurements,” IEEE Trans. Signal Process., vol. 53, no. 2, pp. 460–470.

Costa.J, N. Patwari, and A. Hero III, (2006) “Distributed weighted-multidimensional scaling for node
localization in sensor networks,” ACM Transactions on Sensor Networks (TOSN), vol. 2, no. 1, p. 64.

Doherty.L, K. Pister, and L. El Ghaoui, (2001) “Convex position estimation in wireless sensor networks,”
in Proc. of IEEE INFOCOM, vol. 3, pp. 1655–1663.

Gezici.S, (2008) “A survey on wireless position estimation,” Wireless Personal Communications, vol. 44,
no. 3, pp. 263–282.

Gezici.S, I. Guvenc, and Z. Sahinoglu, (2008) “On the Performance of Linear Least-Squares Estimation in
Wireless Positioning Systems,” in Proc. of IEEE International Conference on Communications (ICC), pp.
4203–4208.

Ji.X and H. Zha, (2004) “Sensor positioning in wireless ad hoc sensor networks using multidimensional
scaling,” in Proc. of IEEE INFOCOM, vol. 4, pp. 2652–2661.

Mao.G, B. Fidan, and B. Anderson, (2007) “Wireless sensor network localization techniques,” Computer
Networks, vol. 51, no. 10, pp. 2529–2553.

Niculescu.D and B. Nath, “Ad hoc positioning system (APS),” in Proc. of IEEE GLOBECOM, vol. 5, pp.
2926–2931.

Patwari.N, A. Hero, M. Perkins, N. Correal, and R. O’Dea, (2003) “Relative location estimation in wireless
sensor networks,” IEEE Transactions on Signal Processing, vol. 51, no. 8, pp. 2137–2148.

Patwari.N, J. Ash, S. Kyperountas, I. Hero, A.O., R. Moses, and N. Correal, (2005) “Locating the nodes:
co-operative localization in wireless sensor networks,” IEEE Signal Process. Mag., vol. 22, pp. 54–69.

Sayed, A. Tarighat, and N. Khajehnouri, (2005) “Network-based wireless location: challenges faced in
developing techniques for accurate wireless location information,” IEEE Signal Process. Mag., vol. 22, no.
4, pp. 24–40.

Savvides, C. Han, and M. Strivastava, (2001) “Dynamic fine-grained localization in ad-hoc networks of
sensors,” in Proc. of International Conference on Mobile Computing and Networking, pp. 166–179.

Shang.Y, W. Ruml, Y. Zhang, and M. Fromherz,( 2003) “Localization from mere connectivity,” in Proc. of
ACM International Symposium on Mobile Ad Hoc Networking & Computing, pp. 201–212.

Srirangarajan.S, A. Tewfik, and Z. Luo, (2008) “Distributed Sensor Network Localization Using SOCP
Relaxation,” IEEE Transactions on Wireless Communications, vol. 7, no. 12, p. 1.




42 | P a g e
www.iiste.org
Computer Engineering and Intelligent Systems                                www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.7, 2011




                       Figure 1.   Complexity of Wireless Sensor Networks




                        Figure 1. Complexity of Wireless Sensor Networks




                                   Figure 2.   Node Distribution




43 | P a g e
www.iiste.org
Computer Engineering and Intelligent Systems                                             www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.7, 2011




                                     Figure 3. Node Connectivity
                        a) An unknown node determines its reference nodes;
                   b) The unknown node estimates its distance to these references;
                  c) The unknown node computes its position using multilateration;
    d) Now the unknown node becomes a settled node and assists other nodes in position estimation.




                                   Figure 4. Centroid Measurement


44 | P a g e
www.iiste.org
Computer Engineering and Intelligent Systems                                                                                          www.iiste.org
ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online)
Vol 2, No.7, 2011



                                                                                 Localization Accuracy

                                                  35

                       L o c a liz a tio n E r r o r
                                                  30
                                                  25
                                                  20
                                                  15
                                                  10
                                                   5
                                                   0
                                                              1    2   3     4    5    6     7    8      9   10   11 12     13   14
                                                                                           No.of Nodes


                      Figure 5. Impact of Nodes with Localization Accuracy



                                                                                 Localization Accuracy

                                                  2.5
                       L o c a l i z a ti o n E r r o r




                                                          2
                                                  1.5
                                                          1
                                                  0.5
                                                          0
                                                               1   2    3    4    5    6     7    8      9   10   11   12   13   14
                                                                                           Radio Range


                                                    Figure 6. Radio Range Vs Localization Accuracy

                                                              Table 1. Number of Nodes Vs Radio Range
                                                              Number of Nodes                            Radio Range
                                                                       100                                   0.21
                                                                       200                                   0.17
                                                                       500                                   0.15
                                                                       1000                                  0.11
                                                                       1500                                  0.08
                                                                       2000                                  0.06
                                                                       2500                                  0.04
                                                                       3000                                  0.02




45 | P a g e
www.iiste.org
International Journals Call for Paper
The IISTE, a U.S. publisher, is currently hosting the academic journals listed below. The peer review process of the following journals
usually takes LESS THAN 14 business days and IISTE usually publishes a qualified article within 30 days. Authors should
send their full paper to the following email address. More information can be found in the IISTE website : www.iiste.org

Business, Economics, Finance and Management               PAPER SUBMISSION EMAIL
European Journal of Business and Management               EJBM@iiste.org
Research Journal of Finance and Accounting                RJFA@iiste.org
Journal of Economics and Sustainable Development          JESD@iiste.org
Information and Knowledge Management                      IKM@iiste.org
Developing Country Studies                                DCS@iiste.org
Industrial Engineering Letters                            IEL@iiste.org


Physical Sciences, Mathematics and Chemistry              PAPER SUBMISSION EMAIL
Journal of Natural Sciences Research                      JNSR@iiste.org
Chemistry and Materials Research                          CMR@iiste.org
Mathematical Theory and Modeling                          MTM@iiste.org
Advances in Physics Theories and Applications             APTA@iiste.org
Chemical and Process Engineering Research                 CPER@iiste.org


Engineering, Technology and Systems                       PAPER SUBMISSION EMAIL
Computer Engineering and Intelligent Systems              CEIS@iiste.org
Innovative Systems Design and Engineering                 ISDE@iiste.org
Journal of Energy Technologies and Policy                 JETP@iiste.org
Information and Knowledge Management                      IKM@iiste.org
Control Theory and Informatics                            CTI@iiste.org
Journal of Information Engineering and Applications       JIEA@iiste.org
Industrial Engineering Letters                            IEL@iiste.org
Network and Complex Systems                               NCS@iiste.org


Environment, Civil, Materials Sciences                    PAPER SUBMISSION EMAIL
Journal of Environment and Earth Science                  JEES@iiste.org
Civil and Environmental Research                          CER@iiste.org
Journal of Natural Sciences Research                      JNSR@iiste.org
Civil and Environmental Research                          CER@iiste.org


Life Science, Food and Medical Sciences                   PAPER SUBMISSION EMAIL
Journal of Natural Sciences Research                      JNSR@iiste.org
Journal of Biology, Agriculture and Healthcare            JBAH@iiste.org
Food Science and Quality Management                       FSQM@iiste.org
Chemistry and Materials Research                          CMR@iiste.org


Education, and other Social Sciences                      PAPER SUBMISSION EMAIL
Journal of Education and Practice                         JEP@iiste.org
Journal of Law, Policy and Globalization                  JLPG@iiste.org                       Global knowledge sharing:
New Media and Mass Communication                          NMMC@iiste.org                       EBSCO, Index Copernicus, Ulrich's
Journal of Energy Technologies and Policy                 JETP@iiste.org                       Periodicals Directory, JournalTOCS, PKP
Historical Research Letter                                HRL@iiste.org                        Open Archives Harvester, Bielefeld
                                                                                               Academic Search Engine, Elektronische
Public Policy and Administration Research                 PPAR@iiste.org                       Zeitschriftenbibliothek EZB, Open J-Gate,
International Affairs and Global Strategy                 IAGS@iiste.org                       OCLC WorldCat, Universe Digtial Library ,
Research on Humanities and Social Sciences                RHSS@iiste.org                       NewJour, Google Scholar.

Developing Country Studies                                DCS@iiste.org                        IISTE is member of CrossRef. All journals
Arts and Design Studies                                   ADS@iiste.org                        have high IC Impact Factor Values (ICV).

More Related Content

What's hot

Accurate and Energy-Efficient Range-Free Localization for Mobile Sensor Networks
Accurate and Energy-Efficient Range-Free Localization for Mobile Sensor NetworksAccurate and Energy-Efficient Range-Free Localization for Mobile Sensor Networks
Accurate and Energy-Efficient Range-Free Localization for Mobile Sensor Networksambitlick
 
ENERGY EFFICIENT MULTIHOP QUALITY PATH BASED DATA COLLECTION IN WIRELESS SENS...
ENERGY EFFICIENT MULTIHOP QUALITY PATH BASED DATA COLLECTION IN WIRELESS SENS...ENERGY EFFICIENT MULTIHOP QUALITY PATH BASED DATA COLLECTION IN WIRELESS SENS...
ENERGY EFFICIENT MULTIHOP QUALITY PATH BASED DATA COLLECTION IN WIRELESS SENS...Editor IJMTER
 
Wireless Sensor Network using Particle Swarm Optimization
Wireless Sensor Network using Particle Swarm OptimizationWireless Sensor Network using Particle Swarm Optimization
Wireless Sensor Network using Particle Swarm Optimizationidescitation
 
Wireless Sensor Network Based Clustering Architecture for Cooperative Communi...
Wireless Sensor Network Based Clustering Architecture for Cooperative Communi...Wireless Sensor Network Based Clustering Architecture for Cooperative Communi...
Wireless Sensor Network Based Clustering Architecture for Cooperative Communi...ijtsrd
 
E FFICIENT E NERGY U TILIZATION P ATH A LGORITHM I N W IRELESS S ENSOR...
E FFICIENT  E NERGY  U TILIZATION  P ATH  A LGORITHM  I N  W IRELESS  S ENSOR...E FFICIENT  E NERGY  U TILIZATION  P ATH  A LGORITHM  I N  W IRELESS  S ENSOR...
E FFICIENT E NERGY U TILIZATION P ATH A LGORITHM I N W IRELESS S ENSOR...IJCI JOURNAL
 
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...Editor IJCATR
 
Bidirectional data centric routing protocol to improve the energy efficiency ...
Bidirectional data centric routing protocol to improve the energy efficiency ...Bidirectional data centric routing protocol to improve the energy efficiency ...
Bidirectional data centric routing protocol to improve the energy efficiency ...prj_publication
 
Wireless Sensor Network: Topology Issues
Wireless Sensor Network: Topology IssuesWireless Sensor Network: Topology Issues
Wireless Sensor Network: Topology Issuesijsrd.com
 
AN EFFICIENT DEPLOYMENT APPROACH FOR IMPROVED COVERAGE IN WIRELESS SENSOR NET...
AN EFFICIENT DEPLOYMENT APPROACH FOR IMPROVED COVERAGE IN WIRELESS SENSOR NET...AN EFFICIENT DEPLOYMENT APPROACH FOR IMPROVED COVERAGE IN WIRELESS SENSOR NET...
AN EFFICIENT DEPLOYMENT APPROACH FOR IMPROVED COVERAGE IN WIRELESS SENSOR NET...csandit
 
Characterization of directed diffusion protocol in wireless sensor network
Characterization of directed diffusion protocol in wireless sensor networkCharacterization of directed diffusion protocol in wireless sensor network
Characterization of directed diffusion protocol in wireless sensor networkijwmn
 
LIFETIME IMPROVEMENT USING MOBILE AGENT IN WIRELESS SENSOR NETWORK
LIFETIME IMPROVEMENT USING MOBILE AGENT IN WIRELESS SENSOR NETWORKLIFETIME IMPROVEMENT USING MOBILE AGENT IN WIRELESS SENSOR NETWORK
LIFETIME IMPROVEMENT USING MOBILE AGENT IN WIRELESS SENSOR NETWORKJournal For Research
 
Performance of energy balanced territorial predator scent marking algorithm b...
Performance of energy balanced territorial predator scent marking algorithm b...Performance of energy balanced territorial predator scent marking algorithm b...
Performance of energy balanced territorial predator scent marking algorithm b...eSAT Publishing House
 

What's hot (18)

Accurate and Energy-Efficient Range-Free Localization for Mobile Sensor Networks
Accurate and Energy-Efficient Range-Free Localization for Mobile Sensor NetworksAccurate and Energy-Efficient Range-Free Localization for Mobile Sensor Networks
Accurate and Energy-Efficient Range-Free Localization for Mobile Sensor Networks
 
Localization
LocalizationLocalization
Localization
 
ENERGY EFFICIENT MULTIHOP QUALITY PATH BASED DATA COLLECTION IN WIRELESS SENS...
ENERGY EFFICIENT MULTIHOP QUALITY PATH BASED DATA COLLECTION IN WIRELESS SENS...ENERGY EFFICIENT MULTIHOP QUALITY PATH BASED DATA COLLECTION IN WIRELESS SENS...
ENERGY EFFICIENT MULTIHOP QUALITY PATH BASED DATA COLLECTION IN WIRELESS SENS...
 
Wireless Sensor Network using Particle Swarm Optimization
Wireless Sensor Network using Particle Swarm OptimizationWireless Sensor Network using Particle Swarm Optimization
Wireless Sensor Network using Particle Swarm Optimization
 
Wireless Sensor Network Based Clustering Architecture for Cooperative Communi...
Wireless Sensor Network Based Clustering Architecture for Cooperative Communi...Wireless Sensor Network Based Clustering Architecture for Cooperative Communi...
Wireless Sensor Network Based Clustering Architecture for Cooperative Communi...
 
O026084087
O026084087O026084087
O026084087
 
E FFICIENT E NERGY U TILIZATION P ATH A LGORITHM I N W IRELESS S ENSOR...
E FFICIENT  E NERGY  U TILIZATION  P ATH  A LGORITHM  I N  W IRELESS  S ENSOR...E FFICIENT  E NERGY  U TILIZATION  P ATH  A LGORITHM  I N  W IRELESS  S ENSOR...
E FFICIENT E NERGY U TILIZATION P ATH A LGORITHM I N W IRELESS S ENSOR...
 
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...
 
Bidirectional data centric routing protocol to improve the energy efficiency ...
Bidirectional data centric routing protocol to improve the energy efficiency ...Bidirectional data centric routing protocol to improve the energy efficiency ...
Bidirectional data centric routing protocol to improve the energy efficiency ...
 
3 ijcse-01222-5
3 ijcse-01222-53 ijcse-01222-5
3 ijcse-01222-5
 
Wireless Sensor Network: Topology Issues
Wireless Sensor Network: Topology IssuesWireless Sensor Network: Topology Issues
Wireless Sensor Network: Topology Issues
 
Dy4301752755
Dy4301752755Dy4301752755
Dy4301752755
 
AN EFFICIENT DEPLOYMENT APPROACH FOR IMPROVED COVERAGE IN WIRELESS SENSOR NET...
AN EFFICIENT DEPLOYMENT APPROACH FOR IMPROVED COVERAGE IN WIRELESS SENSOR NET...AN EFFICIENT DEPLOYMENT APPROACH FOR IMPROVED COVERAGE IN WIRELESS SENSOR NET...
AN EFFICIENT DEPLOYMENT APPROACH FOR IMPROVED COVERAGE IN WIRELESS SENSOR NET...
 
Characterization of directed diffusion protocol in wireless sensor network
Characterization of directed diffusion protocol in wireless sensor networkCharacterization of directed diffusion protocol in wireless sensor network
Characterization of directed diffusion protocol in wireless sensor network
 
LIFETIME IMPROVEMENT USING MOBILE AGENT IN WIRELESS SENSOR NETWORK
LIFETIME IMPROVEMENT USING MOBILE AGENT IN WIRELESS SENSOR NETWORKLIFETIME IMPROVEMENT USING MOBILE AGENT IN WIRELESS SENSOR NETWORK
LIFETIME IMPROVEMENT USING MOBILE AGENT IN WIRELESS SENSOR NETWORK
 
Performance of energy balanced territorial predator scent marking algorithm b...
Performance of energy balanced territorial predator scent marking algorithm b...Performance of energy balanced territorial predator scent marking algorithm b...
Performance of energy balanced territorial predator scent marking algorithm b...
 
Matlab 2013 14 papers astract
Matlab 2013 14 papers astractMatlab 2013 14 papers astract
Matlab 2013 14 papers astract
 
50120140505014
5012014050501450120140505014
50120140505014
 

Viewers also liked

Network Mnagement for WSN
Network Mnagement for WSNNetwork Mnagement for WSN
Network Mnagement for WSN@zenafaris91
 
Routing protocols of wsn
Routing protocols of wsnRouting protocols of wsn
Routing protocols of wsnAyman Adel
 
3D routing algorithm for sensor network in e-health
3D routing algorithm for sensor network in e-health3D routing algorithm for sensor network in e-health
3D routing algorithm for sensor network in e-healthVakhtang Mosidze
 
Localization & management of sensor networks
Localization & management of sensor networksLocalization & management of sensor networks
Localization & management of sensor networksRushin Shah
 
A Survey on Localization of Wireless Sensors
A Survey on Localization of Wireless SensorsA Survey on Localization of Wireless Sensors
A Survey on Localization of Wireless SensorsKarthik Mohan
 
localization in wsn
localization in wsnlocalization in wsn
localization in wsnnehabsairam
 
Localization in WSN
Localization in WSNLocalization in WSN
Localization in WSNYara Ali
 
Localization scheme for underwater wsn
Localization scheme for underwater wsnLocalization scheme for underwater wsn
Localization scheme for underwater wsnAkshay Paswan
 

Viewers also liked (8)

Network Mnagement for WSN
Network Mnagement for WSNNetwork Mnagement for WSN
Network Mnagement for WSN
 
Routing protocols of wsn
Routing protocols of wsnRouting protocols of wsn
Routing protocols of wsn
 
3D routing algorithm for sensor network in e-health
3D routing algorithm for sensor network in e-health3D routing algorithm for sensor network in e-health
3D routing algorithm for sensor network in e-health
 
Localization & management of sensor networks
Localization & management of sensor networksLocalization & management of sensor networks
Localization & management of sensor networks
 
A Survey on Localization of Wireless Sensors
A Survey on Localization of Wireless SensorsA Survey on Localization of Wireless Sensors
A Survey on Localization of Wireless Sensors
 
localization in wsn
localization in wsnlocalization in wsn
localization in wsn
 
Localization in WSN
Localization in WSNLocalization in WSN
Localization in WSN
 
Localization scheme for underwater wsn
Localization scheme for underwater wsnLocalization scheme for underwater wsn
Localization scheme for underwater wsn
 

Similar to 11.0005www.iiste.org call for paper.a robust frame of wsn utilizing localization technique -36-46

Node Deployment in Homogeneous and Heterogeneous Wireless Sensor Network
Node Deployment in Homogeneous and Heterogeneous Wireless Sensor NetworkNode Deployment in Homogeneous and Heterogeneous Wireless Sensor Network
Node Deployment in Homogeneous and Heterogeneous Wireless Sensor NetworkIJMTST Journal
 
Multiagent based multipath routing in wireless sensor networks
Multiagent based multipath routing in wireless sensor networksMultiagent based multipath routing in wireless sensor networks
Multiagent based multipath routing in wireless sensor networksijwmn
 
DATA TRANSMISSION IN WIRELESS SENSOR NETWORKS FOR EFFECTIVE AND SECURE COMMUN...
DATA TRANSMISSION IN WIRELESS SENSOR NETWORKS FOR EFFECTIVE AND SECURE COMMUN...DATA TRANSMISSION IN WIRELESS SENSOR NETWORKS FOR EFFECTIVE AND SECURE COMMUN...
DATA TRANSMISSION IN WIRELESS SENSOR NETWORKS FOR EFFECTIVE AND SECURE COMMUN...IJEEE
 
Machine Learning Based Watchdog Protocol for Wormhole Attack Detection in Wir...
Machine Learning Based Watchdog Protocol for Wormhole Attack Detection in Wir...Machine Learning Based Watchdog Protocol for Wormhole Attack Detection in Wir...
Machine Learning Based Watchdog Protocol for Wormhole Attack Detection in Wir...IJCSIS Research Publications
 
An Approach of Mobile Wireless Sensor Network for Target Coverage and Network...
An Approach of Mobile Wireless Sensor Network for Target Coverage and Network...An Approach of Mobile Wireless Sensor Network for Target Coverage and Network...
An Approach of Mobile Wireless Sensor Network for Target Coverage and Network...IRJET Journal
 
Ijarcet vol-2-issue-3-916-919
Ijarcet vol-2-issue-3-916-919Ijarcet vol-2-issue-3-916-919
Ijarcet vol-2-issue-3-916-919Editor IJARCET
 
LOCALIZATION ALGORITHM USING VARYING SPEED MOBILE SINK FOR WIRELESS SENSOR NE...
LOCALIZATION ALGORITHM USING VARYING SPEED MOBILE SINK FOR WIRELESS SENSOR NE...LOCALIZATION ALGORITHM USING VARYING SPEED MOBILE SINK FOR WIRELESS SENSOR NE...
LOCALIZATION ALGORITHM USING VARYING SPEED MOBILE SINK FOR WIRELESS SENSOR NE...ijasuc
 
Effective range free localization scheme for wireless sensor network
Effective range  free localization scheme for wireless sensor networkEffective range  free localization scheme for wireless sensor network
Effective range free localization scheme for wireless sensor networkijmnct
 
A NOVEL APPROACH TO DETECT THE MOVEMENT OF TARGET IN WIRELESS SENSOR NETWORKS
A NOVEL APPROACH TO DETECT THE MOVEMENT OF TARGET IN WIRELESS SENSOR NETWORKSA NOVEL APPROACH TO DETECT THE MOVEMENT OF TARGET IN WIRELESS SENSOR NETWORKS
A NOVEL APPROACH TO DETECT THE MOVEMENT OF TARGET IN WIRELESS SENSOR NETWORKSEditor IJMTER
 
Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107Editor IJARCET
 
Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107Editor IJARCET
 
Energy efficient and scheduling techniques for increasing life time in wirele...
Energy efficient and scheduling techniques for increasing life time in wirele...Energy efficient and scheduling techniques for increasing life time in wirele...
Energy efficient and scheduling techniques for increasing life time in wirele...IAEME Publication
 
A Review Study on Shortest Path in WSN to detect the Abnormal Packet for savi...
A Review Study on Shortest Path in WSN to detect the Abnormal Packet for savi...A Review Study on Shortest Path in WSN to detect the Abnormal Packet for savi...
A Review Study on Shortest Path in WSN to detect the Abnormal Packet for savi...Editor IJMTER
 
Data Centric Approach Based Protocol using Evolutionary Approach in WSN
Data Centric Approach Based Protocol using Evolutionary Approach in WSNData Centric Approach Based Protocol using Evolutionary Approach in WSN
Data Centric Approach Based Protocol using Evolutionary Approach in WSNijsrd.com
 
Application Of Machine Learning In Wireless Sensor Network
Application Of Machine Learning In Wireless Sensor NetworkApplication Of Machine Learning In Wireless Sensor Network
Application Of Machine Learning In Wireless Sensor NetworkApril Knyff
 
Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...
Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...
Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...ijsrd.com
 

Similar to 11.0005www.iiste.org call for paper.a robust frame of wsn utilizing localization technique -36-46 (20)

J017345864
J017345864J017345864
J017345864
 
Node Deployment in Homogeneous and Heterogeneous Wireless Sensor Network
Node Deployment in Homogeneous and Heterogeneous Wireless Sensor NetworkNode Deployment in Homogeneous and Heterogeneous Wireless Sensor Network
Node Deployment in Homogeneous and Heterogeneous Wireless Sensor Network
 
Multiagent based multipath routing in wireless sensor networks
Multiagent based multipath routing in wireless sensor networksMultiagent based multipath routing in wireless sensor networks
Multiagent based multipath routing in wireless sensor networks
 
F33022028
F33022028F33022028
F33022028
 
DATA TRANSMISSION IN WIRELESS SENSOR NETWORKS FOR EFFECTIVE AND SECURE COMMUN...
DATA TRANSMISSION IN WIRELESS SENSOR NETWORKS FOR EFFECTIVE AND SECURE COMMUN...DATA TRANSMISSION IN WIRELESS SENSOR NETWORKS FOR EFFECTIVE AND SECURE COMMUN...
DATA TRANSMISSION IN WIRELESS SENSOR NETWORKS FOR EFFECTIVE AND SECURE COMMUN...
 
Machine Learning Based Watchdog Protocol for Wormhole Attack Detection in Wir...
Machine Learning Based Watchdog Protocol for Wormhole Attack Detection in Wir...Machine Learning Based Watchdog Protocol for Wormhole Attack Detection in Wir...
Machine Learning Based Watchdog Protocol for Wormhole Attack Detection in Wir...
 
An Approach of Mobile Wireless Sensor Network for Target Coverage and Network...
An Approach of Mobile Wireless Sensor Network for Target Coverage and Network...An Approach of Mobile Wireless Sensor Network for Target Coverage and Network...
An Approach of Mobile Wireless Sensor Network for Target Coverage and Network...
 
Ijarcet vol-2-issue-3-916-919
Ijarcet vol-2-issue-3-916-919Ijarcet vol-2-issue-3-916-919
Ijarcet vol-2-issue-3-916-919
 
LOCALIZATION ALGORITHM USING VARYING SPEED MOBILE SINK FOR WIRELESS SENSOR NE...
LOCALIZATION ALGORITHM USING VARYING SPEED MOBILE SINK FOR WIRELESS SENSOR NE...LOCALIZATION ALGORITHM USING VARYING SPEED MOBILE SINK FOR WIRELESS SENSOR NE...
LOCALIZATION ALGORITHM USING VARYING SPEED MOBILE SINK FOR WIRELESS SENSOR NE...
 
Effective range free localization scheme for wireless sensor network
Effective range  free localization scheme for wireless sensor networkEffective range  free localization scheme for wireless sensor network
Effective range free localization scheme for wireless sensor network
 
O4102103111
O4102103111O4102103111
O4102103111
 
A NOVEL APPROACH TO DETECT THE MOVEMENT OF TARGET IN WIRELESS SENSOR NETWORKS
A NOVEL APPROACH TO DETECT THE MOVEMENT OF TARGET IN WIRELESS SENSOR NETWORKSA NOVEL APPROACH TO DETECT THE MOVEMENT OF TARGET IN WIRELESS SENSOR NETWORKS
A NOVEL APPROACH TO DETECT THE MOVEMENT OF TARGET IN WIRELESS SENSOR NETWORKS
 
wireless sensor network
wireless sensor networkwireless sensor network
wireless sensor network
 
Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107
 
Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107Volume 2-issue-6-2102-2107
Volume 2-issue-6-2102-2107
 
Energy efficient and scheduling techniques for increasing life time in wirele...
Energy efficient and scheduling techniques for increasing life time in wirele...Energy efficient and scheduling techniques for increasing life time in wirele...
Energy efficient and scheduling techniques for increasing life time in wirele...
 
A Review Study on Shortest Path in WSN to detect the Abnormal Packet for savi...
A Review Study on Shortest Path in WSN to detect the Abnormal Packet for savi...A Review Study on Shortest Path in WSN to detect the Abnormal Packet for savi...
A Review Study on Shortest Path in WSN to detect the Abnormal Packet for savi...
 
Data Centric Approach Based Protocol using Evolutionary Approach in WSN
Data Centric Approach Based Protocol using Evolutionary Approach in WSNData Centric Approach Based Protocol using Evolutionary Approach in WSN
Data Centric Approach Based Protocol using Evolutionary Approach in WSN
 
Application Of Machine Learning In Wireless Sensor Network
Application Of Machine Learning In Wireless Sensor NetworkApplication Of Machine Learning In Wireless Sensor Network
Application Of Machine Learning In Wireless Sensor Network
 
Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...
Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...
Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...
 

More from Alexander Decker

Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...Alexander Decker
 
A validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale inA validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale inAlexander Decker
 
A usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websitesA usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websitesAlexander Decker
 
A universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banksA universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banksAlexander Decker
 
A unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized dA unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized dAlexander Decker
 
A trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistanceA trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistanceAlexander Decker
 
A transformational generative approach towards understanding al-istifham
A transformational  generative approach towards understanding al-istifhamA transformational  generative approach towards understanding al-istifham
A transformational generative approach towards understanding al-istifhamAlexander Decker
 
A time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibiaA time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibiaAlexander Decker
 
A therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school childrenA therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school childrenAlexander Decker
 
A theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banksA theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banksAlexander Decker
 
A systematic evaluation of link budget for
A systematic evaluation of link budget forA systematic evaluation of link budget for
A systematic evaluation of link budget forAlexander Decker
 
A synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjabA synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjabAlexander Decker
 
A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...Alexander Decker
 
A survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incrementalA survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incrementalAlexander Decker
 
A survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniquesA survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniquesAlexander Decker
 
A survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo dbA survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo dbAlexander Decker
 
A survey on challenges to the media cloud
A survey on challenges to the media cloudA survey on challenges to the media cloud
A survey on challenges to the media cloudAlexander Decker
 
A survey of provenance leveraged
A survey of provenance leveragedA survey of provenance leveraged
A survey of provenance leveragedAlexander Decker
 
A survey of private equity investments in kenya
A survey of private equity investments in kenyaA survey of private equity investments in kenya
A survey of private equity investments in kenyaAlexander Decker
 
A study to measures the financial health of
A study to measures the financial health ofA study to measures the financial health of
A study to measures the financial health ofAlexander Decker
 

More from Alexander Decker (20)

Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...Abnormalities of hormones and inflammatory cytokines in women affected with p...
Abnormalities of hormones and inflammatory cytokines in women affected with p...
 
A validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale inA validation of the adverse childhood experiences scale in
A validation of the adverse childhood experiences scale in
 
A usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websitesA usability evaluation framework for b2 c e commerce websites
A usability evaluation framework for b2 c e commerce websites
 
A universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banksA universal model for managing the marketing executives in nigerian banks
A universal model for managing the marketing executives in nigerian banks
 
A unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized dA unique common fixed point theorems in generalized d
A unique common fixed point theorems in generalized d
 
A trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistanceA trends of salmonella and antibiotic resistance
A trends of salmonella and antibiotic resistance
 
A transformational generative approach towards understanding al-istifham
A transformational  generative approach towards understanding al-istifhamA transformational  generative approach towards understanding al-istifham
A transformational generative approach towards understanding al-istifham
 
A time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibiaA time series analysis of the determinants of savings in namibia
A time series analysis of the determinants of savings in namibia
 
A therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school childrenA therapy for physical and mental fitness of school children
A therapy for physical and mental fitness of school children
 
A theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banksA theory of efficiency for managing the marketing executives in nigerian banks
A theory of efficiency for managing the marketing executives in nigerian banks
 
A systematic evaluation of link budget for
A systematic evaluation of link budget forA systematic evaluation of link budget for
A systematic evaluation of link budget for
 
A synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjabA synthetic review of contraceptive supplies in punjab
A synthetic review of contraceptive supplies in punjab
 
A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...A synthesis of taylor’s and fayol’s management approaches for managing market...
A synthesis of taylor’s and fayol’s management approaches for managing market...
 
A survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incrementalA survey paper on sequence pattern mining with incremental
A survey paper on sequence pattern mining with incremental
 
A survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniquesA survey on live virtual machine migrations and its techniques
A survey on live virtual machine migrations and its techniques
 
A survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo dbA survey on data mining and analysis in hadoop and mongo db
A survey on data mining and analysis in hadoop and mongo db
 
A survey on challenges to the media cloud
A survey on challenges to the media cloudA survey on challenges to the media cloud
A survey on challenges to the media cloud
 
A survey of provenance leveraged
A survey of provenance leveragedA survey of provenance leveraged
A survey of provenance leveraged
 
A survey of private equity investments in kenya
A survey of private equity investments in kenyaA survey of private equity investments in kenya
A survey of private equity investments in kenya
 
A study to measures the financial health of
A study to measures the financial health ofA study to measures the financial health of
A study to measures the financial health of
 

Recently uploaded

Keep Your Finger on the Pulse of Your Building's Performance with IES Live
Keep Your Finger on the Pulse of Your Building's Performance with IES LiveKeep Your Finger on the Pulse of Your Building's Performance with IES Live
Keep Your Finger on the Pulse of Your Building's Performance with IES LiveIES VE
 
UiPath Studio Web workshop series - Day 2
UiPath Studio Web workshop series - Day 2UiPath Studio Web workshop series - Day 2
UiPath Studio Web workshop series - Day 2DianaGray10
 
EMEA What is ThousandEyes? Webinar
EMEA What is ThousandEyes? WebinarEMEA What is ThousandEyes? Webinar
EMEA What is ThousandEyes? WebinarThousandEyes
 
Q4 2023 Quarterly Investor Presentation - FINAL - v1.pdf
Q4 2023 Quarterly Investor Presentation - FINAL - v1.pdfQ4 2023 Quarterly Investor Presentation - FINAL - v1.pdf
Q4 2023 Quarterly Investor Presentation - FINAL - v1.pdfTejal81
 
Explore the UiPath Community and ways you can benefit on your journey to auto...
Explore the UiPath Community and ways you can benefit on your journey to auto...Explore the UiPath Community and ways you can benefit on your journey to auto...
Explore the UiPath Community and ways you can benefit on your journey to auto...DianaGray10
 
March Patch Tuesday
March Patch TuesdayMarch Patch Tuesday
March Patch TuesdayIvanti
 
Oracle Database 23c Security New Features.pptx
Oracle Database 23c Security New Features.pptxOracle Database 23c Security New Features.pptx
Oracle Database 23c Security New Features.pptxSatishbabu Gunukula
 
Key Trends Shaping the Future of Infrastructure.pdf
Key Trends Shaping the Future of Infrastructure.pdfKey Trends Shaping the Future of Infrastructure.pdf
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
 
AI Workshops at Computers In Libraries 2024
AI Workshops at Computers In Libraries 2024AI Workshops at Computers In Libraries 2024
AI Workshops at Computers In Libraries 2024Brian Pichman
 
Technical SEO for Improved Accessibility WTS FEST
Technical SEO for Improved Accessibility  WTS FESTTechnical SEO for Improved Accessibility  WTS FEST
Technical SEO for Improved Accessibility WTS FESTBillieHyde
 
Introduction - IPLOOK NETWORKS CO., LTD.
Introduction - IPLOOK NETWORKS CO., LTD.Introduction - IPLOOK NETWORKS CO., LTD.
Introduction - IPLOOK NETWORKS CO., LTD.IPLOOK Networks
 
Planetek Italia Srl - Corporate Profile Brochure
Planetek Italia Srl - Corporate Profile BrochurePlanetek Italia Srl - Corporate Profile Brochure
Planetek Italia Srl - Corporate Profile BrochurePlanetek Italia Srl
 
Design and Modeling for MySQL SCALE 21X Pasadena, CA Mar 2024
Design and Modeling for MySQL SCALE 21X Pasadena, CA Mar 2024Design and Modeling for MySQL SCALE 21X Pasadena, CA Mar 2024
Design and Modeling for MySQL SCALE 21X Pasadena, CA Mar 2024Alkin Tezuysal
 
IT Service Management (ITSM) Best Practices for Advanced Computing
IT Service Management (ITSM) Best Practices for Advanced ComputingIT Service Management (ITSM) Best Practices for Advanced Computing
IT Service Management (ITSM) Best Practices for Advanced ComputingMAGNIntelligence
 
Stobox 4: Revolutionizing Investment in Real-World Assets Through Tokenization
Stobox 4: Revolutionizing Investment in Real-World Assets Through TokenizationStobox 4: Revolutionizing Investment in Real-World Assets Through Tokenization
Stobox 4: Revolutionizing Investment in Real-World Assets Through TokenizationStobox
 
From the origin to the future of Open Source model and business
From the origin to the future of  Open Source model and businessFrom the origin to the future of  Open Source model and business
From the origin to the future of Open Source model and businessFrancesco Corti
 
GraphSummit Copenhagen 2024 - Neo4j Vision and Roadmap.pptx
GraphSummit Copenhagen 2024 - Neo4j Vision and Roadmap.pptxGraphSummit Copenhagen 2024 - Neo4j Vision and Roadmap.pptx
GraphSummit Copenhagen 2024 - Neo4j Vision and Roadmap.pptxNeo4j
 
How to become a GDSC Lead GDSC MI AOE.pptx
How to become a GDSC Lead GDSC MI AOE.pptxHow to become a GDSC Lead GDSC MI AOE.pptx
How to become a GDSC Lead GDSC MI AOE.pptxKaustubhBhavsar6
 
Patch notes explaining DISARM Version 1.4 update
Patch notes explaining DISARM Version 1.4 updatePatch notes explaining DISARM Version 1.4 update
Patch notes explaining DISARM Version 1.4 updateadam112203
 
Outage Analysis: March 5th/6th 2024 Meta, Comcast, and LinkedIn
Outage Analysis: March 5th/6th 2024 Meta, Comcast, and LinkedInOutage Analysis: March 5th/6th 2024 Meta, Comcast, and LinkedIn
Outage Analysis: March 5th/6th 2024 Meta, Comcast, and LinkedInThousandEyes
 

Recently uploaded (20)

Keep Your Finger on the Pulse of Your Building's Performance with IES Live
Keep Your Finger on the Pulse of Your Building's Performance with IES LiveKeep Your Finger on the Pulse of Your Building's Performance with IES Live
Keep Your Finger on the Pulse of Your Building's Performance with IES Live
 
UiPath Studio Web workshop series - Day 2
UiPath Studio Web workshop series - Day 2UiPath Studio Web workshop series - Day 2
UiPath Studio Web workshop series - Day 2
 
EMEA What is ThousandEyes? Webinar
EMEA What is ThousandEyes? WebinarEMEA What is ThousandEyes? Webinar
EMEA What is ThousandEyes? Webinar
 
Q4 2023 Quarterly Investor Presentation - FINAL - v1.pdf
Q4 2023 Quarterly Investor Presentation - FINAL - v1.pdfQ4 2023 Quarterly Investor Presentation - FINAL - v1.pdf
Q4 2023 Quarterly Investor Presentation - FINAL - v1.pdf
 
Explore the UiPath Community and ways you can benefit on your journey to auto...
Explore the UiPath Community and ways you can benefit on your journey to auto...Explore the UiPath Community and ways you can benefit on your journey to auto...
Explore the UiPath Community and ways you can benefit on your journey to auto...
 
March Patch Tuesday
March Patch TuesdayMarch Patch Tuesday
March Patch Tuesday
 
Oracle Database 23c Security New Features.pptx
Oracle Database 23c Security New Features.pptxOracle Database 23c Security New Features.pptx
Oracle Database 23c Security New Features.pptx
 
Key Trends Shaping the Future of Infrastructure.pdf
Key Trends Shaping the Future of Infrastructure.pdfKey Trends Shaping the Future of Infrastructure.pdf
Key Trends Shaping the Future of Infrastructure.pdf
 
AI Workshops at Computers In Libraries 2024
AI Workshops at Computers In Libraries 2024AI Workshops at Computers In Libraries 2024
AI Workshops at Computers In Libraries 2024
 
Technical SEO for Improved Accessibility WTS FEST
Technical SEO for Improved Accessibility  WTS FESTTechnical SEO for Improved Accessibility  WTS FEST
Technical SEO for Improved Accessibility WTS FEST
 
Introduction - IPLOOK NETWORKS CO., LTD.
Introduction - IPLOOK NETWORKS CO., LTD.Introduction - IPLOOK NETWORKS CO., LTD.
Introduction - IPLOOK NETWORKS CO., LTD.
 
Planetek Italia Srl - Corporate Profile Brochure
Planetek Italia Srl - Corporate Profile BrochurePlanetek Italia Srl - Corporate Profile Brochure
Planetek Italia Srl - Corporate Profile Brochure
 
Design and Modeling for MySQL SCALE 21X Pasadena, CA Mar 2024
Design and Modeling for MySQL SCALE 21X Pasadena, CA Mar 2024Design and Modeling for MySQL SCALE 21X Pasadena, CA Mar 2024
Design and Modeling for MySQL SCALE 21X Pasadena, CA Mar 2024
 
IT Service Management (ITSM) Best Practices for Advanced Computing
IT Service Management (ITSM) Best Practices for Advanced ComputingIT Service Management (ITSM) Best Practices for Advanced Computing
IT Service Management (ITSM) Best Practices for Advanced Computing
 
Stobox 4: Revolutionizing Investment in Real-World Assets Through Tokenization
Stobox 4: Revolutionizing Investment in Real-World Assets Through TokenizationStobox 4: Revolutionizing Investment in Real-World Assets Through Tokenization
Stobox 4: Revolutionizing Investment in Real-World Assets Through Tokenization
 
From the origin to the future of Open Source model and business
From the origin to the future of  Open Source model and businessFrom the origin to the future of  Open Source model and business
From the origin to the future of Open Source model and business
 
GraphSummit Copenhagen 2024 - Neo4j Vision and Roadmap.pptx
GraphSummit Copenhagen 2024 - Neo4j Vision and Roadmap.pptxGraphSummit Copenhagen 2024 - Neo4j Vision and Roadmap.pptx
GraphSummit Copenhagen 2024 - Neo4j Vision and Roadmap.pptx
 
How to become a GDSC Lead GDSC MI AOE.pptx
How to become a GDSC Lead GDSC MI AOE.pptxHow to become a GDSC Lead GDSC MI AOE.pptx
How to become a GDSC Lead GDSC MI AOE.pptx
 
Patch notes explaining DISARM Version 1.4 update
Patch notes explaining DISARM Version 1.4 updatePatch notes explaining DISARM Version 1.4 update
Patch notes explaining DISARM Version 1.4 update
 
Outage Analysis: March 5th/6th 2024 Meta, Comcast, and LinkedIn
Outage Analysis: March 5th/6th 2024 Meta, Comcast, and LinkedInOutage Analysis: March 5th/6th 2024 Meta, Comcast, and LinkedIn
Outage Analysis: March 5th/6th 2024 Meta, Comcast, and LinkedIn
 

11.0005www.iiste.org call for paper.a robust frame of wsn utilizing localization technique -36-46

  • 1. Computer Engineering and Intelligent Systems www.iiste.org ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online) Vol 2, No.7, 2011 A Robust Frame of WSN Utilizing Localization Technique J.Jasper Gnana Chandran Department of EEE, Francis Xavier Engineering College Tirunelveli - 627003, Tamil Nadu, India Tel: +91-9443201279 E-mail: jasper_fx@yahoo.co.uk S. P. Victor Department of Computer Science, St. Xavier’s College (Autonomous) Tirunelveli - 627003, Tamil Nadu, India Tel: +91-9486041594 E-mail: victorsp@rediffmail.com Received: 2011-10-23 Accepted: 2011-10-29 Published: 2011-11-04 Abstract Wireless sensor networks are becoming increasingly popular due to their low cost and wide applicability to support a large number of diverse application areas. Localization of sensor nodes is a fundamental requirement that makes the sensor data meaningful. A wireless sensor network (WSN) consist of spatially distributed autonomous devices using sensors to monitor cooperatively physical or environmental conditions such as temperature, sound, vibration, pressure, motion or pollutants at different locations. The development of wireless sensor networks was originally motivated by a military application like battlefield surveillance. Node localization is required to report the origin of events, assist group querying of sensors, routing and to answer questions on the network coverage. One of the fundamental challenges in wireless sensor network is node localization. This paper discusses different approaches of node localization discovery in wireless sensor networks. The overview of the schemes proposed by different scholars for the improvement of localization in wireless sensor networks is also presented. Keywords: Localization, Particle Swarm Optimization, Received Signal Strength, Angle of Arrival. 1. Introduction+ A wireless sensor network consists of a large set of inexpensive sensor nodes with wireless communication interface. These sensor nodes have limited processing and computing resources. Thus algorithms designed for wireless sensor networks need to be both memory and energy efficient. In most of the algorithms for wireless sensor network, it is assumed that the sensor nodes are aware not only of their locations but also the locations of their nearby neighbors. Hence, localization is a major research area in wireless sensor networks. But, this problem has not been studied extensively in three dimensional WSNs due to various reasons. However, in some real world application scenario the deployed sensor network operates in a three dimensional volume rather than in a two dimensional area. Deployment of WSNs for surveillance of terrains, study of underwater ecosystem, space monitoring and exploration are some of the examples of such applications. Localization in sensor networks can be defined as ``identification of sensor node's position''. For any wireless sensor network, the accuracy of its localization technique is highly desired. The existing algorithm 36 | P a g e www.iiste.org
  • 2. Computer Engineering and Intelligent Systems www.iiste.org ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online) Vol 2, No.7, 2011 for localization can be broadly classified into two basic categories: 1. Range Based Technique 2. Range Free Technique In range based mechanisms, the location of a sensor node can be determined with the help of the distance or angle metrics. These metrics are Time of Arrival (ToA), Time Difference of Arrival (TDoA), Angle of Arrival (AoA), Received Signal Strength Indicator (RSSI). Though range based techniques are highly accurate they should be equipped with highly expensive hardware moreover a lot of computation work is required. It increases the cost of the network and is inefficient in terms of computations. The various range based techniques are Radio Interferometric Measurement (RIM) (Gezici et al. 2008), Multidimensional Scaling (MDS) (Cheung et al. 2005), 3D - Landscape (Ji et al. 2004), DV-distance, DV-hop, Euclidean distance (Costa et al. 2006) etc. In range free techniques, the position of sensor node is identified on the basis of information transmitted by nearby anchor node or neighboring nodes based on hop or on triangulation basis. The various range free techniques are APIT (Boukerche et al. 2007) chord selection approach three dimensional multilateration approach SerLOC centroid scheme etc . Many more techniques are discussed in (Sayed et al. 2005). The range free techniques have an error in accuracy up to 10% of the communication range of individual node (Patwari et al. 2003). But, these techniques are much cheaper compared to the range based techniques. Energy efficiency is a critical issue in wireless sensor networks (WSNs) since the sensor nodes' batteries have limited capacit (Boukerche et al. 2007). Once a WSN is in place, its lifetime must last as long as possible based on the initially provided amount of energy. Consequently, techniques minimizing energy-consumption are required to improve the network lifetime. A widely employed mechanism is to schedule sensor nodes activity so that redundant nodes enter the sleep mode as often as possible. So far various studies have addressed the energy optimization issue without considering the impact of the number of reporting nodes on the WSN performance. In other words, how the network lifetime evolves with respect to the number of active reporting nodes. 2. Related Works Localization approaches can be classified into range-based approaches, and range free approaches. The main difference between them is the way to get the distance information. The former relies on distance or angle measurement with radio signals such as TDoA (Doherty et al. 2001) and AoA, and needs expensive measurement hardware. The latter uses special protocols to eliminate the need for radio signal measurement. The proposed DRL is a range-free mobile localization approach for outdoor environments. (Gezici et al. 2008) is a range-based approach for mobile WSNs which use only local information. It uses range measurements between nodes to build a network co-ordinate system. It has shown that despite possible range measurement errors and motion of the nodes, the algorithm provides enough stability and location accuracy. However, the amount of information exchange as well as graph calculation is quite huge, and it needs hardware capable of supporting the TOA to obtain the range between two mobile nodes. DV-Hop (Patwari et al. 2003) is used in static wireless networks which make use of multi-hop information. It is a range-free approach. An anchor floods its location to the whole network with a packet containing the anchor’s position. With hop-count from that anchor and average hop-distance, this node can derive its own position by triangulation. In the triangulation, the distance between a node and an anchor is estimated as the multiplication of hop-count and hop-distance. MCL (Sayed et al. 2005), is a range-free approach for mobile WSNs. MCL periodically updates its samples, which are node's probabilistic distribution of locations by repeating the prediction and filtering process. It predicts samples’ next time step distribution with node velocity and filters out impossible samples with new 37 | P a g e www.iiste.org
  • 3. Computer Engineering and Intelligent Systems www.iiste.org ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online) Vol 2, No.7, 2011 observations. Observations include the conditions that the node hears a seed directly (i.e. they are one-hop away), or some of the node’s neighbors are one-hop away from certain seeds (i.e. such seeds are two-hop away from the node). However, if a node has no seed within two-hop away from it, it cannot locate itself. Also, the prediction and filtering process may consume lots of iterations if it keeps failure of guessing a possible position. Moreover, this repeating failure condition may be an infinite loop if none of the samples can be filtered successfully. MCL has no solution to this. Recently (Gezici et al. 2008), a new approach to source localization was proposed. It utilizes Received Signal Strength (RSS) measurements. In particular, the spatially distributed sensors measure the power of the signal due to the source that arrives at their location. In the sequel, using an energy-decay model, each sensor is able to extract some information about its distance to the source of interest. Finally, the required location of the source is derived by proper fusion of the information extracted at a number of active sensor nodes. Note that a sensor node is characterized as active if its measurement is greater than a predetermined threshold. In order to avoid the ambiguities that arise due to the unknown transmit power of the source it was proposed to compute ratios of measurements taken at pairs of active sensors. In (Biswas et al. 2006), maximum likelihood multiple-source localization based on RSS measurements was considered. In the problem of source localization was formulated as a coverage problem and estimates of the necessary sensor density which can guarantee a localization error bound were derived. In (Albowicz et al. 2001), a distributed “incremental sub gradient” algorithm was proposed to yield iteratively the source location estimate. More recently, a distributed localization algorithm enjoying good convergence properties was proposed. In (Sayed et al. 2005), a non-linear cost function for localization was proposed and it was proved that its gradient descent minimization is globally converging. However, all the aforementioned approaches require knowledge of the energy decay model and/or the transmit power of the source of interest. In (Doherty et al. 2001), the case of unavailable information about the energy decay model and the transmit power of the source (i.e. model-independent case) was considered. The location of the source was derived by properly averaging the locations of active sensor nodes. 3. Approaches to measure distance between two nodes There are different ranging approaches to measure distance between two nodes. TOA: time of arrive AOA: anger of arrive TDOA: time difference of arrive RSSI: Received signal strength indication Noise issue: Interferometric: For example, ranging method used in GPS is TOA. By multiplying the time shift to the speed of radio propagation, we can calculate the distance. The popular approaches used for ranging in WSN are TDOA. A mote working in TDOA is often equipped with a sound signal or ultra-sound signal transceiver in addition to the radio transceiver. When a mote does ranging, it sends simultaneously RF signal and sound signal, known as piggy-back signals. Time stamps are often inserted in the radio messages. When a mote receives a radio message indicating that a sound signal is accompanying with it, the mote start a counter to count the time shift between radio arriving and sound arriving. Compared to the propagation speed of radio, the sound speed is quite slow. We can consider that the time shift of these two signals arriving at the receiver is the time needed by the sound signal flying from the transmitter to the receiver. By multiplying the time shift to the speed of wave, we can calculate the distance between these two nodes. 38 | P a g e www.iiste.org
  • 4. Computer Engineering and Intelligent Systems www.iiste.org ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online) Vol 2, No.7, 2011 4. Proposed Method The ad hoc localization problem (AHLP) has the task of finding the physical location of all nodes. Only the subset of nodes named as location-aware (LA) nodes, know their exact location. Given a network graph G = (V, E) where {Vgps} is a subset of the nodes in {V} i.e.{Vgps} ⊂ {V} are LA nodes. The locations of non-LA nodes can be found by {V} – {Vgps}. . The AHLP is non-trivial for a number of reasons: To find the location, 1. A node should know • The locations of at least three LA nodes • Distance between the node and any of these LA nodes. 2. Or it should measure • The distance and an (absolute) angle between any one LA node and node Though the measurements are correct, it is not possible for the LA nodes to surround each regular node. This is because • MANETs may be randomly arranged • Only a small percentage of nodes are LA nodes. Hence estimating node locations based on other nodes’ location (multi-hop information) is a better solution for this. Some sensory devices are needed to provide such reading the algorithms require distance or angle measurements. All nodes do not have the same sensory capacity. These algorithms need to work in a heterogeneous environment with different location sensory capacities. Let us first consider the scenario in which the sensor reading consists of no measurement noise interference. In order to locate a node, at least three RSSI readings from different LA nodes and only two AoA readings are needed. Only one RSSI reading and one AoA reading from the same LA nodes are essential to locate the node when both measurement types are available. In such a case, better coverage must be provided by AoA readings for locating more nodes than RSSI readings. In PSO the individuals are termed as particles. These particles spread in the multi- dimensional search space representing a possible solution to the multidimensional problem. Each particle has fitness values for optimization and it can be evaluated by the fitness function. These particles have velocities to direct their movements. Initially PSO contains a group of random solutions and by means of updating generations it searches for optimal solution. In iteration, updating of each particle is done by following two "best" factors. Pbest: It is the best fitness the particle has achieved so far and stored in memory. Gbest: It is the "global best" value obtained so far by any particle in the population Lbest: It is the "best" value obtained so far by any particle in the population in its topological neighbors. After every iteration, if more optimal solution is found by the particle and population then the pbest and gbest (or lbest) are updated respectively. The fitness function, f, is based on the signal strength (RSSI) and an angle of arrival (AoA) of the LA node. For a node n, the fitness function can be calculated by f = A o A(n) / RSSI(n) The position of the particle is based on its previous position, n p and its velocity over a unit of time: Pn+1 = Pn + Vn+1 39 | P a g e www.iiste.org
  • 5. Computer Engineering and Intelligent Systems www.iiste.org ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online) Vol 2, No.7, 2011 The velocity of a particle is computed as follows: The pseudo code is as follows: 1. Get AoA and RSSI values for LA node. 2. Initialize population with random positions and velocities 3. Non LA nodes associate with another node based on the maximum signal strength received from each LA node, thus forming mini swarms 4. Evaluate fitness of each particle in swarm as per (2). 5. For each particle in each mini swarm 5.1. Find particle best ( pbest ) – compute fitness of particle. 5.2. If current pbest pbest < , then 5.2.1. pbest = current Pbest 5.2.2. location current location = Pbest 5.3. End if 5.4. Find local best ( lbest ) for the mini swarm 5.5. Lbest location = location of min (all pbest in this mini swarm) 5.6. Update velocity of particle as per (3) 5.7. Update position of particle as per (2) 6. End For 7. Repeat steps 5.1 through 5.7 until termination condition is reached. 5. Evaluation Methods Measurement error is in proportion to the distance between the sensor and the target. A mean of the absolute value is 10% of distance, for example, if distance between a sensor and a target is 10m, measurement error is given as a random value between -2m and 2m. Measurement error is independent of distance and the mean of the absolute value is 1m. This is based on the assumption that sensors near the target do not always measure the precise effects of such obstacles. This follows the upper boundaries of both the above two models. If a system can manage such a large error model, it’s no exaggeration to say that it is free of measurement error. 6. Challenges exist when implementing localization in WSN As we discussed earlier, WSN is a resourced constraint network. Because of the battery power supply and in order to avoid interference, the effective communication range is limited to some extent. The sensed data may arrive at the destination via multi-hop. The reliability of a routing path is not guaranteed, so the routing path between the data source and data sink may vary with time. When we try to use multi-hop routing path to estimate the distance between a node and the beacons, the errors caused in these approximation have adverse impact on the accuracy of localization in WSN. Another factor influencing localization accuracy is the ranging errors. Whatever kind of ranging approaches is adopted, there will always exist some noise in the ranging measurements. Moreover, because the characteristics between each transmitter-receiver pair may not be the same, this kind of ununiformity between different motes also exerts negative impact on the accuracy of localization. Before we begin to implement localization in WSN, we will have to do the simulation first to see what accuracy is expected concerning localization in multi-hop WSN. 7. How to simulate localization processes using NS2? If we have a network topology we know the coordinates of each node in the topology and also the distance matrix between each node. However, as simulation input, we use only part of the distance matrix and choose three typical nodes as beacons. The localization goal is to figure out the unknown coordinates of other nodes except the beacons. After that, we can evaluate the error distributions by comparing the 40 | P a g e www.iiste.org
  • 6. Computer Engineering and Intelligent Systems www.iiste.org ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online) Vol 2, No.7, 2011 estimated coordinates of each node and their original coordinates. By specifying the number of nodes, distance of grid unit and the random noise relative to the spacing of each grid, we can programme to generate a random pattern of the network which means that we can get an array of nodes with the known co-ordinates and also we know the full distance matrix between any nodes. In order to simulate the process of localization, instead of using the full distance matrix, we will have to reduce the direct connectivity in the full distance matrix. 8. Experimental Results We show that each distinct region formed in this manner can be uniquely identified by a location sequence that represents the distance ranks of reference nodes to that region. We present an algorithm to construct the location sequence table that maps all these feasible location sequences to the corresponding regions by using the locations of the reference nodes. This table is used to localize an unknown node (that is, the node whose location has to be determined) as follows. The unknown node first determines its own location sequence based on the measured strength of signals between itself and the reference nodes. It then searches through the location sequence table to determine the “nearest” feasible sequence to its own measured sequence. The centroid of the corresponding region is taken to be its location. In order to evaluate the described approaches to sensor network localization, many numerical tests were performed. We performed a variety of simulation experiments to cover a wide range of network (number of nodes), the radio range, and the distance measurement error and computation time. The key metric for evaluating all the listed methods was the accuracy of the location estimates which versus the deployment, communication and computation cost. The table 1 shows the transmission ranges of different networks Due to measurement uncertainty, it is difficult to find a good metric to compare the results obtained using different localization methods. The localization error is denoted as LE. It is expressed as a percentage error. It is normalized with respect to the radio range to allow a comparison of results obtained for different size and range networks. Figure 6 shows that the localization error decreases as the number of nodes increases. Increasing the density of anchors makes localization easier, but it increases the network size and deployment cost. The value of the transmission range r determines the number of neighbours of each node in the network. The radio range considered from the interval [0.21 – 0.02]. 9. Conclusion In the sensor networks the nodes move randomly within the coverage area. The problem considered in this paper is the exploration of an unknown environment with the goal of finding the nodes at an unknown location(s) using location aware (LA) nodes. This work has demonstrated the use of a distributed PSO algorithm with a novel adaptive RSS weighting factor and angle of arrival AoA factor to guide LA nodes for locating target(s) in high risk environments. Essentially, to reduce the energy consumption only a small number of sensors are activated to track and localize the target; while others are turned into sleep mode. The proposed method is evaluated on various mobility models and localization is performed by learning movement patterns and their parameters. The results show that our approach is better than the previously proposed approaches for range free localization techniques for three dimensional wireless sensor network in terms of beacon overhead, localization time, localization error, computation and space required for any per-cent of mobile sensor nodes. References Albowicz.J, A. Chen, and L. Zhang, (2001) “Recursive position estimation in sensor networks,” in Proc. of International Conference on Network Protocols, pp. 35–41. 41 | P a g e www.iiste.org
  • 7. Computer Engineering and Intelligent Systems www.iiste.org ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online) Vol 2, No.7, 2011 Biswas.P, T. Liang, T. Wang, and Y. Ye, (2006) “Semidefinite programming based algorithms for sensor network localization,” ACM Transactions on Sensor Networks (TOSN), vol. 2, no. 2, p. 220. Boukerche, H. Oliveira, E. Nakamura, and A. Loureiro, (2007) “Localization systems for wireless sensor networks,” IEEE Wireless Communications, vol. 14, no. 6, pp. 6–12. Cheung.K and H. So, (2005) “A multidimensional scaling framework for mobile location using time-of-arrival measurements,” IEEE Trans. Signal Process., vol. 53, no. 2, pp. 460–470. Costa.J, N. Patwari, and A. Hero III, (2006) “Distributed weighted-multidimensional scaling for node localization in sensor networks,” ACM Transactions on Sensor Networks (TOSN), vol. 2, no. 1, p. 64. Doherty.L, K. Pister, and L. El Ghaoui, (2001) “Convex position estimation in wireless sensor networks,” in Proc. of IEEE INFOCOM, vol. 3, pp. 1655–1663. Gezici.S, (2008) “A survey on wireless position estimation,” Wireless Personal Communications, vol. 44, no. 3, pp. 263–282. Gezici.S, I. Guvenc, and Z. Sahinoglu, (2008) “On the Performance of Linear Least-Squares Estimation in Wireless Positioning Systems,” in Proc. of IEEE International Conference on Communications (ICC), pp. 4203–4208. Ji.X and H. Zha, (2004) “Sensor positioning in wireless ad hoc sensor networks using multidimensional scaling,” in Proc. of IEEE INFOCOM, vol. 4, pp. 2652–2661. Mao.G, B. Fidan, and B. Anderson, (2007) “Wireless sensor network localization techniques,” Computer Networks, vol. 51, no. 10, pp. 2529–2553. Niculescu.D and B. Nath, “Ad hoc positioning system (APS),” in Proc. of IEEE GLOBECOM, vol. 5, pp. 2926–2931. Patwari.N, A. Hero, M. Perkins, N. Correal, and R. O’Dea, (2003) “Relative location estimation in wireless sensor networks,” IEEE Transactions on Signal Processing, vol. 51, no. 8, pp. 2137–2148. Patwari.N, J. Ash, S. Kyperountas, I. Hero, A.O., R. Moses, and N. Correal, (2005) “Locating the nodes: co-operative localization in wireless sensor networks,” IEEE Signal Process. Mag., vol. 22, pp. 54–69. Sayed, A. Tarighat, and N. Khajehnouri, (2005) “Network-based wireless location: challenges faced in developing techniques for accurate wireless location information,” IEEE Signal Process. Mag., vol. 22, no. 4, pp. 24–40. Savvides, C. Han, and M. Strivastava, (2001) “Dynamic fine-grained localization in ad-hoc networks of sensors,” in Proc. of International Conference on Mobile Computing and Networking, pp. 166–179. Shang.Y, W. Ruml, Y. Zhang, and M. Fromherz,( 2003) “Localization from mere connectivity,” in Proc. of ACM International Symposium on Mobile Ad Hoc Networking & Computing, pp. 201–212. Srirangarajan.S, A. Tewfik, and Z. Luo, (2008) “Distributed Sensor Network Localization Using SOCP Relaxation,” IEEE Transactions on Wireless Communications, vol. 7, no. 12, p. 1. 42 | P a g e www.iiste.org
  • 8. Computer Engineering and Intelligent Systems www.iiste.org ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online) Vol 2, No.7, 2011 Figure 1. Complexity of Wireless Sensor Networks Figure 1. Complexity of Wireless Sensor Networks Figure 2. Node Distribution 43 | P a g e www.iiste.org
  • 9. Computer Engineering and Intelligent Systems www.iiste.org ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online) Vol 2, No.7, 2011 Figure 3. Node Connectivity a) An unknown node determines its reference nodes; b) The unknown node estimates its distance to these references; c) The unknown node computes its position using multilateration; d) Now the unknown node becomes a settled node and assists other nodes in position estimation. Figure 4. Centroid Measurement 44 | P a g e www.iiste.org
  • 10. Computer Engineering and Intelligent Systems www.iiste.org ISSN 2222-1719 (Paper) ISSN 2222-2863 (Online) Vol 2, No.7, 2011 Localization Accuracy 35 L o c a liz a tio n E r r o r 30 25 20 15 10 5 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 No.of Nodes Figure 5. Impact of Nodes with Localization Accuracy Localization Accuracy 2.5 L o c a l i z a ti o n E r r o r 2 1.5 1 0.5 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 Radio Range Figure 6. Radio Range Vs Localization Accuracy Table 1. Number of Nodes Vs Radio Range Number of Nodes Radio Range 100 0.21 200 0.17 500 0.15 1000 0.11 1500 0.08 2000 0.06 2500 0.04 3000 0.02 45 | P a g e www.iiste.org
  • 11. International Journals Call for Paper The IISTE, a U.S. publisher, is currently hosting the academic journals listed below. The peer review process of the following journals usually takes LESS THAN 14 business days and IISTE usually publishes a qualified article within 30 days. Authors should send their full paper to the following email address. More information can be found in the IISTE website : www.iiste.org Business, Economics, Finance and Management PAPER SUBMISSION EMAIL European Journal of Business and Management EJBM@iiste.org Research Journal of Finance and Accounting RJFA@iiste.org Journal of Economics and Sustainable Development JESD@iiste.org Information and Knowledge Management IKM@iiste.org Developing Country Studies DCS@iiste.org Industrial Engineering Letters IEL@iiste.org Physical Sciences, Mathematics and Chemistry PAPER SUBMISSION EMAIL Journal of Natural Sciences Research JNSR@iiste.org Chemistry and Materials Research CMR@iiste.org Mathematical Theory and Modeling MTM@iiste.org Advances in Physics Theories and Applications APTA@iiste.org Chemical and Process Engineering Research CPER@iiste.org Engineering, Technology and Systems PAPER SUBMISSION EMAIL Computer Engineering and Intelligent Systems CEIS@iiste.org Innovative Systems Design and Engineering ISDE@iiste.org Journal of Energy Technologies and Policy JETP@iiste.org Information and Knowledge Management IKM@iiste.org Control Theory and Informatics CTI@iiste.org Journal of Information Engineering and Applications JIEA@iiste.org Industrial Engineering Letters IEL@iiste.org Network and Complex Systems NCS@iiste.org Environment, Civil, Materials Sciences PAPER SUBMISSION EMAIL Journal of Environment and Earth Science JEES@iiste.org Civil and Environmental Research CER@iiste.org Journal of Natural Sciences Research JNSR@iiste.org Civil and Environmental Research CER@iiste.org Life Science, Food and Medical Sciences PAPER SUBMISSION EMAIL Journal of Natural Sciences Research JNSR@iiste.org Journal of Biology, Agriculture and Healthcare JBAH@iiste.org Food Science and Quality Management FSQM@iiste.org Chemistry and Materials Research CMR@iiste.org Education, and other Social Sciences PAPER SUBMISSION EMAIL Journal of Education and Practice JEP@iiste.org Journal of Law, Policy and Globalization JLPG@iiste.org Global knowledge sharing: New Media and Mass Communication NMMC@iiste.org EBSCO, Index Copernicus, Ulrich's Journal of Energy Technologies and Policy JETP@iiste.org Periodicals Directory, JournalTOCS, PKP Historical Research Letter HRL@iiste.org Open Archives Harvester, Bielefeld Academic Search Engine, Elektronische Public Policy and Administration Research PPAR@iiste.org Zeitschriftenbibliothek EZB, Open J-Gate, International Affairs and Global Strategy IAGS@iiste.org OCLC WorldCat, Universe Digtial Library , Research on Humanities and Social Sciences RHSS@iiste.org NewJour, Google Scholar. Developing Country Studies DCS@iiste.org IISTE is member of CrossRef. All journals Arts and Design Studies ADS@iiste.org have high IC Impact Factor Values (ICV).