Sciweavers

1565 search results - page 32 / 313
» Randomized Self-stabilizing Algorithms for Wireless Sensor N...
Sort
View
WOWMOM
2009
ACM
143views Multimedia» more  WOWMOM 2009»
14 years 3 months ago
Improving partial cover of Random Walks in large-scale Wireless Sensor Networks
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
Leonidas Tzevelekas, Ioannis Stavrakakis
ICCS
2007
Springer
14 years 2 months ago
An ID-Based Random Key Pre-distribution Scheme for Wireless Sensor Networks
When wireless senor networks (WSNs) are deployed in hostile areas, they indeed need to be secured by security mechanisms. To do this, cryptographic keys must be agreed on by commun...
Tran Thanh Dai, Choong Seon Hong
INFOCOM
2007
IEEE
14 years 3 months ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri
INFOCOM
2011
IEEE
13 years 4 days ago
SelectCast: Scalable data aggregation scheme in wireless sensor networks
—In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gat...
Cheng Wang, ShaoJie Tang, Xiang-Yang Li, Changjun ...
INFOCOM
2006
IEEE
14 years 2 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