Sciweavers

483 search results - page 88 / 97
» On extracting consistent graphs in wireless sensor networks
Sort
View
DCOSS
2009
Springer
15 years 4 months ago
Local Construction of Spanners in the 3-D Space
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...
Iyad A. Kanj, Ge Xia, Fenghui Zhang
PEWASUN
2004
ACM
15 years 5 months ago
A routing protocol for power constrained networks with asymmetric links
In many instances, an ad hoc network consists of nodes with different hardware and software capabilities as well as power limitations. This is the case of ad hoc grids where devi...
Guoqiang Wang, Yongchang Ji, Dan C. Marinescu, Dam...
DEBU
2010
180views more  DEBU 2010»
14 years 12 months ago
Searching RDF Graphs with SPARQL and Keywords
The proliferation of knowledge-sharing communities like Wikipedia and the advances in automated information extraction from Web pages enable the construction of large knowledge ba...
Shady Elbassuoni, Maya Ramanath, Ralf Schenkel, Ge...
98
Voted
COCOA
2009
Springer
15 years 4 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya
INFOCOM
2005
IEEE
15 years 5 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...