2076 search results - page 337 / 416 » Universal Routing in Distributed Networks |
INFOCOM
2009
IEEE
14 years 4 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
ANCS
2005
ACM
14 years 3 months ago
2005
ACM
Large-scale applications require the efficient exchange of data across their distributed components, including data from heterogeneous sources and to widely varying clients. Inher...
MOBICOM
2003
ACM
14 years 3 months ago
2003
ACM
One of the most important methods for evaluating the characteristics of ad hoc networking protocols is through the use of simulation. Simulation provides researchers with a number...
MOBIHOC
2002
ACM
14 years 9 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
ICDCS
2010
IEEE
14 years 1 months ago
2010
IEEE
—This research focuses on distributed and localized algorithms for precise boundary detection in 3D wireless networks. Our objectives are in two folds. First, we aim to identify ...