Self-nominating: a robust affordable routing for wireless sensor networks

In this paper we present a new routing approach, self-nominating, for wireless sensor networks. A time-based self-maintained mechanism is used to improve the routing efficiency in terms of both delay and power consumption. It guarantees one and only one of the most promising next-hop nodes to relay broadcasted data packets. Each sensor node passively supervises all its neighbors´ behavior and decides its own activity in the routing process accordingly to achieve a resource-aware routing. Analyses and simulation results show that the self-nominating achieves affordability in terms of resource consumptions, and robustness in dealing with node failures.