English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we propose a range-based localization algorithm to localize awireless sensor network (WSN) in 2D. A widely used algorithm to localize a WSNin 2D is trilateration, which runs in polynomial time. Trilateration uses threedistance measurements to localize a node. In some cases, the lack ofconnectivity leads to a low percentage of localized nodes since a node'sposition can be fixed using three distance measurements. We propose analgorithm that finds the position of a node by using the absence of a distancemeasurement in addition to a third distance measurement. If two nodes are notable to sense each other, that means the distance between them is more than thesensing range. Therefore, our algorithm checks if the possible positions of anunlocalized node $u$ is inside the sensing range of a localized node $\ell$that is not the neighbor of $u$. In such case, we eliminate one of the possiblepositions.

Avoiding the Flip Ambiguities in 2D Wireless Sensor Localization by Using Unit Disk Graph Property