—Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the netwo...
—We motivate the problem of designing a subset of the edge weights in a graph, to shape the spectrum of an associated linear time-invariant dynamics. We address a canonical desig...
In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messa...
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii U...
In this paper the authors present a simulation study of two 802.11e network scenarios. The presented analysis is not only novel but most of all crucial for understanding how a theo...