![]() ![]() ![]() |
![]() |
|
|
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Return to In Network Processing and Routing In this paper, we introduce a rotating interrogation technique for sensor networks called Whirlpool. Whirlpool provides opportunities to optimize data delivery in time-critical monitoring applications. We explore concurrency opportunities while delivering data using the whirlpool strategy and investigate several whirlpool algorithms. We also demonstrate extra benefits of using whirlpool with our algebraic optimization framework based on Data Transmission Algebra. ![]() ©2006 Association for Computing Machinery |