DocumentCode :
2174675
Title :
An improved algorithm of fast clustering broadcast in ad hoc networks
Author :
Ning, Xiangyan ; Zhang, Shunyi ; Qi, Jin
Author_Institution :
Nanjing Univ. of Posts & Telecommun., Nanjing, China
fYear :
2011
fDate :
9-11 Sept. 2011
Firstpage :
2535
Lastpage :
2538
Abstract :
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.
Keywords :
mobile ad hoc networks; pattern clustering; telecommunication network management; MANET; delay broadcast; fast clustering broadcast algorithm; mobile ad hoc networks; network scale extension; node movement; overhead reduction; topology maintenance; Algorithm design and analysis; Clustering algorithms; Delay; Mobile ad hoc networks; Network topology; Peer to peer computing; Ad hoc; broadcast; clustering delay;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electronics, Communications and Control (ICECC), 2011 International Conference on
Conference_Location :
Ningbo
Print_ISBN :
978-1-4577-0320-1
Type :
conf
DOI :
10.1109/ICECC.2011.6066527
Filename :
6066527
Link To Document :
بازگشت