This item is provided by the institution :
Technological Educational Institute of Athens
Repository :
Ypatia - Institutional Repository
see the original item page
in the repository's web site and access all digital files if the item*

2007 (EN)

Γαβαλάς, Δαμιανός (EL)
Κωνσταντόπουλος, Χαράλαμπος (EL)
Πάντζιου, Γραμματή Ε. (EL)
Μάμαλης, Βασίλης (EL)

Τεχνολογικό Εκπαιδευτικό Ίδρυμα Αθήνας. Σχολή Τεχνολογικών Εφαρμογών. Τμήμα Μηχανικών Πληροφορικής Τ.Ε. (EL)

Clustering has been proposed as a promising method for simplifying the routing process in mobile ad hoc networks (MANETs). The main objective in clustering is to identify suitable node representatives, i.e. cluster heads (CHs) to store routing and topology information; CHs should be elected so as to maximize clusters stability, that is to prevent frequent cluster re-structuring. Since CHs are engaged on packet forwarding they are prone to rapidly drop their energy supplies, hence, another important objective of clustering is to prevent such node failures. Recently proposed clustering algorithms either suggest CH election based on node IDs (nodes with locally lowest ID value become CHs) or take into account additional metrics (such as energy and mobility) and optimize initial clustering. Yet, the former method is biased against nodes with low IDs (which are likely to serve as CHs for long periods and therefore run the risk of rapid battery exhaustion). Similarly, in the latter method, in many situations (e.g. in relatively static topologies) re-clustering procedure is hardly ever invoked; hence initially elected CHs soon suffer from energy drainage. Herein, we propose LIDAR, a novel clustering method which represents a major improvement over alternative clustering algorithms: node IDs are periodically re-assigned so that nodes with low mobility rate and high energy capacity are assigned low ID values and, therefore, are likely to serve as CHs. Therefore, LIDAR achieves stable cluster formations and balanced distribution of energy consumption over mobile nodes. Our protocol also greatly reduces control traffic volume of existing algorithms during clustering maintenance phase, while not risking the energy availability of CHs. Simulation results demonstrate the efficiency, scalability and stability of our protocol against alternative approaches. (EN)


Algorithms (EN)
Stability (EN)
αλγόριθμοι (EN)
ομαδοποίηση (EN)
energy efficiency (EN)
ενεργειακή απόδοση (EN)
Clustering (EN)
κινητά δίκτυα (EN)
σταθερότητα (EN)
Ad hoc networks (Computer networks) (EN)

ΤΕΙ Αθήνας (EL)
Technological Educational Institute of Athens (EN)

Telecommunication Systems (EN)



DOI: 10.1007/s11235-007-9053-1

Springer US (EN)

*Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)