Sciweavers

242 search results - page 32 / 49
» Approximately uniform random sampling in sensor networks
Sort
View
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 7 months ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...
IJSNET
2008
115views more  IJSNET 2008»
13 years 6 months ago
Event-driven sensor deployment using self-organizing maps
: Coverage is an important optimization objective in pre and post-deployment stage of a Wireless Sensor Network (WSN). In this paper, we address the issue of placing a finite set o...
Cris Koutsougeras, Yi Liu, Rong Zheng
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
13 years 1 months ago
Generalized multicircumcenter trajectories for optimal design under near-independence
This work deals with trajectory optimization for a network of robotic sensors sampling a spatio-temporal random field. We examine the problem of minimizing over the space of networ...
Rishi Graham, Jorge Cortés
CN
2007
122views more  CN 2007»
13 years 6 months ago
Impact of mobility on the performance of relaying in ad hoc networks - Extended version
— We consider a mobile ad hoc network consisting of three types of nodes: source, destination, and relay nodes. All the nodes are moving over a bounded region with possibly diffe...
Ahmad Al Hanbali, Arzad Alam Kherani, Robin Groene...
MSWIM
2004
ACM
14 years 5 days ago
Quantile models for the threshold range for k-connectivity
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
Henri Koskinen