Sciweavers

925 search results - page 83 / 185
» Connectivity on Complete Lattices
Sort
View
MOBIHOC
2002
ACM
16 years 5 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
DSN
2005
IEEE
15 years 11 months ago
A System Demonstration of ST-TCP
ST-TCP (Server fault-Tolerant TCP) is an extension of TCP to tolerate TCP server failures. Server fault tolerance is provided by using an active-backup server that keeps track of ...
Manish Marwah, Shivakant Mishra, Christof Fetzer
IPSN
2004
Springer
15 years 11 months ago
Naps: scalable, robust topology management in wireless ad hoc networks
Topology management schemes conserve energy in wireless ad hoc networks by identifying redundant nodes that may turn off their radios or other components while maintaining connec...
Brighten Godfrey, David Ratajczak
MOBIHOC
2003
ACM
15 years 11 months ago
Improving fairness among TCP flows crossing wireless ad hoc and wired networks
In scenarios where wireless ad hoc networks are deployed, sometimes it would be desirable that ad hoc nodes can communicate with servers in wired networks to upload or download da...
Luqing Yang, Winston Khoon Guan Seah, Qinghe Yin
SAC
1998
ACM
15 years 10 months ago
Enhancing navigation in the World Wide Web
The great potential of the World Wide Web is given by its capability of accessing information by navigating via hyper links from one site to another. However, this great potential...
Massimo Marchiori