Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...
Mobile Ad-hoc NETworks (MANETs) are known to be vulnerable to a variety of attacks due to lack of central authority or fixed network infrastructure. Many security schemes have bee...
—We consider the problem of determining the “closest”, or best Internet host to connect to, from a list of candidate servers. Most existing approaches rely on the use of metr...
—It has recently been proposed to orthogonalize the data streams of n interfering source-destination pairs by employing an intermediate stage of non-cooperating coherent amplify-...
—We present an interdomain routing protocol for heterogeneous networks employing different queuing service disciplines. Our routing protocol finds optimal interdomain paths with ...