consider the whole building, the sensor nodes will sit on the floors to form coplanar groups.

    Therefore, we study range-based WSN localization problem in 3D environments that induce hyperplanar groupings. First, we show that it is an -hard problem to obtain hyperplanar groups, even if we are given the equations of the hyperplanes. Then, we describe an algorithm that assumes each sensor node is aware of its hyperplanar group, and performs a localization when the sensor nodes are deployed in the corridors on each floor of a building. In this case, grouping information allows us to localize a network, which cannot be localized by conventional range-based localization algorithms.
author:
- 'Onur Çağ[i]{}r[i]{}c[i]{}'
bibliography:
- 'ref.bib'
title: 'Utilizing hyperplanar substructures to perform efficient range-based WSN localization'
---

Introduction {#sec:intro}
============

Recent developments in technology pose a need for wireless sensor network technologies to be used broadly [@survey]. A *wireless sensor node* is a small device that is equipped with a radio transmitter. A *wireless sensor network*, in short WSN, is the collection of many wireless sensor nodes. Each node is able to communicate and measure its distance to another node within the radio’s distance. Independent of the application area, the location 