Sciweavers

1424 search results - page 181 / 285
» On the efficiency of fluid simulation of networks
Sort
View
CIIT
2004
111views Communications» more  CIIT 2004»
15 years 7 months ago
Scalable ant-based routing algorithm for ad-hoc networks
Ants-based routing algorithms have attracted the attention of researchers because they are more robust, reliable, and scalable than other conventional routing algorithms. Since th...
Yoshitaka Ohtaki, Naoki Wakamiya, Masayuki Murata,...
ADHOC
2008
101views more  ADHOC 2008»
15 years 6 months ago
Monte Carlo localization for mobile wireless sensor networks
Localization is crucial to many applications in wireless sensor networks. In this article, we propose a range-free anchorbased localization algorithm for mobile wireless sensor ne...
Aline Baggio, Koen Langendoen

Publication
203views
15 years 6 months ago
Multigraph Sampling of Online Social Networks
State-of-the-art techniques for probability sampling of users of online social networks (OSNs) are based on random walks on a single social relation. While powerful, these methods ...
Minas Gjoka, Carter T. Butts, Maciej Kurant, Athin...
WICOMM
2008
122views more  WICOMM 2008»
15 years 6 months ago
Energy and connectivity performance of routing groups in multi-radio multi-hop networks
This paper explores the logical device aggregation of terminals in future generation networks, where the availability of several different radio access techniques is integrated by...
Michele Rossi, Leonardo Badia, Paolo Giacon, Miche...
MOBIHOC
2001
ACM
16 years 6 months ago
Geometric spanner for routing in mobile networks
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...