Localization in 3D wireless sensor network

Most of the wireless sensor networks (WSN) are randomly deployed in their objective terrains and therefore require a localization mechanism for the deployed nodes. Many researchers have considered WSN as a 2D deployment scenario in their research works. But when we come to reality, the actual scene is in 3D. 2D localization algorithms will not remain applicable in 3D scenario if the height/depth parameter of nodes’ coordinate has significant variations. The outcome of 2D-based localization algorithms may mislead the further computations involved in WSN. The paper aims to calculate the virtual coordinates of the sensor nodes deployed in a 3D area consisting of a single large obstacle. In this proposal, we are considering the deployment space with a single large obstacle and a distributed approach with four beacon nodes for providing localization of the deployed nodes. The paper uses region division concept for locating their virtual coordinates with respect to the obstacle. Each node is responsible for computing its coordinates. The possibility of some nodes not receiving minimum number of required signals from the beacon nodes is also considered and hence one-time transmission of the calculated data for each sensor node is included in the algorithm.