Skip to main content

Advertisement

Log in

A novel heuristic approach for distance- and connectivity-based multihop node localization in wireless sensor networks

  • Original Paper
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

The availability of accurate location information of constituent nodes becomes essential in many applications of wireless sensor networks. In this context, we focus on anchor-based networks where the position of some few nodes are assumed to be fixed and known a priori, whereas the location of all other nodes is to be estimated based on noisy pairwise distance measurements. This localization task embodies a non-convex optimization problem which gets even more involved by the fact that the network may not be uniquely localizable, especially when its connectivity is not sufficiently high. To efficiently tackle this problem, we present a novel soft computing approach based on a hybridization of the Harmony Search (HS) algorithm with a local search procedure that iteratively alleviates the aforementioned non-uniqueness of sparse network deployments. Furthermore, the areas in which sensor nodes can be located are limited by means of connectivity-based geometrical constraints. Extensive simulation results show that the proposed approach outperforms previously published soft computing localization techniques in most of the simulated topologies. In particular, to assess the effectiveness of the technique, we compare its performance, in terms of Normalized Localization Error (NLE), to that of Simulated Annealing (SA)-based and Particle Swarm Optimization (PSO)-based techniques, as well as a naive implementation of a Genetic Algorithm (GA) incorporating the same local search procedure here proposed. Non-parametric hypothesis tests are also used so as to shed light on the statistical significance of the obtained results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Algorithm 1
Fig. 2
Algorithm 2
Fig. 3

Similar content being viewed by others

Notes

  1. Unity-valued weights and no normalization have been considered in the sum fitness, since the values of both constituent metrics result to be in the same order of magnitude and thus, comparable for the scenario at hand.

  2. Indeed, it is worth to notice that the proposed error term represents the minimum error due to a localization flip.

