A novel hierarchical routing protocol for wireless sensor networks

In this paper, we propose a novel hierarchical routing protocol for a large wireless sensor network (WSN) wherein sensors are arranged into a multi-layer architecture with the nodes at each layer interconnected as a de Bruijn graph and provide a novel hierarchical routing algorithm in the network. Using our approach, every sensor obtains a unique node identifier addressed by binary addressing fashion. We show that our algorithm has reasonable fault-tolerance, admits simple and decentralized routing, and offers easy extensibility. We also present simulation results showing the average delay, success data delivery radio in our approach. And we received acceptable results for some potential applications. Besides, to evaluate how well our protocol support for WSNs, we compare our protocol with other protocol using two these metrics (average delay, success data delivery radio).