Sciweavers

13214 search results - page 172 / 2643
» Pseudorandomness for network algorithms
Sort
View
QSHINE
2005
IEEE
16 years 3 days ago
TCP fairness measures for scheduling algorithms in wireless networks
This paper presents two new layer 4 fairness measures, the worst case TCP fairness index and the TCP fairness index. The purpose of the two indices is to measure the performance o...
Krister Norlund, Tony Ottosson, Anna Brunstrom
PPSN
2004
Springer
15 years 12 months ago
AntHocNet: An Ant-Based Hybrid Routing Algorithm for Mobile Ad Hoc Networks
In this paper we present AntHocNet, a new algorithm for routing in mobile ad hoc networks. Due to the ever changing topology and limited bandwidth it is very hard to establish and ...
Gianni Di Caro, Frederick Ducatelle, Luca Maria Ga...
JHSN
2000
172views more  JHSN 2000»
15 years 6 months ago
Dynamic token bucket (DTB): a fair bandwidth allocation algorithm for high-speed networks
Fair allocation of available bandwidth to competing flows is a simple form of quality of service (QoS) that can be provided to customers in packet-switched networks. A number of p...
Jayakrishna Kidambi, Dipak Ghosal, Biswanath Mukhe...
INFOCOM
2010
IEEE
15 years 5 months ago
A General Algorithm for Interference Alignment and Cancellation in Wireless Networks
—Physical layer techniques have come a long way and can achieve close to Shannon capacity for single pointto-point transmissions. It is apparent that, to further improve network ...
Erran L. Li, Richard Alimi, Dawei Shen, Harish Vis...
WINET
2010
128views more  WINET 2010»
15 years 4 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...