Show simple item record Γαβαλάς, Δαμιανός el Πάντζιου, Γραμματή Ε. el Κωνσταντόπουλος, Χαράλαμπος el Μάμαλης, Βασίλης el 2015-05-27T22:43:07Z 2015-05-27T22:43:07Z 2015-05-28
dc.rights Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες *
dc.rights.uri *
dc.source en
dc.subject κινητά αυτοοργανούμενα δίκτυα
dc.subject ομαδοποίηση
dc.subject κλιμάκωση
dc.subject αλγόριθμος
dc.subject δυναμικά δίκτυα
dc.subject τοπολογίες δικτύου
dc.subject Ad hoc networks (Computer networks)
dc.subject Clustering
dc.subject Computer networks--Scalability
dc.subject algorithm
dc.subject dynamic networks
dc.subject network topologies
dc.title Efficient active clustering of mobile 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.identifier.secondary DOI: 10.1007/11573036_78
heal.language en
heal.access campus
heal.recordProvider Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε. el
heal.publicationDate 2005-11-11
heal.bibliographicCitation Gavalas, D., Pantziou, G., Konstantopoulos, C. and Mamalis, B. (2005) Efficient Active Clustering of Mobile Ad-Hoc Networks. Proceedings of the Panhellenic Conference on Informatics (PCI’ 2005). 3746, pp.820-827. Volas, Greece: Springer Berlin Heidelberg en
heal.abstract Mobile ad hoc networks comprise a collection of wireless nodes that dynamically create a network among themselves without using any pre-existing infrastructure. Clustering of mobile nodes among separate domains has been proposed as an efficient approach to answer the organization, scalability and routing problems of mobile ad hoc networks. In this work, we propose 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.publisher Springer Berlin Heidelberg en
heal.fullTextAvailability true
heal.conferenceName Proceedings of the Panhellenic Conference on Informatics (PCI’ 2005) en
heal.conferenceItemType full paper

Files in this item

  • Name: chp%3A10.1007%2F11573036_78.pdf
    Size: 1.682Mb
    Format: PDF

The following license files are associated with this item:

Show simple item record

Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες Except where otherwise noted, this item's license is described as Αναφορά Δημιουργού-Μη Εμπορική Χρήση-Όχι Παράγωγα Έργα 3.0 Ηνωμένες Πολιτείες