Sciweavers

7 search results - page 1 / 2
» dialm 2008
Sort
View
DIALM
2008
ACM
96views Algorithms» more  DIALM 2008»
14 years 11 months ago
Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs
Stephane Durocher, Krishnam Raju Jampani, Anna Lub...
DIALM
2008
ACM
139views Algorithms» more  DIALM 2008»
14 years 11 months ago
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
Zeev Nutov
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
14 years 11 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
14 years 11 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
DIALM
2008
ACM
168views Algorithms» more  DIALM 2008»
14 years 11 months ago
Local broadcasting in the physical interference model
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
Olga Goussevskaia, Thomas Moscibroda, Roger Watten...