Routing scheme for a Wireless Sensor Network real-time locating system

This work contains a routing proposition to be used over a Wireless Sensor Network (WSN) location system based on the IEEE 802.15.4 standard. The technical solution for communication consists of an n-ary tree algorithm for routing using a 16 bit addressing scheme. It is compared to a binary routing scheme originally used on a real system which suffers from coverage, routing and addressing problem. An analysis of the coverage aspects is driven by a geometric study. It includes an analysis of a generated topology for different coverage areas and different routing topologies. The geometric analysis is validated by a simulation work. We observe that the proposed scheme outperforms the existing routing solution in terms of hop-count, delay and association process time. The work puts in evidence that the Connectivity of the network is an important parameter to be considered during the network deployment and for the routing scheme.