Sciweavers

1101 search results - page 219 / 221
» Simulating BDI-Based Wireless Sensor Networks
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 3 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
JCST
2007
151views more  JCST 2007»
14 years 11 months ago
Indexing Future Trajectories of Moving Objects in a Constrained Network
Abstract Advances in wireless sensor networks and positioning technologies enable new applications monitoring moving objects. Some of these applications, such as traffic managemen...
Ji-Dong Chen, Xiao-Feng Meng
QSIC
2007
IEEE
15 years 5 months ago
Synthesizing Component-Based WSN Applications via Automatic Combination of Code Optimization Techniques
Wireless sensor network (WSN) applications sense events in-situ and compute results in-network. Their software components should run on platforms with stringent constraints on nod...
Zhenyu Zhang, W. K. Chan, T. H. Tse
DCOSS
2009
Springer
15 years 4 months ago
Local Construction of Spanners in the 3-D Space
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...
Iyad A. Kanj, Ge Xia, Fenghui Zhang
ICASSP
2010
IEEE
14 years 11 months ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...