Abstract
The domatic partition problem seeks to maximize the partitioning of the nodes of the network into disjoint dominating sets. These sets represent a series of virtual backbones for wireless sensor networks to be activated successively, resulting in more balanced energy consumption and increased network robustness. In this study, we address the domatic partition problem in random geometric graphs by investigating several vertex coloring algorithms both topology and geometry-aware, color-adaptive and randomized. Graph coloring produces color classes with each class representing an independent set of vertices. The disjoint maximal independent sets constitute a collection of disjoint dominating sets that offer good network coverage. Furthermore, if we relax the full domination constraint then we obtain a partitioning of the network into disjoint dominating and nearly-dominating sets of nearly equal size, providing better redundancy and a near-perfect node coverage yield. In addition, these independent sets can be the basis for clustering a very large sensor network with minimal overlap between the clusters leading to increased efficiency in routing, wireless transmission scheduling and data-aggregation. We also observe that in dense random deployments, certain coloring algorithms yield a packing of the nodes into independent sets each of which is relatively close to the perfect placement in the triangular lattice.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arora, A., et al.: ExScal: Elements of an Extreme Scale Wireless Sensor Network. In: Proc. of 11th IEEE RTCSA 2005 (2005)
Bai, X., et al.: Deploying Wireless Sensors to Achieve Both Coverage and Connectivity. In: Proc. of 7th ACM MOBIHOC 2006, pp. 131–142 (2006)
Cardei, M., et al.: Connected Domination in Multihop Ad Hoc Wireless Networks. In: Proc. of 6th Int. Conf. on Computer Science and Informatics (CS&I 2002), pp. 251–255 (2002)
Cardei, M., Wu, J.: Energy-efficient coverage problems in wireless ad-hoc sensor networks. J. of Computer Communications 29(4), 413–420 (2006)
Cardei, M., et al.: Wireless Sensor Networks with Energy Efficient Organization. J. of Interconnection Networks 3(3-4), 213–229 (2002)
Chan, H., Perrig, A.: ACE: An Emergent Algorithm for Highly Uniform Cluster Formation. In: Karl, H., Wolisz, A., Willig, A. (eds.) EWSN 2004. LNCS, vol. 2920, pp. 154–171. Springer, Heidelberg (2004)
DÃaz, J., Petit, J., Serna, M.: Random geometric problems on [0,1]2. In: Rolim, J.D.P., Serna, M., Luby, M. (eds.) RANDOM 1998. LNCS, vol. 1518, pp. 294–306. Springer, Heidelberg (1998)
Feige, U., Halldórsson, M.M., Kortsarz, G., Srinivasan, A.: Approximating the domatic number. SIAM J. of Computing 32(1), 172–195 (2003)
Ghosh, A., Das, S.K.: Coverage and connectivity issues in wireless sensor networks: A survey. J. of Pervasive and Mobile Computing 4(3), 303–334 (2008)
Ha, R.W., et al.: Sleep scheduling for wireless sensor networks via network flow model. J. of Computer Communications 29(13-14), 2469–2481 (2006)
He, Y., et al.: Energy Efficient Connectivity Maintenance in Wireless Sensor Networks. In: Proc. of International Conference on Intelligent Computing (ICIC 2006), pp. 95–105 (2006)
Iyengar, R.: Low-coordination Topologies For Redundancy In Sensor Networks. In: Proc. of 6th ACM MOBIHOC 2005, pp. 332–342 (2005)
Kubale, M.: Graph Colorings. American Mathematical Society (2004)
Matula, D., Marble, G., Isaacson, J.D.: Graph Coloring Algorithms. In: Read, R. (ed.) Graph Theory and Computing, pp. 109–122. Academic Press, New York (1972)
Matula, D., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. of the ACM 30(3), 417–427 (1983)
Moscibroda, T., Wattenhofer, R.: Maximizing the Lifetime of Dominating Sets. In: Proc. of 5th IEEE WMAN 2005 (2005)
Pemmaraju, S.V., Pirwani, I.A.: Energy Conservation via Domatic Partitions. In: Proc. of 7th ACM MOBIHOC 2006, pp. 143–154 (2006)
Thai, M.T., et al.: O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks. In: Proc. of 26th IEEE IPCCC 2007, pp. 85–92 (2007)
Wagner, D., Wattenhofer, R.: Algorithms for Sensor and Ad Hoc Networks, Advanced Lectures. Springer, Heidelberg (2007)
Wang, B., Fu, C., Lim, H.B.: Layered Diffusion based Coverage Control in Wireless Sensor Networks. In: Proc. Of 32nd IEEE Conference on Local Computer Networks, pp. 504–511 (2007)
Zhang, H., Arora, A.: GS3: Scalable Self-configuration and Self-healing in Wireless Sensor Networks. J. of Computer Networks 43(4), 459–480 (2003)
Zhang, H., Hou, J.C.: Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. J. of Ad Hoc and Sensor Wireless Networks 1(1-2), 89–124 (2005)
Zhou, Y., et al.: A Point-Distribution Index and Its Application to Sensor-Grouping in Wireless Sensor Networks. In: Proc. of IWCMC 2006, pp. 1171–1176 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mahjoub, D., Matula, D.W. (2009). Experimental Study of Independent and Dominating Sets in Wireless Sensor Networks Using Graph Coloring Algorithms. In: Liu, B., Bestavros, A., Du, DZ., Wang, J. (eds) Wireless Algorithms, Systems, and Applications. WASA 2009. Lecture Notes in Computer Science, vol 5682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03417-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-03417-6_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03416-9
Online ISBN: 978-3-642-03417-6
eBook Packages: Computer ScienceComputer Science (R0)