Sciweavers

298 search results - page 32 / 60
» Multicriteria Steiner Tree Problem for Communication Network
Sort
View
INFOCOM
1999
IEEE
15 years 4 months ago
Optimal Partition of QoS Requirements on Unicast Paths and Multicast Trees
We investigate the problem of optimal resource allocation for end-to-end QoS requirements on unicast paths and multicast trees. Specifically, we consider a framework in which reso...
Dean H. Lorenz, Ariel Orda
INFOCOM
2011
IEEE
14 years 3 months ago
Fully secure pairwise and triple key distribution in wireless sensor networks using combinatorial designs
—We address pairwise and (for the first time) triple key establishment problems in wireless sensor networks (WSN). We use combinatorial designs to establish pairwise keys betwee...
Sushmita Ruj, Amiya Nayak, Ivan Stojmenovic
ISCC
2006
IEEE
154views Communications» more  ISCC 2006»
15 years 5 months ago
Decentralized Load Balancing for Highly Irregular Search Problems
In this paper, we present a Dynamic Load Balancing (DLB) policy for problems characterized by a highly irregular search tree, whereby no reliable workload prediction is available....
Giuseppe Di Fatta, Michael R. Berthold
SECON
2008
IEEE
15 years 6 months ago
Enhancing the Data Collection Rate of Tree-Based Aggregation in Wireless Sensor Networks
— What is the fastest rate at which we can collect a stream of aggregated data from a set of wireless sensors organized as a tree? We explore a hierarchy of techniques using real...
Özlem Durmaz Incel, Bhaskar Krishnamachari
INFOCOM
2008
IEEE
15 years 6 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang