Sciweavers

761 search results - page 140 / 153
» Exploiting heterogeneity in sensor networks
Sort
View
77
Voted
PERCOM
2005
ACM
15 years 9 months ago
When Does Opportunistic Routing Make Sense?
Different opportunistic routing protocols have been proposed recently for routing in sensor networks. These protocols exploit the redundancy among nodes by using a node that is av...
Adam Wolisz, Jan M. Rabaey, Rahul C. Shah, Sven Wi...
GI
2004
Springer
15 years 2 months ago
A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
Markus Volkmer, Sebastian Wallner
CN
2008
163views more  CN 2008»
14 years 9 months ago
Loss-resilient window-based congestion control
This paper addresses the problem of fair allocation of bandwidth resources on lossy channels in hybrid heterogeneous networks. It discusses more particularly the ability of window...
Christophe De Vleeschouwer, Pascal Frossard
COMCOM
2007
82views more  COMCOM 2007»
14 years 9 months ago
On application-level load balancing in FastReplica
— In the paper, we consider the problem of distributing large-size content to a fixed set of nodes. In contrast with the most existing end-system solutions to this problem, Fast...
Jangwon Lee, Gustavo de Veciana
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
14 years 7 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu