Sciweavers

376 search results - page 45 / 76
» Blocking Vulnerable Paths of Wireless Sensor Networks
Sort
View
INFOCOM
2005
IEEE
14 years 2 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
SASN
2004
ACM
14 years 1 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
APNOMS
2009
Springer
14 years 3 months ago
Bypassing Routing Holes in WSNs with a Predictive Geographic Greedy Forwarding
Applications in wireless sensor networks (WSNs) experience the routing hole problem. That is, the current node cannot forward to the destination, although it is the closest node, b...
Minh Thiep Ha, Priyadharshini Sakthivel, Hyunseung...
ADHOC
2007
122views more  ADHOC 2007»
13 years 8 months ago
Minimum latency joint scheduling and routing in wireless sensor networks
Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient ...
Gang Lu, Bhaskar Krishnamachari
SENSYS
2009
ACM
14 years 3 months ago
A wireless sensor network for border surveillance
We will demonstrate a wireless sensor network system for the surveillance of critical areas and properties – e.g. borders. The system consists of up to 10 sensor nodes that moni...
Denise Dudek, Christian Haas, Andreas Kuntz, Marti...