Proceedings of National Conference on Recent Advances in Electronics and Communication Engineering

(RACE-2014), 28-29 March 2014

1
Average Localization Error Estimation of
HiRLoc and SeRLoc Algorithm
Anand Prakash
1
, Manish Singh
2
, Satyam Gupta
3
1,2,3
Department of Electronics and Communication Engineering
1
Invertis University Bareilly
2
Invertis university Bareilly
3
Invertis university Bareilly
1
Email- anand.anandprakash@gmail.com
2
Email- vickys0023@gmail.com
3
Email- Satyam9598@gmail.com

Abstract- Wireless sensor networks (WSNs) consist of sensor nodes that broadcast a message within a network. Efficient
broadcasting is a key requirement in sensor networks and has been a focal point of research over the last few years. There
are many challenging tasks in the network, including redundancy control, average localization error, sensor node
localization that decide the reliability of network. Efficient sensor node localization algorithm is a research highlight in
the applications of wireless sensor networks (WSN). An event information with few node location information is
meaningless in practical application so localization become a important point of concern. In this paper, we propose a
comparative study of Localization algorithm SeRLoc and HiRLoc and have done a comparative study on average
localization error, Execution time and number of sensor used between both algorithm. The comparison is done on using
both directed and omni-directed antenna using WSN Localization Simulator.


KeywordsWireless Sensor Network, Architecture Of Wsns, Message Broadcasting, SiRLoc, HiRloc,
I. INTRODUCTION
Wireless sensor network is a collection of sensor nodes organized into a cooperative network[2]. Each sensor node
consists of processing capability (one or more microcontroller, CPUs or DSP chips), may contain multiple types of
memory ( program, data and flash memories), have a RF transceiver (either with a omni-directional or directional
antenna), have a power source (batteries or solar cells), and accommodate various sensors and actuators. The node
communicate wirelessly and often self-organized after being deployed in an ad hoc fashion. WSNs are an
infrastructure comprised of sensing (measuring), computing, and communication element that give an administrator
the ability to instrument, observe, and react to event and phenomena in a specified environment.


Figure 1: General model of wireless sensor networks
Proceedings of National Conference on Recent Advances in Electronics and Communication
Engineering (RACE-2014), 28-29 March 2014



2


There are four basic components in a sensor network:
1) An assembly of distributed or localized sensors.
2) An interconnecting network(usually, but not always, wireless based).
3) A central point of information clustering.
4) A set of computing resources at the central point (or beyond) to handle data correlation, event trending, status
querying, and data mining


II. ARCHITECTURE OF WSNs

Wireless sensor networks consist of individual nodes that are able to interact with the environment by sensing or
controlling physical parameters. These nodes have to collaborate to full fill their tasks. The nodes are interlinked
together and by using wireless links each node is able to communicate and collaborate with each other. The wireless
sensor network and the classical infrastructure comprises of the standard components like sensor nodes (used as
source, sink/actuators), gateways, Internet, and satellite link, etc.


Figure 2: Sensor network communication architecture

There are many other architecture of wireless sensor network which are shown below

A. Homogeneous network




Figure 3: Homogeneous network


B. Heterogeneous Network

Proceedings of National Conference on Recent Advances in Electronics and Communication Engineering
(RACE-2014), 28-29 March 2014

3



Figure 4: Heterogeneous network

C. Ad-Hoc Network


Figure5. Ad-hoc network

III. MESSAGE BROADCASTING

Wireless sensor networks (WSNs) consist of sensor nodes that broadcast a message within a network[2]. Efficient
broadcasting is a key requirement in sensor networks and has been a focal point of research over the last few years.
There are many challenging tasks in the network, including redundancy control and sensor node localization that
mainly depend on broadcasting. Each sensor node in the network is equipped with the memory, radio frequency
transceiver, and power source to broadcast wirelessly over a specified protocol. The success of wireless sensor
networks mainly depend on message forwarding/broadcasting from one node to another node[6]. And the efficiency
of message broadcast depend on the protocol which are used. In this paper we compared Average localization error,
Execution time and number of sensor of Localization protocol that is SeRLoc and HiRloc to control redundancy
and improve localization in WSNs. The proposed results incorporates the comparative study of both protocol in
respect of localization error, execution time and number of sensor for optimizing message broadcasting within the
network.


IV. SeRLoc LOCALIZATION SCHEME

SeRLoc is secure localization scheme based on estimating the position of randomly deployed nodes of a wireless
sensor network (WSN), in the absence of security threats. This scheme there was no provision to move sensor to
secure position if a security threat happen on that sensor as this protocol fixed the place of sensor hence there was
Proceedings of National Conference on Recent Advances in Electronics and Communication
Engineering (RACE-2014), 28-29 March 2014



4

no way to move that sensor in or out of the ROI that is region of interference of two antenna radio range to prevent
threat. Though it was called as secure localization but the position of sensor was fixed in it and no prevention for
external threat. It can be implemented using both direction and omni-directional antenna as shown in fig.6&7 .

500m
500m

Figure6. SeRLoc with directed antenna

500m
500m

Figure7. SeRLoc with directed antenna

As we can observe that once the sensor is placed its position is fixed and then security threat introduced then this
protocol resist to change the position of sensor by changing beam width and radio range of antenna to change the
location of attacked sensor and save it from attack . So to solve this localization problem a new localization
algorithm was given that is algorithm called high-resolution range-independent localization (HiRLoc).




Proceedings of National Conference on Recent Advances in Electronics and Communication Engineering
(RACE-2014), 28-29 March 2014

5

