Sciweavers

470 search results - page 39 / 94
» A secure alternate path routing in sensor networks
Sort
View
MONET
2006
102views more  MONET 2006»
13 years 8 months ago
Locating and Bypassing Holes in Sensor Networks
In real sensor network deployments, spatial distributions of sensors are usually far from being uniform. Such networks often contain regions without enough sensor nodes, which we ...
Qing Fang, Jie Gao, Leonidas J. Guibas
ADHOCNOW
2005
Springer
14 years 1 months ago
Enhancing the Security of On-demand Routing in Ad Hoc Networks
We present the Ad-hoc On-demand Secure Routing (AOSR) protocol, which uses pairwise shared keys between pairs of mobile nodes and hash values keyed with them to verify the validity...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
DCOSS
2005
Springer
14 years 1 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
CDC
2009
IEEE
151views Control Systems» more  CDC 2009»
14 years 20 days ago
Shortest path optimization under limited information
— The problem of finding an optimal path in an uncertain graph arises in numerous applications, including network routing, path-planning for vehicles, and the control of finite...
Michael Rinehart, Munther A. Dahleh
IPSN
2010
Springer
14 years 2 months ago
Routing without routes: the backpressure collection protocol
Current data collection protocols for wireless sensor networks are mostly based on quasi-static minimum-cost routing trees. We consider an alternative, highly-agile approach calle...
Scott Moeller, Avinash Sridharan, Bhaskar Krishnam...