Sciweavers

13214 search results - page 154 / 2643
» Pseudorandomness for network algorithms
Sort
View
ICDCS
2008
IEEE
16 years 28 days ago
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...
Peng-Jun Wan, Lixin Wang, F. Frances Yao
INFOCOM
2007
IEEE
16 years 24 days ago
Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms
— Two fundamental functions of the sensor nodes in a wireless sensor network are to sense its environment and to transmit sensed information to a basestation. One approach to pro...
Weiyi Zhang, Guoliang Xue, Satyajayant Misra
VTC
2006
IEEE
159views Communications» more  VTC 2006»
16 years 15 days ago
Comparison between Vertical Handoff Decision Algorithms for Heterogeneous Wireless Networks
— The next generation wireless networks will support the vertical handoff mechanism in which users can maintain the connections when they switch from one network to another (e.g....
Enrique Stevens-Navarro, Vincent W. S. Wong
ICPP
2005
IEEE
16 years 2 days ago
Locality-Aware Randomized Load Balancing Algorithms for DHT Networks
Structured P2P overlay networks based on a consistent hashing function have an aftermath load balance problem that needs to be dealt with. A load balancing method should take into...
Haiying Shen, Cheng-Zhong Xu
INFOCOM
2005
IEEE
16 years 2 days ago
On failure detection algorithms in overlay networks
— One of the key reasons overlay networks are seen as an excellent platform for large scale distributed systems is their resilience in the presence of node failures. This resilie...
Shelley Zhuang, Dennis Geels, Ion Stoica, Randy H....