Sciweavers

470 search results - page 70 / 94
» A secure alternate path routing in sensor networks
Sort
View
APPROX
2000
Springer
153views Algorithms» more  APPROX 2000»
14 years 8 days ago
Randomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
Vincenzo Auletta, Ioannis Caragiannis, Christos Ka...
ESAS
2006
Springer
13 years 11 months ago
On Optimality of Key Pre-distribution Schemes for Distributed Sensor Networks
We derive the optimality results for key pre distribution scheme for distributed sensor networks, and relations between interesting parameters. Namely, given a key-pool of size n ...
Subhas Kumar Ghosh
DSN
2007
IEEE
14 years 2 months ago
Concilium: Collaborative Diagnosis of Broken Overlay Routes
In a peer-to-peer overlay network, hosts cooperate to forward messages. When a message does not reach its final destination, there are two possible explanations. An intermediate ...
James W. Mickens, Brian D. Noble
DATE
2007
IEEE
107views Hardware» more  DATE 2007»
14 years 2 months ago
Routing table minimization for irregular mesh NoCs
The majority of current Network on Chip (NoC) architectures employ mesh topology and use simple static routing, to reduce power and area. However, regular mesh topology is unreali...
Evgeny Bolotin, Israel Cidon, Ran Ginosar, Avinoam...
IJSNET
2007
95views more  IJSNET 2007»
13 years 7 months ago
On extracting consistent graphs in wireless sensor networks
: Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (gra...
Murtuza Jadliwala, Qi Duan, Jinhui Xu, Shambhu J. ...