An analysis of the generalised Max-Min d-cluster formation heuristic

The aims of this article are to find bounds to the cluster formation heuristic presented in [1]. This heuristic is a generalisation of the one presented in [2] by Amis et al. This generalisation lets use any criterion to set clusters. Lower and upper bounds are proposed in this paper. The mathematical framework previously developed is used jointly with Palm theory to find these bounds.

[1]  Mario Gerla,et al.  Clustering with power control , 1999, MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341).

[2]  Stefano Basagni,et al.  Distributed clustering for ad hoc networks , 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).

[3]  Christian Bettstetter.  The cluster density of a distributed clustering algorithm in ad hoc networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[4]  T. Mattfeldt.  Stochastic Geometry and Its Applications , 1996 .

[5]  Monique Becker,et al.  Correction, Generalisation and Validation of the "Max-Min d-Cluster Formation Heuristic" , 2007, Networking.

[6]  Adrian Perrig,et al.  ACE: An Emergent Algorithm for Highly Uniform Cluster Formation , 2004, EWSN.

[7]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[8]  Catherine Rosenberg,et al.  Design guidelines for wireless sensor networks: communication, clustering and aggregation , 2004, Ad Hoc Networks.

[9]  Tomoyuki Ohta,et al.  An adaptive multihop clustering scheme for highly mobile ad hoc networks , 2003, The Sixth International Symposium on Autonomous Decentralized Systems, 2003. ISADS 2003..

[10]  Stefano Basagni,et al.  A performance comparison of protocols for clustering and backbone formation in large scale ad hoc networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[11]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

[12]  Thomas C. Henderson,et al.  Reaction-diffusion patterns in smart sensor networks , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[13]  Thomas C. Henderson,et al.  Smart sensor snow , 1998, Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190).

[14]  Mario Gerla,et al.  On-demand routing in large ad hoc wireless networks with passive clustering , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[15]  Stefano Basagni,et al.  Distributed and mobility-adaptive clustering for multimedia support in multi-hop wireless networks , 1999, Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324).

[16]  Ossama Younis,et al.  Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach , 2004, IEEE INFOCOM 2004.

[17]  Vikas Kawadia,et al.  Power control and clustering in ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).