ENHANCED COMPOSITE APPROACH WITH MOBILE BEACON SHORTEST PATH TO SOLVE LOCALIZATION PROBLEM IN WIRELESS SENSOR NETWORKS
beacon traffic interval
3 20 0.29
4 40 0.31
5 60 0.35
6 80 0.33
4.4 Enhanced composite approach with mobile beacon shortest path
Mobile beacon traverse the deployment area with the shortest path. Deployment
area is partitioned into hexagon cells as in cellular network. The mobile beacon
passes at the mid point of each hexagon cell to follow by any traveling
salesperson algorithm for shortest path. The main goal of this approach is to
reduce the power, required for computation and traversing. When mobile
beacon traverse the shortest path to cover the deployment region definitely it
saves the power. Further this method is cost saving as it required only one GPS
which is inbuilt or physically added in mobile beacon to cover the shortest path.
The deployment area is divided into hexagon cells and mobile beacon trajectory
follow the shortest path, moving center of each hexagon cells reduce the little
bit error in comparison of composite approach. Average traffic not affected by
mobile beacon shortest path so it almost equal to the previous composite
approach. So this method improves a little bit performance and efficiency. We
can see improved mobile beacon trajectory with shortest path in figure 2.3.
Table 4.4 Average position error and traffic of enhanced composite
3 20 0.27
4 40 0.29
5 60 0.33
6 80 0.31
When we compare the result of average traffic and error intervals with other
approaches then we find the enhanced composite approach with mobile beacon
shortest path is a bit better then composite approach. But this approach will give
much better result in terms of power saving which reduces the cost also, as
compared the other approaches. When the deployment area is large then this
algorithm plays an important role as it consumes less power. So this algorithm
is good for battlefield surveillances, Industrial and large geographical
CONCLUSION & FUTURE WORK
This proposed method provides high localization precisions, low payload of the
traffic and high self adaptability. However, the requirement of the beacon is
exigent and rigid. When the dimension of the wireless sensor network is very
big, energy depletion leads the infectivity of the mobile beacon. We have
developed an optimal movement schedule for mobile beacon that can achieve a
shortest path under expected localization accuracy using cellular hexagon cells.
Algorithms show that there are some merits and demerits of all the algorithms.
Some localization schemes have fewer merits and greater demerits and some of
them have less demerits and greater merits. These merits and demerits were the
main source for proposing the idea of a unique approach which is the enhanced
composite approach. The proposed algorithm may address those problems
which are faced by company in real time deployment. Definitely the results of
the approach show worth of the localization schemes. It shows the use of an
algorithm, and it is very important to know about the usage of an algorithm.
Localization problem is an open challenge in wireless sensor network. There
are many aspects where we need improvements such as how to define threshold
value in wireless sensor network. Security is another aspects, as the data is
transferred from mobile beacon node to blind node then any of mobile beacon
which is a virus or not secure acting as original mobile beacon transmit false
message, Due to that an error will occur which is harmful for our computation.
Environmental obstacles like indoors, walls, cage, mountains etc are some
issues which comes when we do measurements in real deployment area. So
localization system should be able to overcome these problems.
In future work, we would like to modify this approach to make the already
position aware static nodes to participate in localization. Also the consideration
of changing communication range for the mobile nodes is seen as a potential
area for future work in three dimensional.
 Youssef C Basaran Yeditepe University 2007 “A Hybrid localization algorithm for
wireless sensor networks”.
 Stockholm masters degree project “Localization in wireless sensor networks”.
 S.Meguerdichian, F.Koushanfar, M.Potkonjak, and M.B. “Srivastava, Coverage
Problems in Wireless Adhoc Sensor Networks,” IEEE INFOCOM2001, Ankorange,
Alaska, pp. 13801387, April 2001.
. P. N. Pathirana, N. Bulusu, A. V. Savkin, and S. Jha, “Node localization using
mobile robots in delay-tolerant sensor networks," IEEE Trans. Mob. Comput., vol. 4,
no. 3, pp. 285-296, May 2005.
 Radu Stoleru, Radu Stoleru, Sang Son M. Yin, J. Shu, L. Liu, and H. Sweden,
