Sciweavers

2863 search results - page 95 / 573
» Constructing minimum-interference networks
Sort
View
INFOCOM
2011
IEEE
14 years 4 months ago
Fully secure pairwise and triple key distribution in wireless sensor networks using combinatorial designs
—We address pairwise and (for the first time) triple key establishment problems in wireless sensor networks (WSN). We use combinatorial designs to establish pairwise keys betwee...
Sushmita Ruj, Amiya Nayak, Ivan Stojmenovic
TON
2012
13 years 3 months ago
Some Fundamental Results on Base Station Movement Problem for Wireless Sensor Networks
—The benefits of using mobile base station to prolong sensor network lifetime have been well recognized. However, due to the complexity of the problem (time-dependent network to...
Yi Shi, Y. Thomas Hou
JAIR
2010
181views more  JAIR 2010»
14 years 8 months ago
Intrusion Detection using Continuous Time Bayesian Networks
Intrusion detection systems (IDSs) fall into two high-level categories: network-based systems (NIDS) that monitor network behaviors, and host-based systems (HIDS) that monitor sys...
Jing Xu, Christian R. Shelton
DAC
2011
ACM
14 years 1 months ago
Fault-tolerant 3D clock network
Clock tree synthesis is one of the most important and challenging problems in 3D ICs. The clock signals have to be delivered by through-silicon vias (TSVs) to different tiers with...
Chiao-Ling Lung, Yu-Shih Su, Shih-Hsiu Huang, Yiyu...
SOICT
2010
14 years 8 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...