Ad-Hoc Networking pp 47-59 | Cite as

# Randomized Permutation Routing in Multi-hop Ad Hoc Networks with Unknown Destinations

## Abstract

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 \(
(\frac{6}
{q} + 13)n + O(q^{\frac{4}
{3}} \log ^{\frac{{10}}
{3}} q) + D_b - 1
\)
broadcast rounds in the worst case with the probability at least \(
1 - \frac{1}
{p}
\)
whenever \(
q \leqslant \frac{p}
{{3\log p}}
\)
. Where *D* _{b} is the blocking diameter, *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.

## Keywords

Cluster Head Data Item Destination Station Local Memory Mobile Host## References

- [1]S. Basagni. Distributed clustering for multihop wireless networks.
*In A. Annamalai and C. Tellambura*,*Proceedings of the IEEE International Symposium on Wireless Communications (ISWC’99)*, pp. 41–42, June 3–4 1999.Google Scholar - [2]A. Datta. Fault-tolerant and Energy-efficient Permutation Routing Protocol for Wireless Networks. 17
^{th}*IEEE Intern. Parallel and Distributed Processing Sym-posium (IPDPS’03)*, Nice, France, 2003.Google Scholar - [3]Amitava Datta, Albert Y. Zomaya: An Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks.
*IEEE Trans. Parallel Distrib. Syst. 15*(4): 331–338 (2004)CrossRefGoogle Scholar - [4]D. Karimou, J. F. Myoupo. An Application of an Initialization Protocol to Permutation Routing in a Single-hop Mobile Ad-Hoc Networks.
*The journal of Super computing*vol. 31, p. 215–226, 2005.zbMATHCrossRefGoogle Scholar - [5]D. Karimou and J.F. Myoupo. A Fault Tolerant Permutation Routing Algorithm in Mobile Ad Hoc Networks.
*International Conference on Networks (ICN’05)*, Part II, LNCS 3421, pp.107–115,*2005*.Google Scholar - [6]L. Gasieniec, T. Radzik and Q. Xin. Faster deterministic gossiping in ad hoc radio networks.
*Proc. 9*^{th}*Scandinavian Workshop on Algorithm Theory, SWAT 2004*, Humlebaek, Danmark,*LNCS 3111*, pp. 397–407.Google Scholar - [7]R. Motwani and P. Raghavan.
*Randomized Algorithms*. Cambridge University Press, 1995.Google Scholar - [8]J. F. Myoupo. Concurrent Broadcasts-Based Permutation Routing algorithms in Radio Networks.
*IEEE Symposium on Computers and Communications, (ISCC’03)*, Antalya, Turkey, 2003.Google Scholar - [9]K. Nakano, S. Olariu and J.L. Schwing. Broadcast-Efficient protocols for Mobile Radio Networks.
*IEEE Trans. Parallel Distr. Syst.*vol.10, pp.12, 1276–1289, 1999.CrossRefGoogle Scholar - [10]Koji Nakano, Stephan Olariu, Albert Y. Zomaya: Energy-Efficient Permutation Routing in Radio Networks.
*IEEE Trans. Parallel Distrib. Syst. 12*(6): 544–557 (2001)CrossRefGoogle Scholar - [11]Y.C. Tseng, S-Y Ni, Y-S Chen and J.-P Sheu. The Broadcast Storm Problem in a Mobile Ad Hoc Network.
*ACM Wireless Networks*8, 153–167, 2002zbMATHCrossRefGoogle Scholar