Sciweavers

343 search results - page 65 / 69
» Performance Limits of Fair-Access in Underwater Sensor Netwo...
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 11 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
TSP
2008
149views more  TSP 2008»
13 years 7 months ago
Decentralized Quantized Kalman Filtering With Scalable Communication Cost
Estimation and tracking of generally nonstationary Markov processes is of paramount importance for applications such as localization and navigation. In this context, ad hoc wireles...
Eric J. Msechu, Stergios I. Roumeliotis, Alejandro...
SASN
2004
ACM
14 years 28 days ago
Securing quality-of-service route discovery in on-demand routing for ad hoc networks
An ad hoc network is a collection of computers (nodes) that cooperate to forward packets for each other over a multihop wireless network. Users of such networks may wish to use de...
Yih-Chun Hu, David B. Johnson
ICDCS
2010
IEEE
13 years 8 months ago
Link-Centric Probabilistic Coverage Model for Transceiver-Free Object Detection in Wireless Networks
Abstract--Sensing coverage is essential for most applications in wireless networks. In traditional coverage problem study, the disk coverage model has been widely applied because o...
Dian Zhang, Yunhuai Liu, Lionel M. Ni
CDC
2009
IEEE
142views Control Systems» more  CDC 2009»
13 years 5 months ago
Asynchronous distributed optimization with minimal communication and connectivity preservation
Abstract-- We consider problems where multiple agents cooperate to control their individual state so as to optimize a common objective while communicating with each other to exchan...
Minyi Zhong, Christos G. Cassandras