When the range of single-hop wireless communication is limited by distance or harsh radio propagation conditions, relays can be used to extend the communication range through mult...
Michael R. Souryal, Johannes Geissbuehler, Leonard...
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
Roland Flury, Sriram V. Pemmaraju, Roger Wattenhof...
We propose an adaptive algorithm Adaptmin to create perfectly periodic schedules. A perfectly periodic schedule schedules a client regularly after a predefined amount of time known...
— Energy efficiency is widely understood to be one of the dominant considerations for Wireless Sensor Networks. Based on historical data and technology trends, the receiver ener...
In this work we consider the problem of monitoring information streams for anomalies in a scalable and efficient manner. We study the problem in the context of network streams wher...