Sciweavers

658 search results - page 58 / 132
» Lower bounds for sorting networks
Sort
View
SODA
2004
ACM
91views Algorithms» more  SODA 2004»
13 years 9 months ago
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
Carlos Brito, Elias Koutsoupias, Shailesh Vaya
TMC
2008
83views more  TMC 2008»
13 years 7 months ago
A Swarm-Intelligence-Based Protocol for Data Acquisition in Networks with Mobile Sinks
This paper addresses the problem of data acquisition in ad hoc and sensor networks with mobile sinks and proposes a protocol based on swarm intelligence, SIMPLE, to route data in s...
Hua Yang, Fengji Ye, Biplab Sikdar
ICCAD
2003
IEEE
210views Hardware» more  ICCAD 2003»
14 years 4 months ago
Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard Real-Time Systems
Energy consumption is an important performance parameter for portable and wireless embedded systems. However, energy consumption must be carefully balanced with real-time responsi...
Vishnu Swaminathan, Krishnendu Chakrabarty
INFOCOM
2008
IEEE
14 years 2 months ago
Link State Routing Overhead in Mobile Ad Hoc Networks: A Rate-Distortion Formulation
Abstract— In this paper we use an information-theoretic formulation for characterizing the minimum routing overhead of link state routing in a mobile ad hoc network. We formulate...
Di Wang, Alhussein A. Abouzeid
IPPS
2007
IEEE
14 years 2 months ago
A Combinatorial Analysis of Distance Reliability in Star Network
This paper addresses a constrained two-terminal reliability measure referred to as Distance Reliability (DR) between the source node u and the destination node I with the shortest...
Xiaolong Wu, Shahram Latifi, Yingtao Jiang