Sciweavers

1330 search results - page 212 / 266
» Node Connectivity Analysis in Multi-Hop Wireless Networks
Sort
View
ICUMT
2009
15 years 4 months ago
SBCL - improved centroid estimation
Localization of sensor nodes is one of the key issues in Wireless Sensor Networks. It is a precondition for a variety of applications, as well as geographic clustering and routing....
Ralf Behnke, Jakob Salzmann, Dirk Timmermann
NETWORK
2006
218views more  NETWORK 2006»
15 years 6 months ago
Quality of service for packet telephony over mobile ad hoc networks
IP telephony over mobile ad hoc networks is a topic of emerging interest in the research arena as one of the paths toward the fixed-mobile convergence in telecommunications networ...
Paolo Giacomazzi, Luigi Musumeci, Giuseppe Caizzon...
TRIDENTCOM
2005
IEEE
16 years 6 days ago
Wireless Link SNR Mapping Onto An Indoor Testbed
To facilitate a broad range of experimental research on novel protocols and application concepts, we employ an indoor wireless testbed to emulate the performance of the real-world...
Jing Lei, Roy D. Yates, Larry J. Greenstein, Hang ...
IPSN
2007
Springer
16 years 23 days ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
15 years 8 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin