A large variety of permutation routing protocols in a single-hop Network are known to day. Since they are single hop, there is always a wireless path connecting two nodes. One way to solve this problem in a multiple hop environment is to partition nodes into clusters, where a node in each cluster called clusterhead is responsible for the routing service. In this paper, we propose a clustering mechanism to perform permutation routing in multi-hop ad hoc Networks having p stations and in which n data items are saved. We first develop a clustering algorithm to partition stations into clusters. Secondly, we run a locally permutation routing to broadcast items to their local destinations in each group. Finally we use a multicast procedure to transmit outgoing items to their final cluster destination. We show that the approach of this paper can solve the permutation problem in a multi hop ad hoc network in q is the number of clusters of the network. In our knowledge, it is the first algorithm for permutation routing in multi-hop ad hoc networks.
Our former work in REF presents a randomized algorithm for the same problem in multi-hop network with high probability.
Randomized Permutation Routing in Multi-hop Ad Hoc Networks with Unknown Destinations
IFIP International Federation for Information Processing
IFIP International Federation for Information Processing
Mathematics