2473 search results - page 227 / 495 » The Logic of Communication Graphs |
173
click to vote
INFOCOM
2007
IEEE
16 years 29 days ago
2007
IEEE
—We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix w...
171
click to vote
INFOCOM
2007
IEEE
16 years 29 days ago
2007
IEEE
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
175
click to vote
WDAG
2007
Springer
16 years 23 days ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
188
click to vote
ISCC
2005
IEEE
16 years 7 days ago
2005
IEEE
The use of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-toPeer (P2P) Networks. In this paper, we study the performance of Yao-G...
170
click to vote
EUROPAR
2004
Springer
16 years 1 days ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...