Sciweavers

7133 search results - page 162 / 1427
» Communication algorithms with advice
Sort
View
ICC
2007
IEEE
137views Communications» more  ICC 2007»
15 years 9 months ago
An Improved Topology Design Algorithm for Network Coding-Based Multicast Networks
— Future communication networks should be designed with the consideration of efficiently supporting intensive multicast applications. Network coding technique proposed recently ...
Kaikai Chi, Xiaohong Jiang, Susumu Horiguchi
ICC
2007
IEEE
113views Communications» more  ICC 2007»
15 years 9 months ago
Load-Balanced Clustering Algorithms for Wireless Sensor Networks
— In this paper, we investigate the problem of grouping the sensor nodes into clusters to enhance the overall scalability of the network. A selected set of nodes, known as gatewa...
Chor Ping Low, Can Fang, Jim Mee Ng, Yew Hock Ang
INFOCOM
2012
IEEE
13 years 5 months ago
Constant-approximation for target coverage problem in wireless sensor networks
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
Ling Ding, Weili Wu, James Willson, Lidong Wu, Zai...
ISCC
2005
IEEE
130views Communications» more  ISCC 2005»
15 years 8 months ago
Fair and Efficient Frame-Based Scheduling Algorithm for Multimedia Networks
The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved Quality of Service (QoS) model...
T. Al-Khasib, Hussein M. Alnuweiri, Hossam Fattah,...
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 6 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte