Deterministic linear-hexagonal path traversal scheme for localization in wireless sensor networks

Das, Tisan; Swain, Rakesh Ranjan; Khilar, Pabitra Mohan; Senapati, Biswa Ranjan

doi:10.1007/s11276-020-02404-1

Cited by 4 publications

(4 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results show that the algorithm is superior to the traditional algorithm in accuracy. Compared with the latter, we further prove that when the number of sensors is large enough, it can reach the lee average and the variance of about 0, thus achieving unprecedented precision performance in the distance‐free technology 17 . The model is a routing protocol based on location information to provide a reliable location, and uses the interchangeability of wireless communication technology in data rate and transmission distance to provide better guarantee for network operation.…”

Section: Proposed Methodsmentioning

confidence: 92%

“…Compared with the latter, we further prove that when the number of sensors is large enough, it can reach the lee average and the variance of about 0, thus achieving unprecedented precision performance in the distance-free technology. 17 The model is a routing protocol based on location information to provide a reliable location, and uses the interchangeability of wireless communication technology in data rate and transmission distance to provide better guarantee for network operation. In order to overcome the energy hole problem of some WSNs, Chen proposed a WSN lifetime optimization algorithm based on mobile aggregation nodes.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Research and application of node fuzzy identification and localization in wireless sensor networks

2021

Int J Communication

View full text Add to dashboard Cite

In recent years, sensor technology has attracted the attention of countries all over the world because of its potential huge application value, and it has played an important role in people's daily life and social production activities.This paper mainly studies the location algorithm based on ranging in the location algorithm and analyzes the advantages and disadvantages of the algorithm. In order to optimize the positioning of wireless sensor networks, a fuzzy controller is designed to fuzzify the input information of sensor nodes. Using Matlab network simulation tool, the congestion control algorithm proposed in this paper was simulated and compared with several typical congestion control protocols in wireless sensor networks. Experimental results show that the algorithm can improve network throughput, reduce network packet loss, and have a significant impact on network performance. The network throughput of the congestion control algorithm based on fuzzy logs is stable at 180 packets per second. Compared with CODA, the congestion control algorithm based on fuzzy logarithm increases the packet loss rate by 55-66%, and the SenTCP algorithm increases by 37-40%. It can be seen that congestion control algorithms based on fuzzy logic can play an important role in wireless sensor networks.

show abstract

Section: Proposed Methodsmentioning

confidence: 92%

Section: Related Workmentioning

confidence: 99%

Research and application of node fuzzy identification and localization in wireless sensor networks

2021

Int J Communication

View full text Add to dashboard Cite

show abstract

“…In this context, most recent proposed models have only used three regular geometric shapes, namely, triangle, square, and hexagon to tessellate a two-dimensional plane as the basis for constructing routing paths [6]. Examples of such research include square grid decomposition [7,27,43,50], triangle grid decomposition [15,17,20,21,30] and the ones based on hexagonal grid decomposition can be found in [6,8,11,22] The main contributions of this work are the design, implementation and evaluation of a path planning method for mobile anchor-based on square grid decomposition called Union-curve. The latter contains all beacon points of five trajectories, HILBERT, SCAN, S-type, Σ-Scan, and Z-curve, which maximize the number of beacon points.…”

Section: E a R L Y B I R Dmentioning

confidence: 99%

Square grid Path Planning for Mobile Anchor-Based Localization in Wireless Sensor Networks

BOUKHARI,

Bouamama

2024

csci

View full text Add to dashboard Cite

Localization is to provide all sensor nodes with their geographical positions. A mobile anchor-based localization in WSNs uses a mobile anchor equipped with GPS, which travels along a predetermined path. At each specified beacon point, it broadcasts its current known position to help other sensor nodes with unknown locations estimate their positions. In this paper, we analyze the determination of beacon points based on a square grid. We propose an improved path planning model named Union-curve. Our proposed model incorporates all beacon points of five previously developed paths, namely, SCAN, HILBERT, S-type, Z-curve, and $\Sigma$-Scan on the commonly used square grid decomposition of area. Unknown sensor nodes estimate their positions using two techniques, APT and WCWCL-RSSI. Simulation results show that the proposed model has higher accuracy, with a big difference in error rate compared to the other models. In addition, this model guarantees maximum coverage with less path resolution value.

show abstract

“…This will increase the localization error and reduce the number of localized nodes. Sabale and Mini 39 and Das et al 40 are some of the studies using these mobility models. The HILBERT path planning model is shown in Figure 3B.…”

Section: Literature Reviewmentioning

confidence: 99%

A path planning model based on nested regular hexagons using weighted centroid localization

Karagöl

Yıldız

2021

Int J Communication

View full text Add to dashboard Cite

Summary In many wireless sensor network (WSN) applications, the location of a sensor node is crucial for determining where the event or situation of interest occurred. Therefore, localization is one of the critical challenges in WSNs. Mobile anchor node assisted localization (MANAL) is one of the promising solutions for the localization of statically deployed sensors. The main problem in MANAL localization is that the path planning of the mobile anchor (MA) node should be done so that the localization error in the network will be minimal and that all unknown nodes in the network are covered. This paper proposes a new path planning approach called nested hexagons curves (NHexCurves) for MANAL. NHexCurves guarantees that it will receive messages from at least three non‐collinear anchors to locate all unknown nodes in the network. The proposed model has compared six different path planning schemes in the literature using weighted centroid localization (WCL). In these comparisons, first of all, localization errors of the models are compared using some statistical concepts. Second, the variation of the localization error according to parameters such as resolution (R) and the standard deviation of noise (σ) is observed. Then, with similar approaches, the standard deviation of errors, localization ratio, scalability performances, and finally, path lengths of the models are examined. The simulation results show that the NHexCurves static path planning model proposed in this study stands out compared to other models with high localization error and localization ratio performance, especially at low resolutions, due to its path design. At the same time, the lowest error values according to σ are obtained with the proposed model among all models considered.

show abstract

Deterministic linear-hexagonal path traversal scheme for localization in wireless sensor networks

Cited by 4 publications

References 32 publications

Research and application of node fuzzy identification and localization in wireless sensor networks

Research and application of node fuzzy identification and localization in wireless sensor networks

Square grid Path Planning for Mobile Anchor-Based Localization in Wireless Sensor Networks

A path planning model based on nested regular hexagons using weighted centroid localization

Contact Info

Product

Resources

About