Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
— Future communication networks should be designed with the consideration of efficiently supporting intensive multicast applications. Network coding technique proposed recently ...
Abstract. The literature on cross-layer protocols, protocol improvements, and design methodologies for wireless sensor networks (WSNs) is reviewed and a taxonomy is proposed. The c...