103 search results - page 16 / 21 » Oblivious routing on geometric networks |
106
click to vote
CCCG
2010
15 years 1 months ago
2010
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
108
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
DIALM
2004
ACM
15 years 5 months ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
SODA
2004
ACM
15 years 1 months ago
2004
ACM
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
TSP
2008
14 years 11 months ago
2008
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...