Sciweavers

3247 search results - page 65 / 650
» Randomized smoothing networks
Sort
View
INFOCOM
2006
IEEE
15 years 6 months ago
Is Deterministic Deployment Worse than Random Deployment for Wireless Sensor Networks?
— Before a sensor network is deployed, it is important to determine how many sensors are required to achieve a certain coverage degree. The number of sensor required for maintain...
Honghai Zhang, Jennifer C. Hou
COMCOM
2006
147views more  COMCOM 2006»
14 years 12 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
JSAC
2010
138views more  JSAC 2010»
14 years 10 months ago
Dynamic conjectures in random access networks using bio-inspired learning
—Inspired by the biological entities’ ability to achieve reciprocity in the course of evolution, this paper considers a conjecture-based distributed learning approach that enab...
Yi Su, Mihaela van der Schaar
CN
2002
98views more  CN 2002»
14 years 11 months ago
Modeling random early detection in a differentiated services network
An analytical framework for modeling a network of Random Early Detection (RED) queues with mixed traffic types (e.g. TCP and UDP) is developed. Expressions for the steady state go...
Alhussein A. Abouzeid, Sumit Roy
INFOCOM
2012
IEEE
13 years 2 months ago
Cuckoo sampling: Robust collection of flow aggregates under a fixed memory budget
—Collecting per-flow aggregates in high-speed links is challenging and usually requires traffic sampling to handle peak rates and extreme traffic mixes. Static selection of sa...
Josep Sanjuàs-Cuxart, Pere Barlet-Ros, Nick...