Skip to main content

ACE: An Emergent Algorithm for Highly Uniform Cluster Formation

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2920))

Abstract

The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient upper layer network functions such as routing, broadcast, data aggregation, and query processing.

We present ACE, an algorithm that results in highly uniform cluster formation that can achieve a packing efficiency close to hexagonal close-packing. By using the self-organizing properties of three rounds of feedback between nodes, the algorithm induces the emergent formation of clusters that are an efficient cover of the network, with significantly less overlap than the clusters formed by existing algorithms. The algorithm is scale-independent — it completes in time proportional to the deployment density of the nodes regardless of the overall number of nodes in the network. ACE requires no knowledge of geographic location and requires only a small constant amount of communications overhead.

This research was supported in part by the Center for Computer and Communications Security at Carnegie Mellon under grant DAAD19-02-1-0389 from the Army Research Office, and by gifts from Bosch and Intel Corporation. The views and conclusions contained here are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either express or implied, of ARO, Bosch, Carnegie Mellon University, Intel, or the U.S. Government or any of its agencies.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amis, A.D., Prakash, R., Vuong, T.H.P., Huynh, D.T.: Max-Min D-Cluster Formation in Wireless Ad Hoc Networks. In: Proceedings of IEEE INFOCOM 2000, pp. 32–41 (2000)

    Google Scholar 

  2. Baker, D.J., Ephremides, A., Flynn, J.A.: The Design and Simulation of a Mobile Radio Network with Distributed Control. IEEE Journal on Selected Areas in Communication 2(1), 226–237 (1984)

    Article  Google Scholar 

  3. Banerjee, S., Khuller, S.: A Clustering Scheme for Hierarchical Control in Wireless Networks. In: Proceedings of IEEE INFOCOM 2001 (April 2001)

    Google Scholar 

  4. Basagni, S.: Distributed Clustering for Ad Hoc Networks. In: Proceedings of the IEEE International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN), June 1999, pp. 310–315 (1999)

    Google Scholar 

  5. Ephremides, A., Wieselthier, J.E., Baker, D.J.: A Design Concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling. Proceedings of IEEE 75(1), 56–73 (1987)

    Article  Google Scholar 

  6. Estrin, D., Govindan, R., Heidemann, J., Kumar, S.: Next Century Challenges: Scalable Coordination in Sensor Networks. In: Proceedings of the Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 19), August 1999, pp. 263–270 (1999)

    Google Scholar 

  7. Fisher, D.A., Lipson, H.F.: Emergent Algorithms: A New Method for Enhancing Survivability in Unbounded Systems. In: Proceedings of the Hawaii nternational Conference On System Sciences (January 1999)

    Google Scholar 

  8. Gerla, M., Kwon, T.J., Pei, G.: On Demand Routing in Large Ad Hoc Wireless Networks with Passive Clustering. In: Proceedings of IEEE Wireless Communications and Networking Conference, WCNC 2000 (September 2000)

    Google Scholar 

  9. Gerla, M., Tsai, J.T.: Multicluster, Mobile, Multimedia Radio Network. ACM/Kluwer Journal of Wireless Networks 1(3), 255–265 (1995)

    Article  Google Scholar 

  10. Heinzelman, W., Chandrakasan, A., Balakrishnan, H.: Energy-Efficient Communication Protocol for Wireless Microsensor Networks. In: Proceedings of the 33rd Hawaii International Conference on System Sciences, HICSS 2000 (January 2000)

    Google Scholar 

  11. Henderson, T.C., Dekhil, M., Morris, S., Chen, Y., Thompson, W.B.: Smart Sensor Snow. In: Proceedings of IEEE Conference on Intelligent Robots and Intelligent Systems (IROS) (October 1998)

    Google Scholar 

  12. Hong, X., Gerla, M., Yi, Y., Xu, K., Kwon, T.: Scalable Ad Hoc Routing in Large, Dense Wireless Networks Using Clustering and Landmarks. In: Proceedings of IEEE International Conference on Communications, ICC 2002 (April 2002)

    Google Scholar 

  13. Jia, L., Rajaraman, R., Suel, T.: An Efficient Distributed Algorithm for Constructing Small Dominating Sets. In: Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, pp. 33–42 (2001)

    Google Scholar 

  14. Krishna, P., Vaidya, N.H., Chatterjee, M., Pradhan, D.: A cluster-based approach for routing in dynamic networks. ACM SIGCOMM Computer Communication Review 27(2), 49–65 (1997)

    Article  Google Scholar 

  15. Krishnan, R., Ramanathan, R., Steenstrup, M.: Optimization Algorithms for Large Self-Structuring Networks. In: IEEE INFOCOM 1999 (1999)

    Google Scholar 

  16. Kuhn, F., Wattenhofer, R.: Constant-Time Distributed Dominating Set Approximation. In: Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing, pp. 25–32 (2003)

    Google Scholar 

  17. Lin, C.R., Gerla, M.: Adaptive Clustering for Mobile Wireless Networks. IEEE Journal of Selected Areas in Communications 15(7), 1265–1275 (1997)

    Article  Google Scholar 

  18. Nagpal, R., Coore, D.: An Algorithm for Group Formation in an Amorphous Computer. In: Proceedings of the 10th International Conference on Parallel and Distributed Computing Systems (PDCS 1998) (October 1998)

    Google Scholar 

  19. Ni, S.-Y., Tseng, Y.-C., Chen, Y.-S., Sheu, J.-P.: The Broadcast Storm Problem in a Mobile Ad Hoc Network. In: Proceedings of the Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 1999), August 1999, pp. 151–162 (1999)

    Google Scholar 

  20. Pagani, E., Rossi, G.P.: Reliable broadcast in mobile multihop packet networks. In: Proceedings of the Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 1997), pp. 34–42 (1997)

    Google Scholar 

  21. Ramanathan, R., Steenstrup, M.: Hierarchically-Organized, Multihop Mobile Wireless Networks for Quality-of-Service Support. ACM/Baltzer Mobile Networks and Applications 3(1), 101–119 (1998)

    Article  Google Scholar 

  22. Thaler, D.G., Ravishankar, C.V.: Distributed Top-Down Hierarchy Construction. In: Proceedings of IEEE INFOCOM, pp. 693–701 (1998)

    Google Scholar 

  23. Tsuchiya, P.F.: The landmark hierarchy: a new hierarchy for routing in very large networks. In: Symposium Proceedings on Communications Architectures and Protocols (SIGCOMM 1988), pp. 35–42 (1988)

    Google Scholar 

  24. Turing, A.: The chemical basis of morphogenesis. Philosophical Transactions of the Royal society of London B237, 37–72 (1952)

    Article  Google Scholar 

  25. Xu, K., Gerla, M.: A Heterogeneous Routing Protocol Based on a New Stable Clustering Scheme. In: IEEE MILCOM 2002 (October 2002)

    Google Scholar 

  26. Xu, Y., Bien, S., Mori, Y., Heidemann, J., Estrin, D.: Topology Control Protocols to Conserve Energy in Wireless Ad Hoc Networks. Technical Report 6, University of California, Los Angeles, Center for Embedded Networked Computing (January 2003)

    Google Scholar 

  27. Zhang, H., Arora, A.: GS3: Scalable Self-configuration and Self-healing in Wireless Networks. In: 21st ACM Symposium on Principles of Distributed Computing, PODC 2002 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chan, H., Perrig, A. (2004). ACE: An Emergent Algorithm for Highly Uniform Cluster Formation. In: Karl, H., Wolisz, A., Willig, A. (eds) Wireless Sensor Networks. EWSN 2004. Lecture Notes in Computer Science, vol 2920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24606-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24606-0_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20825-9

  • Online ISBN: 978-3-540-24606-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics