The week's pick
Random Articles
Reseach Article
Clustering Wireless Sensor and Wireless Ad Hoc Networks using Dominating Tree Concepts
| 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
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
- 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
- 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.
- J. Polastre, J. Hill and D. Culler, Versatile Low Power Media Access for Wireless Sensor Networks,ACM SenSys, November 2004.
- 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
- B. Karp and H. T. Kung, GPSR: Greedy Perimeter Stateless Routing for Wireless Sensor Networks,IEEE Mobicom, August 2000. "
- 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.
- 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.
- J. Agre and L. Clare. An integrated architecture for cooperative sensing networks. IEEE Computer, pages 106–108, May 2000. .
- . West, D. : Introduction to Graph Theory, Second edition, Prentice Hall, Upper Saddle River, N. J. , (2001).
- Haynes, T. , W. , Hedetniemi, S. , T. and Slater, P. , J. : Domination in Graphs,Advanced Topics, Marcel Dekker, Inc. , (1998).
- Chen, Y. , Z. , P. , Liestman, A. , L. and Jiangchuan, L. : Clustering Algorithms for Ad Hoc Wireless Networks, Nova Science Publishers, (2004).
- 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.
- Gerla, M. and Jack T. , C. , T. : Multicluster, Mobile, Multimedia Radio Network,Wireless Networks, 1(3), (1995), 255-265.
- 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.
- Ohta, T. , Inoue, S. and Kakuda, Y. : An Adaptive Multihop Clustering Scheme for Highly Mobile Ad Hoc Networks, Proc. of 6th ISADS'03, (2003).
- 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.
- 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. "
- Guha S. and Khuller, S. : Approximation Algorithms for Connected Dominating Sets, Springer Verlag New York, LLC, ISSN: 0178-4617, (1998).
- 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
- . Wu and Li
- ," 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).
- 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).
- 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
- "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.
- 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.
- J. Liu, Maximal Independent Sets in Bipartite Graphs, Journal of Graph Theory 17(1993)495-507.
Index Terms
Keywords