An on-demand clustering mechanism for hierarchical routing protocol in ad hoc networks

Chuanhe Huang; Yuanyuan Zhang; Xiaohua Jia; Wenming Shi; Yong Cheng; Hao Zhou

doi:10.1109/WiCOM.2006.217

An on-demand clustering mechanism for hierarchical routing protocol in ad hoc networks

Chuanhe Huang^*, Yuanyuan Zhang, Xiaohua Jia, Wenming Shi, Yong Cheng, Hao Zhou

^*Corresponding author for this work

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

5 Citations (Scopus)

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. © 2006 IEEE.

Original language	English
Title of host publication	2006 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2006
DOIs	https://doi.org/10.1109/WiCOM.2006.217
Publication status	Published - 2007
Externally published	Yes
Event	2006 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2006 - Wuhan, China Duration: 22 Sept 2006 → 29 Sept 2006

Conference

Conference	2006 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2006
Country/Territory	China
City	Wuhan
Period	22/09/06 → 29/09/06

Research Keywords

Clustering
Clustering state
Control overhead
Hierarchical routing

Access Output

10.1109/WiCOM.2006.217

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{741121dad6fd4808b05791749bb9ec9d,

title = "An on-demand clustering mechanism for hierarchical routing protocol in ad hoc networks",

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. {\textcopyright} 2006 IEEE.",

keywords = "Clustering, Clustering state, Control overhead, Hierarchical routing",

author = "Chuanhe Huang and Yuanyuan Zhang and Xiaohua Jia and Wenming Shi and Yong Cheng and Hao Zhou",

year = "2007",

doi = "10.1109/WiCOM.2006.217",

language = "English",

isbn = "1424405173",

booktitle = "2006 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2006",

note = "2006 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2006 ; Conference date: 22-09-2006 Through 29-09-2006",

}

Huang, C, Zhang, Y, Jia, X, Shi, W, Cheng, Y & Zhou, H 2007, An on-demand clustering mechanism for hierarchical routing protocol in ad hoc networks. in 2006 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2006., 4149394, 2006 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2006, Wuhan, China, 22/09/06. https://doi.org/10.1109/WiCOM.2006.217

An on-demand clustering mechanism for hierarchical routing protocol in ad hoc networks. / Huang, Chuanhe; Zhang, Yuanyuan; Jia, Xiaohua et al.
2006 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2006. 2007. 4149394.

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - An on-demand clustering mechanism for hierarchical routing protocol in ad hoc networks

AU - Huang, Chuanhe

AU - Zhang, Yuanyuan

AU - Jia, Xiaohua

AU - Shi, Wenming

AU - Cheng, Yong

AU - Zhou, Hao

PY - 2007

Y1 - 2007

N2 - 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. © 2006 IEEE.

AB - 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. © 2006 IEEE.

KW - Clustering

KW - Clustering state

KW - Control overhead

KW - Hierarchical routing

UR - http://www.scopus.com/inward/record.url?scp=37649031752&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-37649031752&origin=recordpage

U2 - 10.1109/WiCOM.2006.217

DO - 10.1109/WiCOM.2006.217

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 1424405173

SN - 9781424405176

BT - 2006 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2006

T2 - 2006 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2006

Y2 - 22 September 2006 through 29 September 2006

ER -

An on-demand clustering mechanism for hierarchical routing protocol in ad hoc networks

Abstract

Conference

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this