Sciweavers

555 search results - page 76 / 111
» Irrigating ad hoc networks in constant time
Sort
View
SPW
2000
Springer
15 years 1 months ago
The Resurrecting Duckling - What Next?
In the context of the security of wireless ad hoc networks, we previously explored the problem of secure transient association between a master and a slave device in the absence of...
Frank Stajano
CORR
2008
Springer
101views Education» more  CORR 2008»
14 years 9 months ago
Cognitive networks achieve throughput scaling of a homogeneous network
We study two distinct, but overlapping, networks which operate at the same time, space and frequency. The first network consists of
Sang-Woon Jeon, Natasha Devroye, Mai Vu, Sae-Young...
103
Voted
GLOBECOM
2007
IEEE
14 years 9 months ago
Path Planning for Network Performance
— Path planning and network design are often treated by architects of mobile communication networks as separate problems. In fact, most mobile ad hoc network (MANET) designs do n...
Alex Fridman, Steven Weber, Charles Graff, Moshe K...
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
14 years 11 months ago
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa...
163
Voted
WASA
2010
Springer
288views Algorithms» more  WASA 2010»
14 years 8 months ago
Approaching the Optimal Schedule for Data Aggregation in Wireless Sensor Networks
Abstract. Due to the large-scale ad hoc deployments and wireless interference, data aggregation is a fundamental but time consuming task in wireless sensor networks. This paper foc...
Pei Wang, Yuan He, Liusheng Huang