Sciweavers

6122 search results - page 1073 / 1225
» Securing network access in wireless sensor networks
Sort
View
92
Voted
CORR
2008
Springer
139views Education» more  CORR 2008»
14 years 10 months ago
The Secrecy Graph and Some of its Properties
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
Martin Haenggi
JPDC
2006
134views more  JPDC 2006»
14 years 10 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
ICRA
2002
IEEE
166views Robotics» more  ICRA 2002»
15 years 3 months ago
Real Time Visualization of Robot State with Mobile Virtual Reality
— With the deployment of large, distributed networks of cameras and other sensors, it is becoming necessary to also address the issue of how to effectively present the large vol...
Peter Amstutz, Andrew H. Fagg
EWSN
2007
Springer
15 years 9 months ago
Removing Systematic Error in Node Localisation Using Scalable Data Fusion
Methods for node localisation in sensor networks usually rely upon the measurement of received strength, time-of-arrival, and/or angle-of-arrival of an incoming signal. In this pap...
Albert Krohn, Mike Hazas, Michael Beigl
IPPS
2005
IEEE
15 years 3 months ago
Maximizing the Lifetime of Dominating Sets
We investigate the problem of maximizing the lifetime of wireless ad hoc and sensor networks. Being battery powered, nodes in such networks have to perform their intended task und...
Thomas Moscibroda, Roger Wattenhofer
« Prev « First page 1073 / 1225 Last » Next »