skip to main content
10.1145/1774088.1774235acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

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

Published: 22 March 2010 Publication History

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.

Cited By

View all
  • (2019)An Efficient Clustering of Wireless Sensor Network by Spectral Graph PartitioningIntelligent Technologies and Applications10.1007/978-981-13-6052-7_60(698-710)Online publication date: 12-Mar-2019
  • (2015)A New Two-Level Clustering Scheme for Partitioning in Distributed Wireless Sensor NetworksInternational Journal of Distributed Sensor Networks10.1155/2015/43504811:5(435048)Online publication date: Jan-2015

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SAC '10: Proceedings of the 2010 ACM Symposium on Applied Computing
March 2010
2712 pages
ISBN:9781605586397
DOI:10.1145/1774088
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 March 2010

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. communication
  2. distributed system
  3. graph partitioning
  4. group formation
  5. partitioning

Qualifiers

  • Research-article

Conference

SAC'10
Sponsor:
SAC'10: The 2010 ACM Symposium on Applied Computing
March 22 - 26, 2010
Sierre, Switzerland

Acceptance Rates

SAC '10 Paper Acceptance Rate 364 of 1,353 submissions, 27%;
Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25
The 40th ACM/SIGAPP Symposium on Applied Computing
March 31 - April 4, 2025
Catania , Italy

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2019)An Efficient Clustering of Wireless Sensor Network by Spectral Graph PartitioningIntelligent Technologies and Applications10.1007/978-981-13-6052-7_60(698-710)Online publication date: 12-Mar-2019
  • (2015)A New Two-Level Clustering Scheme for Partitioning in Distributed Wireless Sensor NetworksInternational Journal of Distributed Sensor Networks10.1155/2015/43504811:5(435048)Online publication date: Jan-2015

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media