Sciweavers

135 search results - page 13 / 27
» Hierarchical source routing using implied costs
Sort
View
MSWIM
2005
ACM
14 years 1 months ago
Randomized energy aware routing algorithms in mobile ad hoc networks
We consider the problem of energy aware localized routing in ad hoc networks. In localized routing algorithms, each node forwards a message based on the position information about...
Israat Tanzeena Haque, Chadi Assi, J. William Atwo...
SASN
2006
ACM
14 years 1 months ago
Attack-resilient hierarchical data aggregation in sensor networks
In a large sensor network, in-network data aggregation, i.e., combining partial results at intermediate nodes during message routing, significantly reduces the amount of communic...
Sankardas Roy, Sanjeev Setia, Sushil Jajodia
CN
2004
98views more  CN 2004»
13 years 7 months ago
On selection of candidate paths for proportional routing
QoS routing involves selection of paths for flows based on the knowledge at network nodes about the availability of resources along paths, and the QoS requirements of flows. Sever...
Srihari Nelakuditi, Zhi-Li Zhang, David Hung-Chang...
IPSN
2007
Springer
14 years 1 months ago
Hierarchical spatial gossip for multi-resolution representations in sensor networks
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
Rik Sarkar, Xianjin Zhu, Jie Gao
ICML
1999
IEEE
13 years 12 months ago
Learning Hierarchical Performance Knowledge by Observation
Developing automated agents that intelligently perform complex real world tasks is time consuming and expensive. The most expensive part of developing these intelligent task perfo...
Michael van Lent, John E. Laird