Sciweavers

632 search results - page 68 / 127
» On Routing in Circulant Graphs
Sort
View
DEBS
2003
ACM
15 years 3 months ago
A peer-to-peer approach to content-based publish/subscribe
Publish/subscribe systems are successfully used to decouple distributed applications. However, their efficiency is closely tied to the topology of the underlying network, the desi...
Wesley W. Terpstra, Stefan Behnel, Ludger Fiege, A...
ASPDAC
1998
ACM
79views Hardware» more  ASPDAC 1998»
15 years 2 months ago
Simultaneous Wire Sizing and Wire Spacing in Post-Layout Performance Optimization
- In this paper, we study the wire sizing and wire spacing problem for post-layout performance optimization under Elmore delay model. Both ground capacitance and coupled capacitanc...
Jiang-An He, Hideaki Kobayashi
INFORMS
2008
241views more  INFORMS 2008»
14 years 10 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
NAS
2010
IEEE
14 years 7 months ago
A Probabilistic Routing Protocol for Heterogeneous Sensor Networks
The past five years witnessed a rapid development in wireless sensor networks, which have been widely used in military and civilian applications. Due to different requirements in t...
Yuefei Hu, Wenzhong Li, Xiao Chen, Xin Chen, Sangl...
ADHOCNOW
2007
Springer
15 years 4 months ago
Topology Control and Geographic Routing in Realistic Wireless Networks
We present a distributed topology control protocol that runs on a d-QUDG for d ≥ 1/ √ 2, and computes a sparse, constant-spanner, both in Euclidean distance and in hop distance...
Kevin M. Lillis, Sriram V. Pemmaraju, Imran A. Pir...