1020 search results - page 18 / 204 » Efficiency of Search Methods in Dynamic Wireless Networks |
ICSAP
2010
13 years 11 months ago
2010
— When sensors are redundantly deployed, a subset of sensors should be selected to actively monitor the field (referred to as a "cover"), while the rest of the sensors ...
PERVASIVE
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. This paper describesa method for establishing ad hoc and infrastructuremode wireless network connections based on physical proximity. Users can easily establish secure wi...
JUCS
2006
13 years 7 months ago
2006
Abstract: Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remain. However if th...
ETFA
2008
IEEE
13 years 9 months ago
2008
IEEE
The deployment of a wireless control system must cope with a number of effects usually negligible in a wired scenario. To this aim, an experimental analysis on suitable prototypes...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...