Abstract—In this paper, we study algebraic aggregate computations in Sensor Networks. The main contribution is the presentation of an early-stopping protocol that computes the av...
—E-limited (or K-limited) scheduling is attractive because its performance is close to that of the exhaustive scheduling which is proven to be the optimal polling scheme for symm...
Existing solutions for top-k queries in wireless sensor networks mainly focused on energy efficiency and little attention has been paid to the response time to answer a top-k que...
— The proliferation of wireless and mobile devices has fostered the demand of context aware applications, in which location is often viewed as one of the most significant context...
Supporting mobility in Wireless ATM networks poses a number of technical issues. An important issue is the ability to reroute ongoing virtual connections during handoff as mobile ...