TPDS
2010
13 years 11 months ago
2010
—We studied the minimum latency gossiping (all-to-all broadcast) problem in multihop radio networks defined as follows: Each node in the network is preloaded with a message and t...
RSA
2006
14 years 15 days ago
2006
Let n be a positive integer and > 0 a real number. Let Vn be a set of n points in the unit disk selected uniformly and independently at random. Define G(, n) to be the graph w...
CORR
2006
Springer
14 years 18 days ago
2006
Springer
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two pol...
COMCOM
2006
14 years 18 days ago
2006
Routing is the problem of sending a packet from a source node to a destination node in the network. Existing solutions for sensor networks assume a unit disk graph model, where me...
APPROX
2006
Springer
14 years 4 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...