Local Routing with Simultaneous Transmission Attempts to Several Adjacent Nodes

Abstract

This study introduces an efficient algorithm for local packet routing using twohop splitting of packet flows within a narrow (one hop away) routing corridor along a global end-to-end routing path. The main concept of the proposed algorithm is based on an attempt for simultaneous transmission of same packet from a local relaying node to two (or more) first neighbors within the routing corridor, which are connected to the global path to be followed by the packet flow. The transmission attempt is terminated as soon as the packet is successfully transmitted to one of the said first neighbors. Therefore, the fastest transmission at an instant of time allows one to speed up the local packet relaying.