A new two level hierarchy structuring for node partitioning in ad hoc networks

ABSTRACT

A big challenge in designing a distributed application is the partitioning which consists of optimizing the system component inter-communication. In this paper we introduce a new approach of Ad Hoc network group formation based on two level hierarchy structure: many groups with one leader per group at the first level and a super-leader for the whole network at the second one. We worked on the minimization of the communication between nodes by the choice of decent metrics in group formation as well as in leader and super-leader elections. Moreover the designed algorithm is validated by simulation results and then verified by model checking. In addition, a re-organization strategy and the principle of communication protocols will be presented.

References

1. N. Benaouda, H. Guyennet. and A. Benaouda, Simulation d'un scénario de e-maintenance préventive utilisant les services web .NET., in IEEE SETIT'2005, electronic edition, abstract page 235, Tunis, 2005.
2. N. Benaouda, H. Guyennet, A. Hammad, A/H Benaouda, M. Mostefai, Modélisation par les groupes d'un réseau sans fil Ad Hoc, Cip'2007, electronic edition, abstract page 108, Sétif, Algeria, 2007.
3. M. S. Bouassida, I. Chrismen, O. Festor, Group key management, International Journal Of Network Security, IJNS, 2006.
4. B. Chamberlain, Graph partitioning algorithms for distributing workloads of parallel computations, Technical Report UW-CSE-98-10-03, University of Washington, 1998.
5. E. M. Clarke, O. Grumberg and D. A PELED, Model checking, MIT Press, Cambridge, Massachusetts, 2001.
6. D. J. Evans W. U. N. Butt: Load Balancing with Network Partitioning Using Host Groups, Parallel Computing, 20, 325--345, 1994.
7. P. O. Fjallstrom, Algorithms for graph partitioning: A survey, Linkoping Electronic Articles in Computer and Information Science, 3(10), 1998.
8. M. R. Garey and D. S Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman Co., 1979.
9. H. Guyennet, Jean-Christophe Lapayre: The Group Approach in Cooperative Work and in Load Balancing, Journal of Parallel and Distributed Computing Practices, Vol 2, Nř3, p285--297, 2001.
10. A. Hammad and H. Mountassir, Heuristics to verify LTL properties of hierarchical systems, in VECoS'2008, 2nd Int. Workshop on Verification and Evaluation of Computer and Communication Systems, eWiC - electronic Workshops in Computing, Leeds, UK, July 2008, British Computer Society.
11. N. Kettaf, A. Abouaissa, P. Lorenz, H. Guyennet, A Self Organizing Algorithm for Ad hoc Networks, 10th IFIP Int. Conference on Personal Wireless Communication, PWC05, pp115--124, Colmar, Aug 2005.
12. M. Lehsaini, H. Guyennet, and M. Feham, CES Cluster-based Energy-efficient Scheme for Mobile Wireless Sensor Networks, chapter in the book Wireless Sensor and Actor Networks II (Boston Springer), vol. 264, pp. 13--24, May 2008.
13. W. Massri, QoS requirements mapping in TDMA-based Wireless Sensor Networks, Ph.D. in Computers from the University Paul Sabatier (Toulouse 3), 2009, Toulouse, France.
14. N. Mitton, Auto-organisation des réseaux sans fil Multi-sauts a grande échelle, Ph.D. in Computers and networks, 2006, Insa-Lyon, France.
15. P. G. Raverdy:Gestion de Ressources et Répartition de charge dans les systèmes hétérogènes a Grande échelle, PHD Thesis, Paris VI, 1996.
16. E. Rosti et al.: Robust Partitioning Policies of Multiprocessor Systems, Performance Evaluation North Holland, 19(2--3), 141--165, 1994.
17. J. G. Vaughan: A Hierarchical Protocol for Decentralizing Information Dissemination in Distributed Systems, The Computer Journal, Vol. 38, 1, 57--70, 1995.