We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Reseach Article

Clustering Wireless Sensor and Wireless Ad Hoc Networks using Dominating Tree Concepts

by Ishwar Baidari, H. B. Walikar, Shridevi Shinde
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 58 - Number 20
Year of Publication: 2012
Authors: Ishwar Baidari, H. B. Walikar, Shridevi Shinde
10.5120/9396-3345

Ishwar Baidari, H. B. Walikar, Shridevi Shinde . Clustering Wireless Sensor and Wireless Ad Hoc Networks using Dominating Tree Concepts. International Journal of Computer Applications. 58, 20 ( November 2012), 6-9. DOI=10.5120/9396-3345

@article{ 10.5120/9396-3345,
author = { Ishwar Baidari, H. B. Walikar, Shridevi Shinde },
title = { Clustering Wireless Sensor and Wireless Ad Hoc Networks using Dominating Tree Concepts },
journal = { International Journal of Computer Applications },
issue_date = { November 2012 },
volume = { 58 },
number = { 20 },
month = { November },
year = { 2012 },
issn = { 0975-8887 },
pages = { 6-9 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume58/number20/9396-3345/ },
doi = { 10.5120/9396-3345 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:03:00.391264+05:30
%A Ishwar Baidari
%A H. B. Walikar
%A Shridevi Shinde
%T Clustering Wireless Sensor and Wireless Ad Hoc Networks using Dominating Tree Concepts
%J International Journal of Computer Applications
%@ 0975-8887
%V 58
%N 20
%P 6-9
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The most important criterion for achieving the maximum performance in wirless sensor and ad-hoc networks is to clustering the nodes. Many clustering schemes have been proposed for different ad-hoc networks. In sensor networks the energy stored in the network nodes is limited and usually infeasible to recharge. The clustering schemes for these networks therefore aim at maximizing the energy efficiency. In mobile ad hoc networks the moment of the network nodes may quickly change the topology resulting in the increase of the overhead message in topology maintenance, the clustering schemes for mobile ad hoc networks therefore aim at handling topology maintenance, managing node movement or reducing overhead. In this paper we proposed an algorithm which gives connected dominating set of a tree.

References
  1. E Cockayne,S. Goodman, and S. Hedetniemi, A Linear Algorithm for the Domination Number of A Tree. Inform. Process. Lett. , Volume 4:41-44 number 2 ,1975
  2. S. L. Mitchell,E. J. Cockayne,and S. T. Hedetniemi. Linear algorithms on recursive representa tion of trees. J. Compute. System Sci. ,18(1):76-85,1979.
  3. J. Polastre, J. Hill and D. Culler, Versatile Low Power Media Access for Wireless Sensor Networks,ACM SenSys, November 2004.
  4. T. He, J. Stankovic, C. Lu and T. Abdelzaher, A Spatiotemporal Communication Protocol for Wireless Sensor Networks, IEEE Transactions on Parallel and Distributed Systems, to appear
  5. B. Karp and H. T. Kung, GPSR: Greedy Perimeter Stateless Routing for Wireless Sensor Networks,IEEE Mobicom, August 2000. "
  6. C. Intanagonwiwat, R. Govindan, and D. Estrin. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pages 56–67, ACM Press,2000.
  7. C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva. Directed diffusion for wireless sensor networking. IEEE/ACM Transactions on Networking,11(1):2–16, 2003.
  8. J. Agre and L. Clare. An integrated architecture for cooperative sensing networks. IEEE Computer, pages 106–108, May 2000. .
  9. . West, D. : Introduction to Graph Theory, Second edition, Prentice Hall, Upper Saddle River, N. J. , (2001).
  10. Haynes, T. , W. , Hedetniemi, S. , T. and Slater, P. , J. : Domination in Graphs,Advanced Topics, Marcel Dekker, Inc. , (1998).
  11. Chen, Y. , Z. , P. , Liestman, A. , L. and Jiangchuan, L. : Clustering Algorithms for Ad Hoc Wireless Networks, Nova Science Publishers, (2004).
  12. Baker, D. and Ephremides, A. : The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm, Communications, IEEE Transactions, (1981), 29(11), 1694-1701.
  13. Gerla, M. and Jack T. , C. , T. : Multicluster, Mobile, Multimedia Radio Network,Wireless Networks, 1(3), (1995), 255-265.
  14. Chen, G. , Nocetti, F. ,G. , Gonzalez and J. S. , Stojmenovic, I. : Connectivity Based K-Hop Clustering in Wireless Networks, System Sciences, Proc. of the 35th Annual Hawaii International Conference, (2002), 2450-2459.
  15. Ohta, T. , Inoue, S. and Kakuda, Y. : An Adaptive Multihop Clustering Scheme for Highly Mobile Ad Hoc Networks, Proc. of 6th ISADS'03, (2003).
  16. Chen, Y. , P. and Liestman, A. , L. : A Zonal Algorithm for Clustering Ad Hoc Networks, International Journal of Foundations of Computer Science, (2003), 14(2),305-322.
  17. Stojmenovic, I. , Seddigh M. and Zunic, J. : Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks, IEEE Transactions on Parallel and Distributed Systems, (2002), 13, 14-25. "
  18. Guha S. and Khuller, S. : Approximation Algorithms for Connected Dominating Sets, Springer Verlag New York, LLC, ISSN: 0178-4617, (1998).
  19. Das, B. and Bharghavan, V. : Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets, Communications, ICC97 Montreal, 'Towards the Knowledge Millennium', IEEE International Conference, (1997), 1, 376-380
  20. . Wu and Li
  21. ," Wu, J. and Li, H. : A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks, Springer Science Business Media B. V. , Formerly Kluwer Academic Publishers B. V. ISSN: 1018-4864, (2001).
  22. Wu, J. and Li, H. : A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks, Springer Science+Business Media B. V. , Formerly Kluwer Academic Publishers B. V. ISSN: 1018-4864, (2001).
  23. Wan, P. , J. , Alzoubi, K. , M. and Frieder, O. : Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks, Springer Science+Business Media B. V. , Formerly Kluwer Academic Publishers B. V. , , (2002), 9(2), 141-149
  24. "Liu, H. , Pan, Y. and Cao, J. : An Improved Distributed Algorithm for Connected Dominating Sets in Wireless Ad Hoc Networks, Parallel and Distributed Processing and Applications, Proc. of the ISPA 2004, (2004), 340.
  25. Liu, H. , Pan, Y. and Cao, J. : An Improved Distributed Algorithm for Connected Dominating Sets in Wireless Ad Hoc Networks, Parallel and Distributed Processing and Applications, Proc. of the ISPA 2004, (2004), 340.
  26. J. Liu, Maximal Independent Sets in Bipartite Graphs, Journal of Graph Theory 17(1993)495-507.
Index Terms

Computer Science
Information Sciences

Keywords

Wireless sensor networks ad-hoc networks connected dominating set connected dominating tree tree