277 search results - page 53 / 56 » The saga of minimum spanning trees |
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—Although network-wide flooding in reactive routing protocols like AODV [1] facilitates the discovery of optimal routes, they engender large control overhead. Some efficient floo...
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
ISPA
2007
Springer
14 years 1 months ago
2007
Springer
In wireless mesh network, by equipped mesh router with multiple radios tuned into orthogonal channels, throughput improvement problem can be alleviated. Efficient channel assignmen...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...