Sciweavers

13214 search results - page 54 / 2643
» Pseudorandomness for network algorithms
Sort
View
ICN
2005
Springer
15 years 11 months ago
Two Energy-Efficient Routing Algorithms for Wireless Sensor Networks
: Power Conservation is one of the most important challenges in wireless sensor networks. In this paper, we present two minimum-energy routing algorithms. Our main goal is to reduc...
Hung Le Xuan, Youngku Lee, Sungyoung Lee
ANTSW
2006
Springer
15 years 10 months ago
An Energy-Efficient Ant-Based Routing Algorithm for Wireless Sensor Networks
Abstract. Wireless Sensor Networks are characterized by having specific requirements such as limited energy availability, low memory and reduced processing power. On the other hand...
Tiago Camilo, Carlos Carreto, Jorge Sá Silv...
IMC
2005
ACM
15 years 11 months ago
Exploiting Underlying Structure for Detailed Reconstruction of an Internet-scale Event
Network “telescopes” that record packets sent to unused blocks of Internet address space have emerged as an important tool for observing Internet-scale events such as the spre...
Abhishek Kumar, Vern Paxson, Nicholas Weaver
IPPS
2006
IEEE
16 years 5 days ago
A combined genetic-neural algorithm for mobility management
This work presents a new approach to solve the location management problem by using the location areas approach. A combination of a genetic algorithm and the Hopfield neural netwo...
Javid Taheri, Albert Y. Zomaya
NETWORKING
2000
15 years 7 months ago
Sensitivity of ABR Congestion Control Algorithms to Hurst Parameter Estimates
Optimal linear predictors can be utilised in ABR control algorithms for the management of self-similar network traffic. However, estimates of the Hurst parameter are required to ge...
Sven A. M. Östring, Harsha Sirisena, Irene Hu...