An efficient and scalable clustering algorithm for wireless ad hoc networks

dc.contributor.author	Γαβαλάς, Δαμιανός	en
dc.contributor.author	Πάντζιου, Γραμματή Ε.	el
dc.contributor.author	Μάμαλης, Βασίλης	el
dc.contributor.author	Κωνσταντόπουλος, Χαράλαμπος	el
dc.date.accessioned	2015-05-28T17:56:32Z
dc.date.available	2015-05-28T17:56:32Z
dc.date.issued	2015-05-28
dc.identifier.uri	http://hdl.handle.net/11400/11401
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://dgavalas.ct.aegean.gr/en/iframe_files/papers/2005/DAAWMS'2005%20-%20CR.pdf	en
dc.subject	αυτοοργανούμενα δίκτυα
dc.subject	ασύρματο
dc.subject	ομαδοποίηση
dc.subject	αλγόριθμος
dc.subject	προσαρμοστική περίοδος εκπομπής
dc.subject	Ad hoc networks (Computer networks)
dc.subject	wireless
dc.subject	clustering
dc.subject	algorithm
dc.subject	adaptive broadcast period
dc.title	An efficient and scalable clustering algorithm for wireless ad hoc networks	en
heal.type	conferenceItem
heal.classification	Πληροφορική
heal.classification	Ηλεκτρονικοί υπολογιστές Δίκτυα
heal.classification	Computer science
heal.classification	Computer networks
heal.classificationURI	N/A-Πληροφορική
heal.classificationURI	N/A-Ηλεκτρονικοί υπολογιστές Δίκτυα
heal.classificationURI	http://skos.um.es/unescothes/C00750
heal.classificationURI	http://skos.um.es/unescothes/C00744
heal.keywordURI	http://id.loc.gov/authorities/subjects/sh2007004723
heal.identifier.secondary	ISBN: 0-88986-525-6
heal.language	en
heal.access	free
heal.recordProvider	Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε.	el
heal.publicationDate	2005-11
heal.bibliographicCitation	Gavalas, D., Konstantopoulos, C., Mamalis, B. and Pantziou, G. (2005) An Efficient and Scalable Clustering Algorithm for Wireless Ad Hoc Networks. Proceedings of the 17th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS’2005). Presented at the 1st International Workshop on Distributed Algorithms and Applications for Wireless and Mobile Systems - DAAWMS 2005. Organized in conjunction with the 17th IASTED International Conference on Parallel and Distributed Computing and Systems. pp.761-766. Phoenix, AZ, USA	en
heal.abstract	Organization, scalability and routing have been identified as key problems hindering viability and commercial success of mobile ad hoc networks. Clustering of mobile nodes among separate domains has been proposed as an efficient approach to address those issues. In this work, we introduce an efficient distributed clustering algorithm that uses both location and energy metrics for stable cluster formation. Unlike existing active clustering methods, out algorithm relieves the network from the unnecessary burden of control messages broadcasting. This is achieved through adapting broadcast period according to mobile nodes mobility pattern. For relative static network topologies, broadcast period is lengthened. In contrast, broadcast period is shortened to meet the requirements of highly dynamic networks for consistent cluster configurations.	en
heal.fullTextAvailability	true
heal.conferenceName	Proceedings of the 17th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS’2005)	en
heal.conferenceItemType	full paper