Sciweavers

12659 search results - page 310 / 2532
» The distributed breakout algorithms
Sort
View
MOBIHOC
2006
ACM
16 years 6 months ago
DRAND: : distributed randomized TDMA scheduling for wireless ad-hoc networks
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...
Injong Rhee, Ajit Warrier, Jeongki Min, Lisong Xu
SASN
2006
ACM
16 years 23 days ago
Autonomous and distributed node recovery in wireless sensor networks
Intrusion or misbehaviour detection systems are an important and widely accepted security tool in computer and wireless sensor networks. Their aim is to detect misbehaving or faul...
Mario Strasser, Harald Vogt
INFOCOM
2005
IEEE
16 years 12 days ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
CAL
2007
15 years 6 months ago
Logic-Based Distributed Routing for NoCs
—The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. ...
José Flich, José Duato
TIT
2008
61views more  TIT 2008»
15 years 6 months ago
A Probabilistic Upper Bound on Differential Entropy
A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution...
Erik G. Learned-Miller, Joseph DeStefano