Sciweavers

995 search results - page 132 / 199
» Minimizing Congestion in General Networks
Sort
View
INFOCOM
2005
IEEE
14 years 1 months ago
Packetostatics: deployment of massively dense sensor networks as an electrostatics problem
— We investigate the spatial distribution of wireless nodes that can transport a given volume of traffic in a sensor network, while requiring the minimum number of wireless node...
Stavros Toumpis, Leandros Tassiulas
SPAA
2006
ACM
14 years 1 months ago
Network design with weighted players
We consider a model of game-theoretic network design initially studied by Anshelevich et al. [2], where selfish players select paths in a network to minimize their cost, which is...
Ho-Lin Chen, Tim Roughgarden
INFOCOM
2003
IEEE
14 years 1 months ago
Optimal Sliding-Window Strategies in Networks with Long Round-Trip Delays
— A method commonly used for packet flow control over connections with long round-trip delays is “sliding windows”. In general, for a given loss rate, a larger window size a...
Lavy Libman, Ariel Orda
EUC
2006
Springer
13 years 11 months ago
Cross-Layer Duty Cycle Scheduling with Data Aggregation Routing in Wireless Sensor Networks
Abstract. Well-scheduled communications, in conjunction with the aggregation of data reduce the energy waste on idle listening and redundant transmissions. In addition, the adjusta...
Yean-Fu Wen, Frank Yeong-Sung Lin
TECS
2002
81views more  TECS 2002»
13 years 7 months ago
System-level exploration of association table implementations in telecom network applications
les to further raise the abstraction level of the initial specification, where dynamic data sets can be specified without low-level details. Our method is suited for hardware and s...
Chantal Ykman-Couvreur, J. Lambrecht, A. Van Der T...