Sciweavers

2654 search results - page 484 / 531
» On Pairing Inversion Problems
Sort
View
112
Voted
LCN
2006
IEEE
15 years 6 months ago
Protecting Multicast Sessions in Wireless Mesh Networks
To support reliable multicast routing in wireless mesh networks, it is important to protect multicast sessions against link or node failures. The issue of protecting multicast ses...
Xin Zhao, Chun Tung Chou, Jun Guo, Sanjay Jha
INFOCOM
2005
IEEE
15 years 6 months ago
Minimum energy accumulative routing in wireless networks
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...
Jiangzhuo Chen, Lujun Jia, Xin Liu, Guevara Noubir...
INFOCOM
2005
IEEE
15 years 6 months ago
Link scheduling in sensor networks: distributed edge coloring revisited
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...
Shashidhar Gandham, Milind Dawande, Ravi Prakash
98
Voted
PODC
2005
ACM
15 years 6 months ago
Quorum placement in networks to minimize access delays
A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of n...
Anupam Gupta, Bruce M. Maggs, Florian Oprea, Micha...
81
Voted
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
15 years 6 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar