Sciweavers

107 search results - page 11 / 22
» On The Shuffle-Exchange Permutation Network
Sort
View
SAC
2004
ACM
14 years 27 days ago
A comparison of randomized and evolutionary approaches for optimizing base station site selection
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
Larry Raisanen, Roger M. Whitaker, Steve Hurley
TISSEC
2010
72views more  TISSEC 2010»
13 years 5 months ago
Deterring voluntary trace disclosure in re-encryption mix-networks
An all too real threat to the privacy offered by a mix network is that individual mix administrators may volunteer partial tracing information to a coercer. While this threat can ...
XiaoFeng Wang, Philippe Golle, Markus Jakobsson, A...
ACSC
2006
IEEE
14 years 1 months ago
Throughput fairness in k-ary n-cube networks
The performance of an interconnection network is measured by two metrics: average latency and peak network throughput. Network throughput is the total number of packets delivered ...
Cruz Izu
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
13 years 11 months ago
Routing permutations on graphs via matchings
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Noga Alon, Fan R. K. Chung, Ronald L. Graham
MOBICOM
2010
ACM
13 years 7 months ago
Retransmission != repeat: simple retransmission permutation can resolve overlapping channel collisions
Collisions in overlapping channels are becoming an increasingly important problem in the deployment of high-speed wireless networks. In this paper, we present Remap, a simple, nov...
Erran L. Li, Kun Tan, Harish Viswanathan, Ying Xu,...