Sciweavers

13214 search results - page 388 / 2643
» Pseudorandomness for network algorithms
Sort
View
COCOON
2004
Springer
16 years 7 days ago
An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
Yong Zhang, Hong Zhu
IAT
2010
IEEE
15 years 4 months ago
DLB-SDPOP: A Multiagent Pseudo-tree Repair Algorithm for Load Balancing in WLANs
The traffic load of wireless local area networks (WLANs) is often distributed unevenly among access points. In addition, interference from collocated wireless devices operating in...
Shanjun Cheng, Anita Raja, Jiang Xie, Ivan Howitt
JCIT
2010
126views more  JCIT 2010»
15 years 1 months ago
An Improved DV-Hop Localization Algorithm based on The Selection of Beacon Nodes
In the trilateration of wireless sensor networks, to overcome the affection of localization error caused by the selection of beacon nodes, a selective strategy of beacon nodes bas...
Wen-yuan Liu, En-shuang Wang, Zi-jun Chen, Lin Wan...
INFOCOM
1999
IEEE
15 years 11 months ago
Supporting Dynamic Inter-Class Resource Sharing: A Multi-Class QoS Routing Algorithm
In an integrated services network, resources are shared by multiple traffic classes. Service classes that deliver guaranteed Quality-ofService (QoS) to applications have priority ...
Qingming Ma, Peter Steenkiste
IWCMC
2006
ACM
16 years 24 days ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras