Sciweavers

84 search results - page 8 / 17
» Analysis of Topology Aggregation techniques for QoS routing
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Topological Data Processing for Distributed Sensor Networks with Morse-Smale Decomposition
Abstract—We are interested in topological analysis and processing of the large-scale distributed data generated by sensor networks. Naturally a large-scale sensor network is depl...
Xianjin Zhu, Rik Sarkar, Jie Gao
TISSEC
2008
235views more  TISSEC 2008»
13 years 7 months ago
SDAP: A Secure Hop-by-Hop Data Aggregation Protocol for Sensor Networks
Hop-by-hop data aggregation is a very important technique for reducing the communication overhead and energy expenditure of sensor nodes during the process of data collection in a...
Yi Yang, Xinran Wang, Sencun Zhu, Guohong Cao
CAL
2002
13 years 7 months ago
Worst-case Traffic for Oblivious Routing Functions
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
Brian Towles, William J. Dally
ICPP
2006
IEEE
14 years 2 months ago
Adaptively Routing P2P Queries Using Association Analysis
Unstructured peer-to-peer networks have become a very popular method for content distribution in the past few years. By not enforcing strict rules on the network’s topology or c...
Brian D. Connelly, Christopher W. Bowron, Li Xiao,...
LATIN
1998
Springer
14 years 4 days ago
Dynamic Packet Routing on Arrays with Bounded Buffers
We study the performance of packet routing on arrays (or meshes) with bounded buffers in the routing switches, assuming that new packets are continuously inserted at all the nodes....
Andrei Z. Broder, Alan M. Frieze, Eli Upfal