Distance Based Node Localization and Tracking of “Off-Road Vehicle Racing” With Gauss-Newton Algorithm

Rajdeep Singh Sohal*, Jaipreet Kaur**
* Assistant Professor, Department of Electronics and Communication Engineering, Guru Nanak Dev University Regional Campus, Fattu Dhinga, Punjab, India.
** Assistant Professor, Department of Electronics and Communication Engineering, Guru Nanak Dev University Regional Campus, Sathiala, Punjab, India
Periodicity:November - January'2017
DOI : https://doi.org/10.26634/jcs.6.1.10353

Abstract

Target Localization and Tracking are the primary challenges for Wireless Sensor Networks (WSNs), where adding GPS receivers or other tracking based sensors to every node could be expensive. The use of technology is increased to enrich the experience of sporting events. Such technology, along its associated graphics and statistics not only entertains viewers, but also enables them to gain insight into the performance of athletes. Localization schemes for sensor networks use a small number of seed nodes that know their location and protocols, whereby the locations of other nodes are estimated from the messages sent from all nodes to seed nodes. Several such localization techniques have been proposed, but none of them consider mobile nodes and seeds. The traditional localization methods attain high location accuracy in line of sight (LOS) environment. But the localization accuracy degrades significantly in non-line of sight (NLOS) environment. This paper addresses the problems of tracking a mobile target by localizing a node. It appears that mobility would make localization more difficult. To solve this problem, the Gauss-Newton algorithm is adopted in this paper. It uses connectivity information to find the location of nodes in a network and can take advantage of additional data, such as estimated distances between neighbours or known positions for certain anchor nodes. It can exploit mobility to improve the accuracy and precision of localization. This scheme outperforms the best known static localization schemes under a wide range of conditions. The proposed algorithm is implemented in MATLAB. This approach works much better for topologies in which the shortest path distance between two nodes does not correspond well to their Euclidean distance.

Keywords

How to Cite this Article?

Sohal, R. S., and Kaur, J. (2017). Distance Based Node Localization and Tracking of “Off-Road Vehicle Racing” With Gauss-Newton Algorithm. i-manager’s Journal on Communication Engineering and Systems, 6(1), 1-8. https://doi.org/10.26634/jcs.6.1.10353

References

[1]. D. Ganesan, B. Krishnamachari, A. Woo, D. Culler, D. Estrin, and S. Wicker (2002). “An empirical study of epidemic algorithms in large scale multihop wireless networks”. UCLA Computer Science Department, Technical Report UCLA/CSD-TR-02-0013.
[2]. Y. Shang, W. Ruml, Y. Zhang, and M. Fromherz, (2003). “Localization from mere connectivity in ACM”. MobiHoc '03 Annapolis, Maryland, USA, pp. 201–212.
[3]. Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., and Cayirci, E., (2002). “Wireless Sensor Networks: A survey”. Computer Network, Vol.38, pp.393-422.
[4]. Szymon, F., and Martin, C., (2007). “On the problem of energy efficiency of multi-hop vs. one-hop routing in st Wireless Sensor Networks”. In Proceedings of the 21 International Conference on Advanced Information Networking and Applications Workshops (AINAW), Niagara Falls, Canada, pp. 380-385.
[5]. Deng, J. (2009). “Multi-hop/Direct Forwarding (MDF) for static Wireless Sensor Networks”. ACM Trans. Sens. Netw., Vol.5, No.4, pp.1-25.
[6]. Younis, O., and Fahmy, S.,(2004). “HEED: A Hybrid, Energy-Efficient, Distributed clustering approach for ad hoc sensor networks”. IEEE Trans. Mobile Computing, Vol.3, No.4, pp.366-379.
[7]. Al-Karaki, J.N., and Kamal, A.E., (2004). “Routing techniques in Wireless Sensor Networks: A Survey”. IEEE Wirel. Commun., Vol.11, No.6, pp. 6-28.
[8]. Akkaya, K., and Younis, M., (2005). “A survey on routing protocols in wireless sensor networks”. Ad-hoc. Netw., Vol.3, No.3, pp.325-456.
[9]. Shah, R.C., and Rabaey, J.M., (2002). “Energy aware routing for low energy ad hoc sensor networks”. In Proceedings of the IEEE Wireless Communications and Networks Conference (WCNC '02), Orlando, FL, USA, pp.350-355.
[10]. Heinzelman, W., (2000). Application-specific Protocol Architectures for Wireless Networks. (Ph.D. Thesis, Massachusetts Institute of Technology: Cambridge, MA, USA).
[11]. Rodoplu, V., Ming, T.H., (1999). “Minimum energy mobile wireless networks”. IEEE J. Sel. Areas Comm., Vol.17, No.8, pp.1333-1344.
[12]. Li, L., Halpern, J.Y., (2001). “Minimum energy mobile wireless networks revisited”. In Proceedings of IEEE International Conference on Communications (ICC'01), Helsinki, Finland, pp.278-283.
[13]. Yang, J., Xu, M., Zhao, W., Xu, B., (2010). “A multipath routing protocol based on clustering and Ant Colony Optimization for Wireless Sensor Networks”. Sensors, Vol.10, No.5, pp.4521-4540.
[14]. Li X., Xu L., Wang H., Song J., Yang S.X., (2010). “A Differential evolution-based routing algorithm for environmental monitoring Wireless Sensor Networks”. Sensors, Vol.10, No.6, pp.5425-5442.
[15]. Youssef, W., Younis, M., (2010). “Optimized asset planning for minimizing latency in Wireless Sensor Networks”. Wirel. Netw., Vol.16, No.1, pp. 65-78.
[16]. Yang H., Ye F., Sikdar B., (2008). “A swarmintelligence- based protocol for data acquisition in networks with mobile sinks”. IEEE Trans. Mobile Comput., Vol.7, No.8, pp. 931-945.
[17]. Stojmenovic I., Lin X., (2001). “Power-aware localized routing in wireless networks. IEEE Trans. Parallel Distrib. Syst., Vol.12, No.11, pp.1121-1133.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.