The objective of this paper is to study how important it is to take uncertainty into account in a service network design problem during the planning phase. We look at how a solution based on uncertain demand differs from a solution based on deterministic demand and show that there can be important structural differences between them. Some of these structural differences help hedge against uncer...

We consider the Degree-Bounded Survivable Network Design Problem: the objective is to find a minimum cost subgraph satisfying the given connectivity requirements as well as the degree bounds on the vertices. If we denote the upper bound on the degree of a vertex v by b(v), then we present an algorithm that finds a solution whose cost is at most twice the cost of the optimal solution while the d...

Optimal planning of cellular networks is one of the most fundamental problems in network design. This paper discusses cell planning problems for the fourth generation (4G) cellular networks. We describe important planning aspects derived by the anticipated 4G technologies and model several relevant cell planning problems. We then review several algorithmic techniques for solving these problems.

The objective of this paper is to emphasize a clear and natural distinction in strategies of sensor network design. In order to display different architectural paradigms in today’s wireless sensor networking, the classification of sensor networks as intensive and extensive ones is introduced and explained. Main paradigms representative for both technologies are compared. As follows from the dis...

We present several classes of facet-deening inequalities to strengthen polyhedra arising as subsystems of network design problems with survivability constraints. These problems typically involve assigning capacities to a network with multicommodity demands, such that after a vertex-or edge-deletion at least some prescribed fraction of each demand can be routed.

We consider the Tree Augmentation problem: given a graph G = (V,E) with edge-costs and a tree T on V disjoint to E, find a minimum-cost edge-subset F ⊆ E such that T ∪ F is 2-edge-connected. Tree Augmentation is equivalent to the problem of finding a minimumcost edge-cover F ⊆ E of a laminar set-family. The best known approximation ratio for Tree Augmentation is 2, even for trees of radius 2. A...

This paper summarises the cell design issues for microcellular networks and explains how conventional large cell network design techniques may not be suitable for designing a ubiquitous microcellular network. A general interference model developed for arbitrary microcellular networks, using a parameter denoted the ‘interference to noise ratio’ or INR, is used to determine the microcell spacing ...

This paper investigates the channel allocation problem in multi-channel wireless networks with directional antennas. In particular, we propose a general analytical framework on the number of channels, in which we consider a new directional antenna model. This antenna model is more general than existing antenna models since other existing antenna models can be regarded as a special case of our m...