The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
—As the Internet steadily increases in importance, it is still based on a quite fragile routing design. From network operators perspective it is therefore crucial to detect end-t...
In this paper, we consider energy-efficient routing for detection in wireless sensor networks (WSNs). Energyefficient routing for WSNs has been intensely studied recently, but rout...
A routing protocol is designed considering a particular environment all the time which is not possible in the case of practical ad hoc networks. Because of the uncertainty in topol...
In this paper, we propose an end-to-end route optimization scheme for nested mobile networks, which we refer to as Recursive Binding Update plus (RBU+). A nested mobile network is ...