Sciweavers

1578 search results - page 94 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
STACS
2001
Springer
14 years 1 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
PIMRC
2008
IEEE
14 years 3 months ago
Radio resource allocation in OFDMA multihop cellular cooperative networks
Multihop cellular networks (MeNs) is an extension of single hop cellular networks (SCNs) having benefits of a fixed base station and flexible ad hoc networks. The radio resource ma...
Cheol Jeong, Hyung-Myung Kim
BROADNETS
2007
IEEE
14 years 3 months ago
IP fast rerouting for single-link/node failure recovery
—Failure recovery in IP networks is critical to high quality service provisioning. The main challenge is how to achieve fast recovery without introducing high complexity and reso...
Kang Xi, H. Jonathan Chao
AICCSA
2005
IEEE
124views Hardware» more  AICCSA 2005»
14 years 2 months ago
On multicast scheduling and routing in multistage Clos networks
Multicast communication, which involves transmitting information from one node to multiple nodes, is a vital operation in both broadband integrated services digital networks (BISD...
Bin Tang
INFOCOM
2011
IEEE
13 years 7 days ago
Finite-horizon energy allocation and routing scheme in rechargeable sensor networks
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
Shengbo Chen, Prasun Sinha, Ness B. Shroff, Changh...