A hierarchical position based routing scheme for data centric wireless sensor networks

We propose a novel, scalable, and distributed location aware routing protocol for low power data centric wireless sensor network applications. Based on self-location information and that of a sink node, the nodes assign themselves to rectangular clusters known by a cluster id. Routing on the basis of cluster ids instead of node ids reduces the routing information exchange to a great extent. The way, the cluster ids are assigned make the routing decisions inherently known and simple. Dynamic clustering architecture and data aggregation make it energy efficient. Although the protocol is developed for a real world application; wireless container management system, its important features like distributed nature, scalability, and hierarchical approach make it viable to be used in applications where nodes know their positions. The simulation results show that the proposed solution comes along with little protocol overhead in a fairly static network and the clustered architecture is energy efficient and scalable.