Sciweavers

364 search results - page 66 / 73
» Shortest-path network interdiction
Sort
View
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
14 years 3 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
INFOCOM
2007
IEEE
14 years 2 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
INFOCOM
2005
IEEE
14 years 2 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...
PODC
1997
ACM
14 years 24 days ago
Dynamic Wavelength Allocation in Optical Networks
This paper proposes algorithms for allocation of wavelengths to connections (lightpaths) in optical wavelength division multiplexed networks, predominantly for ring topologies. Th...
Ornan Ori Gerstel, Galen H. Sasaki, Shay Kutten, R...
COMCOM
2008
153views more  COMCOM 2008»
13 years 8 months ago
Available bandwidth estimation and admission control for QoS routing in wireless mesh networks
This article presents an integrated admission control and routing mechanism for multi-rate wireless mesh networks. Admission control depends on precise estimates of available band...
Mesut Ali Ergin, Marco Gruteser, Lin Luo, Dipankar...