IRRTEX0523 2005. “Robust Node Localization for Wireless Sensor Networks”.
. P. Biswas, T.-C. Liang, T.-C. Wang, and Y. Ye, “Semidefinite programming based
algorithms for sensor network localization," ACM Trans. Sensor Netw., vol. 2, no. 2,
pp. 188-220, May 2006.
 J.Bachrach and C.Taylor “Localization in Sensor Networks” Computer Science &
Artificial Intelligence Laboratory Massachusetts Institute of Technology.
 K.-F. Ssu, C.-H. Ou, and H. C. Jiau, “Localization with mobile anchor points in
wireless sensor networks," IEEE Trans. Veh. Technol., vol. 54, no. 3, pp. 1187-1197,
 Zhang, "The Influence of Beacon on DV-hop in Wireless Sensor Networks," in
Grid and Cooperative Computing Workshops, 2006. GCCW '06. Fifth International
Conference, 2006, pp. 459-462.
 Rappaport, T. S., 2001, Wireless Communications, Principles and Practice, 2nd
ed. Prentice Hall, Upper Saddle River, NJ, USA pp. 1-40.
 N. Patwari, J. N. Ash, S. Kyperountas, A. O. Hero Iii, R. L. Moses, and N. S.
Correal, "Locating the nodes: cooperative localization in wireless sensor networks," in
IEEE SIGNAL PROCESSING MAGAZINE. vol. 22, 2005, pp. 54-69.
. D. Niculescu and B. Nath, "DV Based Positioning in Ad Hoc Networks,
Telecommunication Systems, vol. 22, pp. 267-280, 2003.
 Chen,P.-C., 1999, “A Cellular Based Mobile Location Tracking System,”
IEEE Vehicular Technology Conference, Vol. 3, pp. 1979-1983.
 K. F. Ssu, C. H. Ou, and H. C. Jiau, "Localization with mobile anchor points in
wireless sensor networks," IEEE TRANSACTIONS ON VEHICULAR
TECHNOLOGY, vol. 54, pp. 1187-1197, 2005.
 S. Capkun, M. Hamdi, and J. P. Hubaux, "GPS-free Positioning in Mobile Ad Hoc
Networks," Cluster Computing, vol. 5, pp. 157-167, 2002.
 G. Gallo, F. Malucelli, and M. Marre, “Hamiltonian paths algorithms for disk
scheduling," Technical Report 20/94, Dipartimento di Informatica, Universita di Pisa,
. D. Niculescu and B. Nath, "DV Based Positioning in Ad Hoc Networks,"
Telecommunication Systems, vol. 22, pp. 267-280, 2003.
. R. Nagpal, H. Shrobe, and J. Bachrach, "Organizing a global coordinate system
from local information on an ad hoc sensor network," Springer, 2003.
 J. M. Bahi, A. Makhoul, and A. Mostefaoui, "A Mobile Beacon Based Approach
for Sensor Network Localization," in Third IEEE International Conference on Wireless
and Mobile Computing,Networking and Communications, 2007, pp. 44-52.
 S.Rao “Composite approach to deal with the localization problem in wireless
sensor network” .
 A.Pal “Wireless Sensor Networks Current Approaches and Future Challenges”
Network Protocols and Algorithms ISSN 1943-3581 2010, Vol. 2, No. 1.
 Yu-Chee Tseng, You-Chiun Wang. (2008) “Distributed deployment scheme in
mobile wireless sensor networks to ensure multi level coverage.” In IEEE Transactions
on Parallel and Distributed Systems, pages 1280--1294, September, 2008.
 v.yadav “localization scheme for three dimensional wireless sensor networks using
GPS enabled wireless sensor networks ” International Journal of Next-Generation
Networks (IJNGN),Vol.1, No.1, December 2009
 Chia-Ho Ou and Kuo-Feng Ssu. (2008) “Sensor position determination with flying
anchor in three dimensional wireless sensor networks.” In IEEE Transactions on
Mobile Computing, pages 1084--1097, September 2008.
 Davide Merico and Roberto Bisiani. (2006) “Positioning, localization and tracking
in wireless sensor network.” Technical report, DISCo, NOMADIS, March, 2006.
 Guoqiang Mao, Barics Fidan, and Brian D.O. Anderson. (2007) “Wireless sensor
network localization techniques.” In Computer Network: The International Journal of
Computer and Telecommunications Networking, ACM, 51:2529--2553, July 2007.