A Deterministic Protocol for Permutation Routing in Dense Multi-Hop Sensor Networks

Abstract

A large variety of permutation routing protocols in a single-hop Network are known in the literature. Since they are single hop, there is always a wireless link 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 hybrid clustering mechanism to perform permutation routing in multi-hop ad hoc Networks. We first propose to partition the network in single-hop clusters also named cliques. Secondly, we run a local permutation routing to broadcast items to their local destinations in each clique. Next we partition the clusterheads of cliques with the hierarchical clustering technique. We show how the outgoing items can be routed to their destination cliques. We give an estimation of the number of broadcast rounds in the worse case. More precisely, we show that solving the permutation routing problem on a multi-hop sensor network needWhere n is the number of the data items stored in the network, p is the number of sensors, |HUB max | is the number of sensors in the clique of maximum size and k is the number of cliques after the first clustering. Finally, simulation results show that our algorithm performs better than the naïve multiple gossiping. To the best of our knowledge, it is the first algorithm for permutation routing in multi-hop radio networks.

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

“…All these approaches assume that the WSN is a single hop networks. At present there is one protocol that runs the permutation routing in multi-hop wireless networks [3], using…”

“…As in [3], we first propose to partition the network into single-hop clusters also named cliques. Secondly, we run a local permutation routing to broadcast items to their local destinations in each clique.…”

“…We show how the outgoing items can be routed to their final destination cliques. We derive a Breath First Search tree ( BFS tree) that we to perform the broadcastings of outgoing data items, contrary as in [3], where a general graph is used to broadcast these items. Therefore we can perform the process simultaneously on nodes.…”

“…More precisely we show that the permutation routing problem can be solved in k n 2 log 6 3  in the worst case, where k the number of cliques after the clustering in cliques. We present the experimental results comparison in terms of number of broadcast rounds between our protocols and the one in [3].…”

ISCP: An Instantaneous and Secure Clustering Protocol for Wireless Sensor Networks

“…If all the sensors of a cluster can communicate with each other in the same cluster, this cluster is also called a clique. Note that clustering can be done following two different approaches [15,16,17,18,19,20,21,22] : -The Cluster Head First approach : this approach states that the clustering process is performed by choosing the CH first, and then cluster members are chosen based on this CH. -The cluster First approach : this second approach consists of first choosing the members of the cluster.…”