Sciweavers

1391 search results - page 145 / 279
» Distributed routing in networks using affinity propagation
Sort
View
CORR
2010
Springer
185views Education» more  CORR 2010»
15 years 6 months ago
Acdmcp: An adaptive and completely distributed multi-hop clustering protocol for wireless sensor networks
Clustering is a very popular network structuring technique which mainly addresses the issue of scalability in large scale Wireless Sensor Networks. Additionally, it has been shown...
Khalid Nawaz, Alejandro P. Buchmann
ICCAD
1993
IEEE
123views Hardware» more  ICCAD 1993»
15 years 10 months ago
Optimal sizing of high-speed clock networks based on distributed RC and lossy transmission line models
We have proposed an e cient measure to reduce the clock skew by assigning the clock network with variable branch widths. This measure has long been used for \H" clock tree. T...
Qing Zhu, Wayne Wei-Ming Dai, Joe G. Xi
MOBICOM
2010
ACM
15 years 6 months ago
Differential forms for target tracking and aggregate queries in distributed networks
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
Rik Sarkar, Jie Gao
SPAA
1996
ACM
15 years 10 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
ICPP
1998
IEEE
15 years 10 months ago
Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
Dong Xuan, Weijia Jia, Wei Zhao