Sciweavers

52 search results - page 9 / 11
» The Impact of Channel Randomness on Coverage and Connectivit...
Sort
View
DIALM
2004
ACM
161views Algorithms» more  DIALM 2004»
13 years 10 months ago
Batch conflict resolution algorithm with progressively accurate multiplicity estimation
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc....
Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad
ISCC
2006
IEEE
190views Communications» more  ISCC 2006»
14 years 20 days ago
Time-Critical Underwater Sensor Diffusion with No Proactive Exchanges and Negligible Reactive Floods
— In this paper we study multi-hop ad hoc routing in a scalable Underwater Sensor Network (UWSN), which is a novel network paradigm for ad hoc investigation of the world below th...
Uichin Lee, Jiejun Kong, Joon-Sang Park, Eugenio M...
MSWIM
2004
ACM
14 years 2 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
VTC
2007
IEEE
161views Communications» more  VTC 2007»
14 years 27 days ago
Early Results on Hydra: A Flexible MAC/PHY Multihop Testbed
— Hydra is a flexible wireless network testbed being developed at UT Austin. Our focus is networks that support multiple wireless hops and where the network, especially the MAC,...
Ketan Mandke, Soon-Hyeok Choi, Gibeom Kim, Robert ...
MOBIHOC
2005
ACM
14 years 6 months ago
Power balanced coverage-time optimization for clustered wireless sensor networks
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
Tao Shu, Marwan Krunz, Sarma B. K. Vrudhula