This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Wireless Sensor Network typically assimilates various real time applications that must meet some QoS requirements (e.g. delay, jitter, throughput, packet loss) under severe resourc...
Muhammad Mostafa Monowar, Md. Obaidur Rahman, Byun...
Abstract—In this paper we address the problem of energyefficient event detection in wireless sensor networks (WSNs). Duty cycling is a fundamental approach to conserving energy i...
We demonstrate a system built using probabilistic techniques that allows for remarkably accurate localization across our entire office building using nothing more than the built-...
Andreas Haeberlen, Eliot Flannery, Andrew M. Ladd,...