An Efficient Permutation Routing Protocol in Multi-Hop Wireless Sensor Networks

Abstract

A wireless sensors network (WSN for short) can be represented as a graph, tree, or other structures. The structure is more or less important depending on the problem that we will deal with and the respect of constraints on WSNs. WSN (p, n) is a wireless sensor network of p stations with n items saved on it. In this paper we are interested in the permutation routing problem on multi-hop WSN(p, n). We derive a new protocol that performs with less number of broadcast rounds compared to the one in [3]. We present some simulation results comparing our protocols to the one in [3].