Sciweavers

570 search results - page 15 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
INFOCOM
2009
IEEE
14 years 3 months ago
Virtual Network Embedding with Coordinated Node and Link Mapping
—Recently network virtualization has been proposed as a promising way to overcome the current ossification of the Internet by allowing multiple heterogeneous virtual networks (V...
N. M. Mosharaf Kabir Chowdhury, Muntasir Raihan Ra...
EMNETS
2007
14 years 22 days ago
Robust node localization for wireless sensor networks
The node localization problem in Wireless Sensor Networks has received considerable attention, driven by the need to obtain a higher location accuracy without incurring a large, p...
Radu Stoleru, John A. Stankovic, Sang Hyuk Son
ISCC
2005
IEEE
14 years 2 months ago
Optimal Delay-Constrained Minimum Cost Loop Algorithm for Local Computer Network
This study deals with the Delay-Constrained Minimum Cost Loop Problem (DC-MCLP) of finding several loops from a source node. The DC-MCLP consists of finding a set of minimum cost ...
Yong-Jin Lee, Mohammed Atiquzzaman
INFOCOM
2007
IEEE
14 years 3 months ago
The Power Balancing Problem in Energy Constrained Multi-Hop Wireless Networks
— Power efficient operation is very critical in energy constrained multi-hop wireless networks. One important technique is to intelligently assign transmission powers to nodes w...
Randeep Bhatia, Abhishek Kashyap, Erran L. Li
DISOPT
2008
107views more  DISOPT 2008»
13 years 8 months ago
The k-path tree matroid and its applications to survivable network design
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
Esther M. Arkin, Refael Hassin