We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient and distributed algorithm to determine the n dimensional unicast capacity region of such a wireless network. Equivalently, given a vector of end-to-end rates between various source-destination pairs, we seek to determine...

A majority of the countries of SEE are so-called ‘catching-up’ economies. 1 This basically means that their enterprises operate largely behind the technological frontier, by using the best available foreign technologies and by competing on the basis of production capability. However, catching up is not a process of mere imitation; it requires adaptation and innovation (Fagerberg and...

In this paper we study the problem of secure communication over networks in which an unknown subset of nodes or links can be wiretapped. We first consider a general multi-terminal discrete memoryless network (DMN) described by its channel transition function from network inputs to network outputs, observed by network nodes and the eavesdropper. We prove that in such general networks with multip...