In this paper, we propose a novel Geographic Multicast routing Protocol (GMP) for wireless sensor networks1 . The proposed protocol is fully distributed and stateless. Given a set...
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
The network topology changes frequently in ad-hoc networks. Some on-demand protocols with multi-paths or backup routes have been proposed to improve the performance in ad-hoc netw...
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
In traditional unstructured P2P file sharing network, each peer establishes connections with a certain number of randomly chosen other peers. This would lead to redundant traffic ...