Sciweavers

279 search results - page 3 / 56
» Randomized k-Coverage Algorithms For Dense Sensor Networks
Sort
View
SASN
2004
ACM
13 years 10 months ago
Revisiting random key pre-distribution schemes for wireless sensor networks
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
Joengmin Hwang, Yongdae Kim
ICDCS
2008
IEEE
13 years 11 months ago
Enabling Accurate Node Control in Randomized Duty Cycling Networks
— In this paper, we propose a novel duty cycling algorithm for large-scale dense wireless sensor networks. The proposed algorithm is based on a social behavior of nodes in the se...
Kang-Won Lee, Vasileios Pappas, Asser N. Tantawi
AVI
2006
13 years 6 months ago
Just how dense are dense graphs in the real world?: a methodological note
This methodological note focuses on the edge density of real world examples of networks. The edge density is a parameter of interest typically when putting up user studies in an e...
Guy Melançon
ADHOCNOW
2008
Springer
13 years 11 months ago
Geographic Routing with Early Obstacles Detection and Avoidance in Dense Wireless Sensor Networks
Existing geographic routing algorithms for sensor networks are mainly concerned with finding a path toward a destination, without explicitly addressing the impact of obstacles on ...
Luminita Moraru, Pierre Leone, Sotiris E. Nikolets...
IJOE
2006
75views more  IJOE 2006»
13 years 4 months ago
Comparison of Intensive and Extensive Sensor Networking Technologies
The objective of this paper is to emphasize a clear and natural distinction in strategies of sensor network design. In order to display different architectural paradigms in today&#...
Marek Miskowicz