Sciweavers

376 search results - page 8 / 76
» Blocking Vulnerable Paths of Wireless Sensor Networks
Sort
View
GLOBECOM
2007
IEEE
14 years 1 months ago
A TDMA-based Scheduling and Routing Algorithm for Data-Centric Wireless Sensor Networks
—Recharging the batteries of a moribund sensor deployed as part of a wireless sensor network is often infeasible due to logistical considerations. With the purpose of prolonging ...
Yean-Fu Wen, Frank Yeong-Sung Lin, Hung-Shi Wang
INFOCOM
2010
IEEE
13 years 5 months ago
On Distributed Time-Dependent Shortest Paths over Duty-Cycled Wireless Sensor Networks
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
Shouwen Lai, Binoy Ravindran
SASN
2003
ACM
14 years 18 days ago
Modeling vulnerabilities of ad hoc routing protocols
The purpose of this work is to automate the analysis of ad hoc routing protocols in the presence of attackers. To this end, a formal model of protocol behavior is developed in whi...
Shahan Yang, John S. Baras
IWDC
2005
Springer
128views Communications» more  IWDC 2005»
14 years 26 days ago
Key Forwarding: A Location-Adaptive Key-Establishment Scheme for Wireless Sensor Networks
In this paper we propose an improved alternative for the path key establishment phase of bootstrapping in a sensor network. Our scheme lets the network adapt to the deployment conï...
Ashok Kumar Das, Abhijit Das, Surjyakanta Mohapatr...
SSS
2009
Springer
138views Control Systems» more  SSS 2009»
14 years 1 months ago
Analysis of Wireless Sensor Network Protocols in Dynamic Scenarios
We describe an approach to the analysis of protocols for wireless sensor networks in scenarios with mobile nodes and dynamic link quality. The approach is based on the theorem prov...
Cinzia Bernardeschi, Paolo Masci, Holger Pfeifer