DocumentCode
2308458
Title
An On-Demand Clustering Mechanism for Hierarchical Routing Protocol in Ad Hoc Networks
Author
Huang Chuanhe ; Zhang Yuanyuan ; Jia Xiaohua ; Shi Wenming ; Cheng Yong ; Zhou Hao
Author_Institution
Comput. Sch., Wuhan Univ.
fYear
2006
fDate
22-24 Sept. 2006
Firstpage
1
Lastpage
6
Abstract
Clustering is widely used in ad hoc networks. The most important function of clustering is to provide management of large networks and assign the channel effectively. To maintain the hierarchical topology, the existing clustering mechanisms bring a lot of communication due to movement of the mobility and disappearance of nodes in the network, so there is vast control overhead. To avoid the problem, an on-demand clustering routing protocol (OCRP) is proposed. It eliminates the phase for clustering, and merges this phase with data transmission phase. OCRP adds a field for every data packet to identify five clustering states. Each node analyzes the clustering state field in the received packets, and decides how to switch its own clustering state
Keywords
ad hoc networks; data communication; mobility management (mobile radio); routing protocols; ad hoc networks; data packet; data transmission phase; hierarchical routing protocol; networks management; on-demand clustering mechanism; on-demand clustering routing protocol; Ad hoc networks; Clustering algorithms; Computer networks; Data communication; Mobile ad hoc networks; Network topology; Peer to peer computing; Routing protocols; Spine; Switches;
fLanguage
English
Publisher
ieee
Conference_Titel
Wireless Communications, Networking and Mobile Computing, 2006. WiCOM 2006.International Conference on
Conference_Location
Wuhan
Print_ISBN
1-4244-0517-3
Type
conf
DOI
10.1109/WiCOM.2006.217
Filename
4149394
Link To Document