Sciweavers

13214 search results - page 147 / 2643
» Pseudorandomness for network algorithms
Sort
View
INFOCOM
2008
IEEE
16 years 27 days ago
A Distributed Minimum-Distortion Routing Algorithm with In-Network Data Processing
—In many wired and wireless networks, nodes process input traffic to satisfy a network constraint (e.g. capacity constraints) and to increase the utility of data in the output ...
Ramin Khalili, James F. Kurose
ADHOCNOW
2008
Springer
16 years 25 days ago
DIN: An Ad-Hoc Algorithm to Estimate Distances in Wireless Sensor Networks
Abstract. A current challenge in wireless sensor networks is the positioning of sensor nodes for indoor environments without dedicated hardware. Especially in this domain, many app...
Freddy López Villafuerte, Jochen H. Schille...
IWINAC
2007
Springer
16 years 19 days ago
EDNA: Estimation of Dependency Networks Algorithm
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...
José A. Gámez, Juan L. Mateo, Jose M...
GLOBECOM
2006
IEEE
16 years 16 days ago
A Location-Based Vertical Handoff Decision Algorithm for Heterogeneous Mobile Networks
— Next-generation mobile communication systems will provide “always best connected” services to mobile users via cellular networks that provide wide area coverage for global ...
Jie Zhang, Henry C. B. Chan, Victor C. M. Leung
DCOSS
2005
Springer
16 years 14 hour ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das