13214 search results - page 120 / 2643 » Pseudorandomness for network algorithms |
199
click to vote
JNW
2008
15 years 6 months ago
2008
Position based routing algorithms use the knowledge of the position of nodes for routing of packets in mobile ad-hoc networks. Previously proposed position based routing algorithms...
143
click to vote
ALGORITHMICA
2000
15 years 6 months ago
2000
This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based ...
178
click to vote
HICSS
2008
IEEE
15 years 6 months ago
2008
IEEE
Given an edge-weighted tree T, a k-trunk is a subtree Tk with k leaves in T which minimizes the sum of the distances of all vertices in T from Tk plus the weight of Tk. In this pa...
220
click to vote
INFOCOM
2007
IEEE
16 years 22 days ago
2007
IEEE
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
180
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of data propagation in wireless sensor networks and revisit the family of mixed strategy routing schemes. We show that maximizing the lifespan, balancing th...