483 search results - page 79 / 97 » On extracting consistent graphs in wireless sensor networks |
104
click to vote
MOBIHOC
2008
ACM
15 years 11 months ago
2008
ACM
We study the multicast capacity of a random wireless network consisting of ordinary wireless nodes and base stations, known as a hybrid network. Assume that n ordinary wireless no...
MOBIHOC
2007
ACM
15 years 11 months ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
ICDCSW
2009
IEEE
15 years 6 months ago
2009
IEEE
Designing cyber-physical systems with high efficiency, adaptability, autonomy, reliability and usability is a challenging task. In this paper, we focus on minimizing networkwide ...
DIALM
2005
ACM
15 years 1 months ago
2005
ACM
Geographic face routing algorithms have been widely studied in the literature [1, 8, 13]. All face routing algorithms rely on two primitives: planarization and face traversal. The...
111
click to vote
SASO
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...