Message-efficient self-organization of wireless sensor networks

Distributed self-organization algorithms for wireless sensor (and actuator) networks must have low message complexity from energy and bandwidth considerations. In this paper, we present a novel approach for message-efficient clustering, in which nodes allocate local growth budgets to neighbors. We introduce two algorithms that make use of this approach. Unlike the expanding ring approach [C.V. Ramamoorhty, A. Bhide, and J. Srivastava, Proc. IEEE INFOCOM '87, 1987], our algorithms do not involve the initiator in each round, and do not violate the specified upper bound on the cluster size at any time. We derive analytical performance bounds of our algorithms and also provide performance results from simulations. The algorithms produce clusters of bounded size and low diameter, using significantly fewer messages than the expanding ring approach.

[1]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[2]  Samir Khuller,et al.  A clustering scheme for hierarchical control in multi-hop wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[3]  John M. Mcquillan,et al.  Adaptive routing algorithms for distributed computer networks , 1974 .

[4]  Rajesh Krishnan,et al.  Optimization algorithms for large self-structuring networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[5]  Farouk Kamoun,et al.  Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.

[6]  C. V. Ramamoorthy,et al.  RELIABLE CLUSTERING TECHNIQUES FOR LARGE, MOBILE PACKET RADIO NETWORKS. , 1987 .

[7]  Andrew V. Goldberg,et al.  Network decomposition and locality in distributed computation , 1989, 30th Annual Symposium on Foundations of Computer Science.

[8]  N Linial,et al.  Low diameter graph decompositions , 1993, Comb..