Please use this identifier to cite or link to this item: http://hdl.handle.net/11400/11287
Title: Lowest-ID with adaptive ID reassignment
Alternative title / Subtitle: a novel mobile ad-hoc networks clustering algorithm
Authors: Γαβαλάς, Δαμιανός
Πάντζιου, Γραμματή Ε.
Κωνσταντόπουλος, Χαράλαμπος
Μάμαλης, Βασίλης
Item type: Conference publication
Conference Item Type: Full Paper
Keywords: Ομαδοποίηση;αλγόριθμοι ομαδοποίησης;τοπολογία δικτύου;αυτοοργανωμένο δίκτυο;Clustering;Clustering Algorithms;Electric network topology;Ad hoc networks (Computer networks)
Subjects: Τεχνολογία
Πληροφορική
Technology
Computer science
Issue Date: 27-May-2015
2006
Date of availability: 27-May-2015
Publisher: IEEE
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.
Language: English
Citation: 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
Conference: Proceedings of the 1st IEEE International Symposium on Wireless Pervasive Computing (ISWPC'2006)
Access scheme: Publicly accessible
License: Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες
URI: http://hdl.handle.net/11400/11287
Appears in Collections:Δημοσιεύσεις

Files in This Item:
File Description SizeFormat 
1109.3997.pdf334.64 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons