Sciweavers

824 search results - page 14 / 165
» Robust Distributed Routing in Dynamical Flow Networks
Sort
View
ISCC
2000
IEEE
151views Communications» more  ISCC 2000»
15 years 2 months ago
Connection-Oriented Routing in Ad Hoc Networks Based on Dynamic Group Infrastructure
An ad hoc network is formed by a group of mobile hosts communicating over wireless channels. Such a network operates without any fixed network interaction and centralized administ...
Yu-Liang Chang, Ching-Chi Hsu
SENSYS
2004
ACM
15 years 3 months ago
Synopsis diffusion for robust aggregation in sensor networks
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
Suman Nath, Phillip B. Gibbons, Srinivasan Seshan,...
TWC
2008
80views more  TWC 2008»
14 years 9 months ago
Robust connectivity-aware energy-efficient routing for wireless sensor networks
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...
Charles Pandana, K. J. Ray Liu
PODC
2003
ACM
15 years 3 months ago
Routing networks for distributed hash tables
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
Gurmeet Singh Manku
COMCOM
2004
153views more  COMCOM 2004»
14 years 9 months ago
BLR: beacon-less routing algorithm for mobile ad hoc networks
Routing of packets in mobile ad hoc networks with a large number of nodes or with high mobility is a very difficult task and current routing protocols do not really scale well wit...
Marc Heissenbüttel, Torsten Braun, Thomas Ber...