Sciweavers

592 search results - page 85 / 119
» Scalable ant-based routing algorithm for ad-hoc networks
Sort
View
IPSN
2007
Springer
14 years 2 months ago
Sparse data aggregation in sensor networks
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
ICDCSW
2008
IEEE
14 years 3 months ago
Heuristic Relay Node Selection Algorithm for One-Hop Overlay Routing
—This paper reviews the characteristics of overlay networks and defines effective relay nodes that can improve the performance of interactive real-time applications. A heuristic ...
Yin Chen, Li Tang, Jun Li
MOBIHOC
2004
ACM
14 years 8 months ago
Towards mobility as a network control primitive
In the near future, the advent of large-scale networks of mobile agents autonomously performing long-term sensing and communication tasks will be upon us. However, using controlle...
David Kiyoshi Goldenberg, Jie Lin, A. Stephen Mors...
ICC
2007
IEEE
121views Communications» more  ICC 2007»
14 years 3 months ago
Scalable Resilient Overlay Networks Using Destination-Guided Detouring
— Routing policies used in the Internet tend to be restrictive limiting communication between source-destination pairs to one route, when often better alternates exist. To avoid ...
Sameer Qazi, Tim Moors
EUC
2006
Springer
14 years 9 days ago
Scalable Message Routing for Mobile Software Assistants
In this paper we define an algorithm for location-independent communication of mobile software Personal Assistants (PAs). The algorithm extends the Query Server with Caching algor...
Pawel T. Wojciechowski