V. HiRLoc LOCALIZATION SCHEME

Hirloc localization scheme is based on estimating the position of randomly deployed nodes of a wireless sensor
network (WSN), in the presence of security threats. It is a range-independent localization algorithm called high-
resolution range-independent localization (HiRLoc). It allows sensors to passively determine their location without
increasing the number of reference points, or the complexity of the hardware of each reference point. In HiRLoc
sensors determine their location based on the intersection of the areas covered by the beacons transmitted by
multiple reference points. It is robust against known attacks on WSN, such as the wormhole attack, the Sybil attack,
and compromise of network entities. Evaluation shows that HiRLoc leads to a significant improvement in
localization accuracy compared with state-of-the-art range-independent localization schemes, while requiring fewer
reference points. HiRLoc is shown in fig.6&7 with both directed and omni-directed antenna.

500m
500m

Figure8. HiRLoc with directed antenna


Figure9. HiRLoc with onmi-directed antenna

500m
500m
Proceedings of National Conference on Recent Advances in Electronics and Communication
Engineering (RACE-2014), 28-29 March 2014



6

In HiRLoc weather with directed or onmi-directed antenna we change the position of sensor with changing in ROI
region of interference of two antenna by making changes in beam width and radio range of antenna. Suppose an
sensor node in under security threat by some external source so we can change beam width and radio range to bring
that sensor in or out and avoid security threat. In HiRLoc best localization can be achieve in minimum ROI that is
there is a difficulty to Localize 5 nodes in bigger area then compared to smaller area in such a way that all nodes are
in range of each other as shown in fig.8.



Figure10. Change in ROI by changing rotation of antenna

VI. COMPARATIVE ANALYSIS

Comparative analysis for SeRLoc and HiRLoc algorithm for directed antenna are as follows in Table 1,2,3.

For Directed Antenna Execution Time between both algorithm

Table -1 Experiment Result
HiRLoc 64 ms
SeRLoc 71 ms

For Directed Antenna Number Of Sensors between both algorithm

Table -2 Experiment Result
HiRLoc 50
SeRLoc 46


For Directed Antenna Average Localization Error between both algorithm

Table -3 Experiment Result
HiRLoc 2
SeRLoc 48
Comparative analysis for SeRLoc and HiRLoc algorithm for Omni-directed antenna are as follows in Table 4,5,6.
Proceedings of National Conference on Recent Advances in Electronics and Communication Engineering
(RACE-2014), 28-29 March 2014

7


For omni-Directed Antenna Execution Time between both algorithm

Table -4 Experiment Result
HiRLoc 73 ms
SeRLoc 1 ms

For omni-Directed Antenna Number Of Sensors between both algorithm

Table -5 Experiment Result
HiRLoc 34
SeRLoc 107

For Directed Antenna Average Localization Error between both algorithm

Table -6 Experiment Result
HiRLoc 2
SeRLoc 78


VII. CONCLUSION

We studied the problem of sensor localization in the presence of malicious adversaries and proposed that a high-
resolution range in dependent localization scheme called HiRLocis offering a better and a wise solution to
localization problem. We studied that HiRLoc localizes sensors with significantly higher accuracy than previously
proposed methods SeRLoc, while requiring fewer hardware resources. Furthermore, we showed that HiRLoc allows
the robust location computation even in the presence of security threats in WSN, such as the wormhole attack, the
Sybil attack and compromise of network entities. Our studies confirmed that HiRLoc is much better than SeRLoc in
terms of security, localization problem, number of sensors and execution time .

IX. REFERENCES

[1] A. M. Kermarrec and M. V. Steen, Gossiping In Distributed System, Operating System Review, Vol. 41, No. 5, pp.2-7, 2007.
[2] I. F. Akyildiz, W. Su, Y. S Sankarasubramaniam and E. Cayiric, A Survey On Sensor Network. IEEE Communication Magazine, Vol. 40,
No. 8, pp. 102-114, 2004.
[3] G. Mao, B. Fidan and Brian D.O. Anderson , Sensor Network Localization, The International Journal of Computer And
Telecommunications Networking ,Vol.51,2007,pp. 2529-2553.
[4] Chadni and K. singh , Location Estimation Scheme With Improved Accuracy, International Journal of Science And Emerging Technology
With Latest Trends 3(1),pp. 9-18.
[5] Weng Chon Ao and Kwang-Cheng Chen, Error Control For Local Broadcasting In Heterogeneous Wireless Ad Hoc Networks, IEEE
Transactions on Communications, Vol. 61, No. 4,2013,pp. 1510-1519.
[6] Y. Liang , H. Vincent Poor and L. Ying , Secure Communication Over Wireless Broadcast Network : Stability And Utility, IEEE
Transactions on Information Forensics And Security, Vol. 6,No. 3,2011,pp. 682-692.
[7] Geir Egeland, Paal E. Engelstad, The Economy of Redundancy In Wireless Multi-Hop Networks, In Proceeding of IEEE WCNC,2009
[8] Majid Khabbazian and Vijay K. Bhargava, Reducing Broadcast Redundancy In WirelessAd Hoc Networks, In Proceeding of IEEE
Globecom,2007.
[9] H. Modares , R. Salleh, A. Moravejosharieh , Overview of Security Issues In Wireless Sensor Network, In Proceeding Of Third
International Conference On Computational Intelligence, Modelling And Simulation,IEEE,2011,pp. 308-311.
[10] Ian F. Akyildiz, M.C. Vuran , B.Akan and Weilian Su , Wireless Sensor Network: A Survey Revisited, Computer Networks Journal,PP. 1-
39.