Sensor networks have emerged as a revolutionary technology for querying the physical world and hold promise in a wide variety of applications. However, the extremely energy constrained nature of these networks necessitate that their architecture be designed in an energy-aware manner. Clustering is the architecture of choice as it keeps the traffic local; sensor nodes would send only to nearby cluster-head within a fixed radius, independent of the network size.
In this paper we address the problem of clustering in WSNs, subject to upper bounds on the maximum latency, the energy consumed by intermediate nodes, and clusters size. Those constraints are necessary for the reliability of the system and for extending its lifetime. We propose a polynomial time algorithm consisting of recursively computing minimum weighted dominating sets, while respecting latency and energy consumption constraints. We compare our algorithm to other alternatives and show that it consistently outperforms them.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
In this paper, iterations refer to recursive iterations. For example, iteration i refers to the ith recursive step, or recursion.
References
J. M. Kahn, R. H. Katz, and K. S. J. Pister, Next Century Challenges: Mobile Networking for Smart Dust, Proceedings MOBICOM, Seattle, 1999.
A. Burnstein, K. Bult, D. Chang, and F. Chang, Wireless Integrated Microsensors, Proceedings Sensors EXPO 1996, Anaheim, CA, 1996.
J. Rabaey, J. Ammer, J. L. da Silva and D. Patel, PicoRadio: Adhoc Wireless Networking of Ubiquitous Low-Energy Sensor/Monitor Nodes, IEEE Computer Society Workshop on VLSI, Orlando, FL, pp. 9–12, 2000.
Ember Corp., Reliable Wireless Networks for Industrial Systems, Technical White Paper, Published by Ember Corp.
C. Chiasserini, E. Magli, and D. di Elettronica, Energy Consumption and Image Quality in Wireless Video Surveillance Networks, Proceedings 13th IEEE PIMRC, 2002.
ALERT Systems, http://www.alertsystems.org.
A. Mainwaring, J. Polastre, R. Szewczyk, and D. Culler, Wireless Sensor Networks for Habitat Monitoring, In First ACM International Workshop on Wireless Workshop in Wireless Sensor Networks and Applications, 2002.
V. Raghunathan, C. Schurgers, S. Park, and M. B. Srivastava, Energy-Aware Wireless Microsensor Networks, in IEEE Signal Processing Magazine, 2002.
S. Singh, M Woo, and C. Raghavendra, Power-Aware Routing in Mobile Ad Hoc Networks, Proceedings of the 4th annual ACM/IEEE International Conference on Mobile computing and Networking, 1998.
D. Estrin, R. Govindan, J. Heidemann, and S. Kumar, Next Century Challenges: Scalable Coordination in Sensor Networks, MOBICOM, 1999.
P. H. Hsiao, A. Hwang, H. T. Kung, and D. Vlah, Load Balancing Routing for Wireless Access Networks, In IEEE INFOCOM, 1999.
D. Shmoys, Approximation Algorithms for Facility Location Problems, APPROX 2000, pp. 27–32, 2000.v.
A. Kuehn and M. J. Hamburger, A Heuristic Program for Locating Warehouses, Management Sci., Vol. 9, pp. 643–666, 1963.
S. Arora, P. Raghavan, and S. Rao, Approximation Schemes for Euclidean k-Medians and Related Problems, ACM Symposium on Theory of Computing, pp. 106–113, 1998.
V. Bharghavan and B. Das, Routing in Ad Hoc Networks Using Minimum Connected Dominating Sets, International Conference on Communications, 1997.
J. Wu and H. Li, On Calculating Connected Dominating Set For Efficient Routing in Ad Hoc Wireless Networks, Workshop on Discrete Algorithms and Methods for mobile Computing and Communications, 1999.
Y. Chen and A. Liestman, Approximating Minimum Size Weakly-Connected Dominating Sets for Clustering Mobile Ad Hoc Networks, ACM International Symposium on Mobile Ad Hoc Networking and Computing, 2002.
V. Mhatre, C. Rosenberg, D. Kofman, R. Mazumdar, and N. Shroff, A Minimum Cost Heterogeneous Sensor Network with a Lifetime Constraint, IEEE Transactions on Mobile Computing, 2005.
J. Pan, Y. Hou, L. Cai, Y. Shi, and S. Shen, Topology Control for Wireless Sensor Networks, MobiCom, 2003.
S. Bandyopadhyay and E. Coyle, An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks, Proceedings of IEEE INFOCOM, 2003.
G. Gupta and M. Younis, Load-Balanced Clustering in Wireless Sensor Networks, IEEE International conference on communications, Anchorage, Alaska, 2003.
S. Banerjee and S. Khuller, A Clustering Scheme for Hierarchical Control in Multi-hop Wireless Networks, INFOCOM, 2001.
A. Antis, R. Prakash, T. Vuong, and D. Huynh, Max-Min d-Cluster Formation in Wireless Ad Hoc Networks, IEEE INFOCOM, 2000.
J. Wong, R. Jafari, and M. Potkonjak, Gateway Placement for Latency and Energy Efficient Data Aggregation, IEEE International Conference on Local Computer Networks, 2004.
Y. Bejerano, Efficient Integration of Multihop Wireless and Wired Networks with QoS Constraints, IEEE/ACM Transactions on Networking, 2004.
V. Chvatal, A Greedy Heuristic for the Set-Covering Problem, Mathematics of Operation Research, Vol. 4, No. 3, pp. 233–235, 1979.
D. Karger, P. Klein, and R. Tarjan, A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees, J. ACM, Vol. 42, pp. 321–328, 1995.
V. Mhatre and C. Rosenberg, Design Guidelines for Wireless Sensor Networks: Communication, Clustering and Aggregation, Ad Hoc Networks, 2004
ACKNOWLEDGMENTS
This research is partially supported by Communications and Information Technology Ontario (CITO), NORTEL, and the Natural Sciences and Engineering Research Council (NSERC).
Author information
Authors and Affiliations
Corresponding author
Additional information
Bassam Aoun received his B. Eng. degree from the American University of Beirut (Lebanon) in 2004. He is pursuing his M. Math degree at the School of Computer Science, University of Waterloo (Canada). His research focuses on topology optimization and resource management in wireless mesh networks (WMN). Recent work has involved gateway placement, capacity analysis, and channel assignment in WMN.
Raouf Boutaba is an Associate Professor in the School of Computer Science of the University of Waterloo. He conducts research in network management and published more than 200 papers in refereed journals and conference proceedings. He is the Chair of the IFIP WG on Network Management, of IEEE ComSoc Information Infrastructure committee, and the Director of the IEEE ComSoc Related Societies Board. He is the editor in Chief of the IEEE eTransactions on Network and Service Management and on the editorial board of several journals. He is the recipient of several awards including the Premier’s Research Excellence Award.
Rights and permissions
About this article
Cite this article
Aoun, B., Boutaba, R. Clustering in WSN with Latency and Energy Consumption Constraints. J Netw Syst Manage 14, 415–439 (2006). https://doi.org/10.1007/s10922-006-9039-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10922-006-9039-4