Energy minimization in wireless sensor networks through an adaptive connectionless scheduling protocol (adaptive CSP)

We present an approach to minimizing energy costs in wireless sensor networks through a protocol that implements near perfect scheduling based on a near perfect clock, accurate synchronization, and some discriminating node feature such as a unique identifier. Our approach is highly flexible in that options for communicating in a one-to-one or many-to-one manner are made possible without messaging overhead to set up or tear down channels. Our pseudorandom scheduling paradigm provides flexibility to serve data rate requirements over a wide range of traffic scenarios and automatically adapts to load and latency requirements, providing a high performance scheduling protocol for sensor networks and homeland security applications.