An improved algorithm of fast clustering broadcast in ad hoc networks

2011 
Clustering of nodes provides an efficient way of handling topology maintenance, managing node movement or reducing overhead in mobile ad hoc networks. In first reference paper, a fast clustering broadcast algorithm based on delay broadcast was presented and it can greatly decrease the cluster establishment time along with the network scale's extension. In this paper, an improved algorithm was presented to mend its performance.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    17
    References
    0
    Citations
    NaN
    KQI
    []