References

  • Akyildiz IF, Su W, Sankarasubramaniam Y, Cayirci E (2002) Wireless sensor networks: a survey. Comput Netw 38:393–422

    Article  Google Scholar 

  • Alippi C, Vanini G (2006) A RSSI-based and calibrated centralized localization technique for wireless sensor networks. In: Proceedings of fourth IEEE international conference on pervasive computing and communications workshops, pp 301–305

  • Biswas P, Liang TC, Toh KC, Ye Y, Wang TC (2006) Semidefinite programming approaches for sensor network localization with noisy distance measurements. IEEE Trans Automat Sci Eng 3(4):360–371

    Article  Google Scholar 

  • Biswas P, Ye Y (2004) Semidefinite programming for ad-hoc wireless sensor network localization. In: Proceedings of the 3rd international symposium on information processing in sensor networks. ACM Press, New York, pp 46–54

  • Bulusu N, Heidemann J, Estrin D (2000) GPS-less Low-cost outdoor localization for very small devices. IEEE Personal Commun 7(5):28–34

    Article  Google Scholar 

  • Costa JA, Patwari N, Hero AO (2006) Distributed weighted-multidimensional scaling for node localization in sensor networks. ACM Trans Sens Netw 2:1

    Article  Google Scholar 

  • Del Ser J, Matinmikko M, Gil-Lopez S, Mustonen M (2010) A novel harmony search based spectrum allocation technique for cognitive radio networks. IEEE international symposium on wireless communication systems, pp 233–237

  • Del Ser J, Bilbao MN, Gil-Lopez S, Matinmikko M, Salcedo-Sanz S (2011) Iterative power and subcarrier allocation in rate-constrained orthogonal multicarrier downlink systems based on hybrid harmony search heuristics. Eng Appl Artif Intell 24(5):748–756

    Google Scholar 

  • Forsati R, Haghighat AT, Mahdavi M (2008) Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing. Comput Commun 31(10):2505–2519

    Article  Google Scholar 

  • Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. Simulation 76(2):60–68

    Article  Google Scholar 

  • Gil-Lopez S, Del Ser J, Olabarrieta I (2009) A novel heuristic algorithm for multiuser detection in synchronous cdma wireless sensor networks. IEEE international conference on ultra modern communications, pp 1–6

  • Gopakumar A, Jacob L (2008) Localization in wireless sensor network using particle swarm optimization. IET international conference on wireless, mobile and multimedia networks, pp 227–230

  • He T, Huang C, Blum B, Stankovic J, Abdelzaher T (2003) Range-free localization schemes in large scale sensor network. In: Proceedings of the ninth annual international conference on mobile computing and networking, pp 81–95

  • Hochberg Y, Tamhane AC (1987) Multiple comparison procedures. Wiley, New York

    Book  MATH  Google Scholar 

  • Hollander M, Wolfe DA (1973) Nonparametric statistical methods. Wiley, New York

    MATH  Google Scholar 

  • Hu L, Evans D (2004) Localization for Mobile Sensor Networks. Proceedings of the 10th International Conference on Mobile Computing and Networking, pp 45–57

  • Ji X, Zha H (2004) Sensor positioning in wireless ad-hoc sensor networks using multidimensional scaling. In: Proceedings of the 23rd annual joint conference of the IEEE computer and communications societies, pp 2652–2661

  • Kannan AA, Fidan B, Mao G, Anderson BDO (2007) Analysis of flip ambiguities in distributed network localization. information, decision and control, pp 193–198

  • Kannan AA, Fidan B, Mao G (2010) Analysis of flip ambiguities for robust sensor network localization. IEEE Trans Veh Technol 59(4):2057–2070

    Article  Google Scholar 

  • Kannan AA, Mao G, Vucetic B (2005) Simulated annealing based localization in wireless sensor network. In: Proceedings of the IEEE conference on local computer networks. IEEE Computer Society, pp 513–514

  • Kannan AA, Mao G, Vucetic B (2006) Simulated annealing based wireless sensor network localization with flip ambiguity mitigation. In: Proceedings of the 63-rd IEEE vehicular technology conference 1022–1026

  • Liang TC, Wang TC, Ye Y (2004) A Gradient Search Method to Round the Semidefinite Programming Relaxation for Ad Hoc Wireless Sensor Network Localization. Standford University Technical Report

  • Liao TW (2010) Two hybrid differential evolution algorithms for engineering design optimization. Appl Soft Comput 10(4):1188–1199

    Article  Google Scholar 

  • Liu T, Bahl P, Chlamtac I (1998) Mobility modeling, location tracking, and trajectory prediction in wireless ATM networks. IEEE J Sel Areas Commun 16(6):922–936

    Article  Google Scholar 

  • Mauve M, Widmer J, Hartenstein H (2001) A survey on position-based routing in mobile adhHoc networks. IEEE Netw 15(6):30–39

    Article  Google Scholar 

  • Moré JJ, Wu Z (1997) Global continuation for distance geometry problems. SIAM J Optimiz 7(3):814–836

    Article  MATH  Google Scholar 

  • Niculescu D, Nath B (2001) Ad hoc positioning system (APS). IEEE global communications conference (GLOBECOM) 5:2926–2931

    Google Scholar 

  • Niculescu D, Nath B (2003) Ad-hoc positioning system (APS) using AoA. In: Proceedings of the 20st annual joint conference of the IEEE computer and communications societies 3:1734–1743

  • Priyantha N, Balakrishnan H, Demaine E, Teller S (2003) Anchor-free distributed localization in sensor network. MIT Laboratory for Computer Science TR-892

  • Savvides A, Han CC, Srivastava M (2001) Dynamic fine-grained localization in ad-hoc networks of sensors. In: 7th ACM international conference on mobile computing and networking, pp 166–179

  • Shang Y, Ruml W, Zhang Y, Fromherz M (2003) Localization from mere connectivity. In: Proceedings of ACM symposium on mobile ad hoc networking and computing, pp 201–212

  • Shang Y, Ruml W, Zhang Y, Fromherz M (2004) Localization from Connectivity in Sensor Networks. IEEE Trans Parallel Distributed Syst 15(11):961–974

    Article  Google Scholar 

  • Shekofteh SK, Khalkhali MB, Yaghmaee MH, Deldari H (2010) Localization in Wireless Sensor Networks using Tabu Search and Simulated Annealing. In: 2nd international conference on computer and automation engineering (ICCAE) 2:752–757

  • Tseng P (2007) Second-order cone programming relaxation of sensor network localization. SIAM J Optim 18(1):156–185

    Article  MATH  Google Scholar 

  • Wang Z, Zheng S, Ye Y, Boyd S (2008) Further relaxations of the semidefinite programming approach to sensor network localization. SIAM J Optim 19(2):655–673

    Article  MathSciNet  MATH  Google Scholar 

  • Zhang R, Hanzo L (2009) Iterative multiuser detection and channel decoding for DS-CDMA using harmony search. IEEE Signal Process Lett 16(10):917–920

    Article  Google Scholar 

Download references

Acknowledgments

This work has been supported in part by the Spanish Ministry of Science and Innovation through the CONSOLIDER-INGENIO 2010 (CSD200800010) and the Torres-Quevedo (PTQ-09-01-00740) funding programs.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Javier Del Ser.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Manjarres, D., Del Ser, J., Gil-Lopez, S. et al. A novel heuristic approach for distance- and connectivity-based multihop node localization in wireless sensor networks. Soft Comput 17, 17–28 (2013). https://doi.org/10.1007/s00500-012-0897-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-012-0897-2

Keywords

Navigation