Sciweavers

50 search results - page 6 / 10
» An Algorithm for Node-Capacitated Ring Routing
Sort
View
GLOBECOM
2007
IEEE
14 years 3 months ago
Two Energy-Saving Schemes for Cooperative Transmission with Opportunistic Large Arrays
— An opportunistic large array (OLA) is a form of cooperative diversity in which a large group of simple, inexpensive relays or forwarding nodes operate without any mutual coordi...
Lakshmi V. Thanayankizil, Aravind Kailas, Mary Ann...
ISCC
2002
IEEE
14 years 1 months ago
Survivable routing in WDM networks
—In this paper we consider the problem of routing the lightpaths of a logical topology of a WDM network on an arbitrary physical topology, such that the logical topology remains ...
Arunabha Sen, Bin Hao, Bao Hong Shen
TSP
2008
100views more  TSP 2008»
13 years 8 months ago
Geographic Gossip: Efficient Averaging for Sensor Networks
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
PODC
2005
ACM
14 years 2 months ago
Distance estimation and object location via rings of neighbors
We consider four problems on distance estimation and object location which share the common flavor of capturing global information via informative node labels: low-stretch routin...
Aleksandrs Slivkins
COMSWARE
2007
IEEE
14 years 3 months ago
Survivable Routing in WDM Weighted Networks
: In this paper, we investigate the problem of routing lightpaths on an arbitrary physical topology following a Design Protection approach, such that virtual topology remains conne...
Debasis Mandal, Satyajit Nath, Bivas Mitra