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

Manjarres, Diana; Ser, Javier Del; Gil-López, Sergio; Vecchio, Massimo; Landa-Torres, Itziar; López-Valcarce, Roberto

doi:10.1007/s00500-012-0897-2

Cited by 26 publications

(12 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Assume that there are N neighboring anchor nodes around the unknown node, and M valid triangles through the APIT judgment on C 3 N triangles. The computation of the intersection of M valid triangles is time consuming [22]. Moreover, different valid triangles should have different roles in the evaluation which is not included in the traditional APIT.…”

Section: Apit Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

An Indoor Collaborative Coefficient-Triangle APIT Localization Algorithm

Chen

Zhang

et al. 2017

Algorithms

View full text Add to dashboard Cite

Abstract:The Approximate Point-In-Triangulation (APIT) localization algorithm is a widely used indoor positioning technology due to its simplicity and low power consumption. However, in practice, In-to-Out misjudgments exist regularly in APIT, and a considerable amount of nodes cannot be positioned due to the low node density. To tackle this issue, a Collaborative Coefficient-triangle APIT Localization (CCAL) algorithm is proposed. Firstly, an effective triangle criterion is put forward to reduce the probability of In-to-Out misjudgment and reduce the computational complexity. Then, a further Received Signal Strength Indicator (RSSI) location and weighted triangle coordinate calculation method is adopted to reduce the positioning error. Meanwhile, the idea of iterative collaborative positioning of the positioned unknown nodes is introduced to remarkably expand the localization coverage rate. Simulation results show that the proposed algorithm outperforms APIT, RSSI, and other improved algorithms in terms of both node location error and localization coverage rate.

show abstract

Section: Apit Algorithmmentioning

confidence: 99%

“…consuming [22]. Moreover, different valid triangles should have different roles in the evaluation which is not included in the traditional APIT.…”

Section: Apit Algorithmmentioning

confidence: 99%

An Indoor Collaborative Coefficient-Triangle APIT Localization Algorithm

Chen

Zhang

et al. 2017

Algorithms

View full text Add to dashboard Cite

show abstract

“…HS has been successfully used in a wide range of applications [18][19][20][21][22][23][24][25], which has attracted a lot of research attention undertaken to further improve its performance. Combining HS and local search, a novel sensor localization approach is proposed by Manjarres et al [26]. Minimizing energy consumption and maximizing the network lifetime of a wireless sensor network (WSN) problem using the HS algorithm was closely studied [27][28][29][30].…”

Section: Introductionmentioning

confidence: 99%

A New Differential Mutation Based Adaptive Harmony Search Algorithm for Global Optimization

Zhao

Hao

et al. 2020

Applied Sciences

View full text Add to dashboard Cite

The canonical harmony search (HS) algorithm generates a new solution by using random adjustment. However, the beneficial effects of harmony memory are not well considered. In order to make full use of harmony memory to generate new solutions, this paper proposes a new adaptive harmony search algorithm (aHSDE) with a differential mutation, periodic learning and linear population size reduction strategy for global optimization. Differential mutation is used for pitch adjustment, which provides a promising direction guidance to adjust the bandwidth. To balance the diversity and convergence of harmony memory, a linear reducing strategy of harmony memory is proposed with iterations. Meanwhile, periodic learning is used to adaptively modify the pitch adjusting rate and the scaling factor to improve the adaptability of the algorithm. The effects and the cooperation of the proposed strategies and the key parameters are analyzed in detail. Experimental comparison among well-known HS variants and several state-of-the-art evolutionary algorithms on CEC 2014 benchmark indicates that the aHSDE has a very competitive performance.

show abstract

“…Regarding wireless sensor networks, the harmony search algorithm has been used for clustering [5], envelopment [6] and positioning [7].…”

mentioning

confidence: 99%

Improved Routing in Wireless Sensor Networks Using Harmony Search Algorithm

Rahimkhani¹,

Forouzesh²

2017

WSN

View full text Add to dashboard Cite

One of the most important issues of wireless sensor networks is how to transfer information from the network nodes to a base station and choose the best possible path for this purpose. Choosing the best path can be based on different factors such as energy consumption, response time, delay, and data transfer accuracy. Increasing the network lifetime is the most challenging problem. One of the latest energy-aware routing methods is to use the harmony search algorithm in the small-scale sensor networks. The aim of this study is to introduce the harmony search algorithm as a successful metaheuristic algorithm for wireless sensor network routing in order to increase the lifetime of such networks. This study is intended to improve the objective function for energy efficiency in the harmony search algorithm to establish balance between the network energy consumption and path length control. Therefore, it is necessary to choose the initial energy of each node randomly from a certain range as the path energy consumption should be low to choose a path which can consider the residual energy. In other words, a path should be chosen to establish balance between the network energy consumption and the minimum residual energy. The simulation results indicate that the proposed objective function provides a longer lifetime by 26.12% compared with EEHSBR.

show abstract

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

Cited by 26 publications

References 30 publications

An Indoor Collaborative Coefficient-Triangle APIT Localization Algorithm

An Indoor Collaborative Coefficient-Triangle APIT Localization Algorithm

A New Differential Mutation Based Adaptive Harmony Search Algorithm for Global Optimization

Improved Routing in Wireless Sensor Networks Using Harmony Search Algorithm

Contact Info

Product

Resources

About