Sciweavers

909 search results - page 41 / 182
» On the approximability of some network design problems
Sort
View
MOBIHOC
2008
ACM
16 years 1 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
NETWORKING
2007
15 years 2 months ago
Optimal Topology Design for Overlay Networks
Abstract. The topology creation is one of the most important step for the design of an overlay network. Traffic characteristic and volume, and behavior of nodes which can be sel...
Mina Kamel, Caterina M. Scoglio, Todd Easton
SIAMJO
2010
136views more  SIAMJO 2010»
14 years 8 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López
ICNP
2006
IEEE
15 years 7 months ago
Benefit-based Data Caching in Ad Hoc Networks
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
Bin Tang, Himanshu Gupta, Samir R. Das
AAIM
2005
Springer
81views Algorithms» more  AAIM 2005»
15 years 3 months ago
Wavelength Assignment for Satisfying Maximal Number of Requests in All-Optical Networks
In this paper, we study how to, given a set of pre-routed requests in an all-optical network and a set of wavelengths available on each link, assign a subset of requests with maxim...
Xiao-Dong Hu, Tianping Shuai