Sciweavers

1580 search results - page 222 / 316
» Non-Interference Through Determinism
Sort
View
TON
2008
99views more  TON 2008»
13 years 10 months ago
On the computational complexity and effectiveness of N-hub shortest-path routing
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
Reuven Cohen, Gabi Nakibly
JSAC
2007
108views more  JSAC 2007»
13 years 10 months ago
Optimal relay functionality for SNR maximization in memoryless relay networks
We explore the SNR-optimal relay functionality in a memoryless relay network, i.e. a network where, during each channel use, the signal transmitted by a relay depends only on the ...
Krishna Srikanth Gomadam, Syed Ali Jafar
AIR
2004
130views more  AIR 2004»
13 years 10 months ago
A Hybrid Framework for Over-Constrained Generalized
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...
TWC
2008
127views more  TWC 2008»
13 years 10 months ago
Energy-Delay Analysis of MAC Protocols in Wireless Networks
In this paper the tradeoff between energy and delay for wireless networks is studied. A network using a request-to-send (RTS) and clear-to-send (CTS) type medium access control (M...
Shih Yu Chang, Wayne E. Stark, Achilleas Anastasop...
TWC
2008
125views more  TWC 2008»
13 years 10 months ago
Cooperative communications with relay-selection: when to cooperate and whom to cooperate with?
Abstract--In this paper, we propose a new cooperative communication protocol, which achieves higher bandwidth efficiency while guaranteeing the same diversity order as that of the ...
Ahmed S. Ibrahim, Ahmed K. Sadek, Weifeng Su, K. J...