Sciweavers

74 search results - page 5 / 15
» DPA-Resistance Without Routing Constraints
Sort
View
MSWIM
2006
ACM
14 years 3 months ago
Routing in intermittent network topologies
The topic of this paper is the algorithmic development of routing techniques for Delay Tolerant Networks (DTNs). Assuming a store and forward type of network transfers, our main o...
Padma Mundur, Sookyoung Lee, Matthew Seligman
DAC
2007
ACM
14 years 10 months ago
An Integer Linear Programming Based Routing Algorithm for Flip-Chip Design
The flip-chip package provides a high chip-density solution to the demand for more I/O pads of VLSI designs. In this paper, we present the first routing algorithm in the literatur...
Jia-Wei Fang, Chin-Hsiung Hsu, Yao-Wen Chang
INFOCOM
2003
IEEE
14 years 3 months ago
Sensor-Centric Quality of Routing in Sensor Networks
Abstract— Standard embeded sensor nework models emphasize energy efficiency and distributed decision-making by considering untethered and unattended sensors. To this we add two ...
Rajgopal Kannan, Sudipta Sarangi, S. Sitharama Iye...
ICDT
2005
ACM
130views Database» more  ICDT 2005»
14 years 3 months ago
Rewriting Queries Using Views with Access Patterns Under Integrity Constraints
We study the problem of rewriting queries using views in the presence of access patterns, integrity constraints, disjunction, and negation. We provide asymptotically optimal algori...
Alin Deutsch, Bertram Ludäscher, Alan Nash
ADHOC
2007
107views more  ADHOC 2007»
13 years 10 months ago
On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks
In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messa...
Weifa Liang, Yuzhen Liu