Please use this identifier to cite or link to this item:
http://10.1.7.192:80/jspui/handle/123456789/3085
Title: | A Survey on Various Cluster Head Election Algorithms for MANET |
Authors: | Mehta, Sheetal Sharma, Priyanka Kotecha, K. |
Keywords: | Mobile Ad-Hoc Networks Clustering Clustering Computer Faculty Paper Faculty Paper ITFCE011 ITDIR001 NUiCONE NUiCONE-2011 |
Issue Date: | 8-Dec-2011 |
Publisher: | Institute of Technology |
Citation: | 2nd International Conference on Current Trends in Technology, NUiCONE-2011, Institute of Technology, Nirma University, December 8-10, 2011 |
Series/Report no.: | ITFCE011-5 |
Abstract: | In large Mobile Ad Hoc Networks (MANET), forming clusters of nodes has been verified to be a promising approach in high mobility network. The characteristics of MANETs are dynamic topology, bandwidth and link capacity, nodes are energy constrained. Clustering methods allow fast connection and topology management, better routing and also improve network performance parameters like routing delay, bandwidth consumption and throughput [1]. In MANET topology changes dynamically, so to achieve good performance any clustering algorithm should operate with minimum overhead of cluster maintenance and try to preserve its structure as much as possible when nodes are moving and/or the topology is slowly changing. A large variety of approaches for ad hoc clustering have been developed by researchers which focuses on different performance metrics. This paper presents a survey of different clustering schemes. A comparative analysis of various techniques also have been covered in this paper. |
URI: | http://10.1.7.181:1900/jspui/123456789/3085 |
ISBN: | 9788192304908 |
Appears in Collections: | Faculty Papers, CE |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ITFCE011-5.pdf | ITFCE011-5 | 744.39 kB | Adobe PDF | ![]() View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.