Lowest-ID with adaptive ID reassignment

dc.contributor.author	Γαβαλάς, Δαμιανός	el
dc.contributor.author	Πάντζιου, Γραμματή Ε.	el
dc.contributor.author	Κωνσταντόπουλος, Χαράλαμπος	el
dc.contributor.author	Μάμαλης, Βασίλης	el
dc.date.accessioned	2015-05-27T20:17:35Z
dc.date.available	2015-05-27T20:17:35Z
dc.date.issued	2015-05-27
dc.identifier.uri	http://hdl.handle.net/11400/11287
dc.rights	Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.source	http://arxiv.org/abs/1109.3997	en
dc.subject	Ομαδοποίηση
dc.subject	αλγόριθμοι ομαδοποίησης
dc.subject	τοπολογία δικτύου
dc.subject	αυτοοργανωμένο δίκτυο
dc.subject	Clustering
dc.subject	Clustering Algorithms
dc.subject	Electric network topology
dc.subject	Ad hoc networks (Computer networks)
dc.title	Lowest-ID with adaptive ID reassignment	en
heal.type	conferenceItem
heal.secondaryTitle	a novel mobile ad-hoc networks clustering algorithm	en
heal.classification	Τεχνολογία
heal.classification	Πληροφορική
heal.classification	Technology
heal.classification	Computer science
heal.classificationURI	N/A-Τεχνολογία
heal.classificationURI	N/A-Πληροφορική
heal.classificationURI	http://zbw.eu/stw/descriptor/10470-6
heal.classificationURI	http://skos.um.es/unescothes/C00750
heal.keywordURI	http://id.loc.gov/authorities/subjects/sh85041865
heal.keywordURI	http://id.loc.gov/authorities/subjects/sh2007004723
heal.identifier.secondary	DOI: 10.1109/ISWPC.2006.1613559
heal.language	en
heal.access	free
heal.recordProvider	Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε.	el
heal.publicationDate	2006
heal.bibliographicCitation	Gavalas, D., Pantziou, G., Konstantopoulos, C. and Mamalis, B. (2006) Lowest-ID with Adaptive ID Reassignment: A Novel Mobile Ad-Hoc Networks Clustering Algorithm. Proceedings of the 1st IEEE International Symposium on Wireless Pervasive Computing (ISWPC'2006). IEEE	en
heal.abstract	Clustering is a promising approach for building hierarchies and simplifying the routing process in mobile ad-hoc network environments. The main objective of clustering is to identify suitable node representatives, i.e. cluster heads (CHs), to store routing and topology information and maximize clusters stability. Traditional clustering algorithms suggest CH election exclusively based on node IDs or location information and involve frequent broadcasting of control packets, even when network topology remains unchanged. More recent works take into account additional metrics (such as energy and mobility) and optimize initial clustering. However, in many situations (e.g. in relatively static topologies) re-clustering procedure is hardly ever invoked; hence initially elected CHs soon reach battery exhaustion. Herein, we introduce an efficient distributed clustering algorithm that uses both mobility and energy metrics to provide stable cluster formations. CHs are initially elected based on the time and cost-efficient lowest-ID method. During clustering maintenance phase though, node IDs are re-assigned according to nodes mobility and energy status, ensuring that nodes with low-mobility and sufficient energy supply are assigned low IDs and, hence, are elected as CHs. Our algorithm also reduces control traffic volume since broadcast period is adjusted according to nodes mobility pattern: we employ infrequent broadcasting for relative static network topologies, and increase broadcast frequency for highly mobile network configurations. Simulation results verify that energy consumption is uniformly distributed among network nodes and that signaling overhead is significantly decreased.	en
heal.publisher	IEEE	en
heal.fullTextAvailability	true
heal.conferenceName	Proceedings of the 1st IEEE International Symposium on Wireless Pervasive Computing (ISWPC'2006)	en
heal.conferenceItemType	full paper