A novel cluster-based routing algorithm in ad hoc networks

Li Dongni

doi:10.1109/CIS.2007.50

A novel cluster-based routing algorithm in ad hoc networks

Li Dongni^*

^*Corresponding author for this work

School of Computer Science and Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Citation (Scopus)

Abstract

Aimed at the stability of clusters and load balancing, a novel cluster-based routing algorithm is proposed in this paper. In order to maintain the stability of clusters, speed and energy of mobile nodes, but not the identity and connectivity, are taken as the basis of cluster-head election. Try to make all the nodes share the role of cluster-head, so as to balance the traffic loads of the network, and to avoid invalidity caused by certain nodes exhausting energy. Based on clustering, the backbone network composed by cluster-heads, gateways, and compound gateways is constructed, which reduces the complexity of maintaining routing information and topology information, and simplifies the routing process in large hierarchical ad hoc networks. Simulation results show that compared to the lowest ID and largest connectivity algorithms, it has better performance on network life duration, energy consumption, and signaling overhead.

Original language	English
Title of host publication	Proceedings - 2007 International Conference on Computational Intelligence and Security, CIS 2007
Pages	1053-1057
Number of pages	5
DOIs	https://doi.org/10.1109/CIS.2007.50
Publication status	Published - 2007
Event	2007 International Conference on Computational Intelligence and Security, CIS'07 - Harbin, Heilongjiang, China Duration: 15 Dec 2007 → 19 Dec 2007

Publication series

Name	Proceedings - 2007 International Conference on Computational Intelligence and Security, CIS 2007

Conference

Conference	2007 International Conference on Computational Intelligence and Security, CIS'07
Country/Territory	China
City	Harbin, Heilongjiang
Period	15/12/07 → 19/12/07

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 7 Affordable and Clean Energy

Access to Document

10.1109/CIS.2007.50

Cite this

@inproceedings{09e213dcf26348fc8a07cb48b7381b1b,

title = "A novel cluster-based routing algorithm in ad hoc networks",

abstract = "Aimed at the stability of clusters and load balancing, a novel cluster-based routing algorithm is proposed in this paper. In order to maintain the stability of clusters, speed and energy of mobile nodes, but not the identity and connectivity, are taken as the basis of cluster-head election. Try to make all the nodes share the role of cluster-head, so as to balance the traffic loads of the network, and to avoid invalidity caused by certain nodes exhausting energy. Based on clustering, the backbone network composed by cluster-heads, gateways, and compound gateways is constructed, which reduces the complexity of maintaining routing information and topology information, and simplifies the routing process in large hierarchical ad hoc networks. Simulation results show that compared to the lowest ID and largest connectivity algorithms, it has better performance on network life duration, energy consumption, and signaling overhead.",

author = "Li Dongni",

year = "2007",

doi = "10.1109/CIS.2007.50",

language = "English",

isbn = "0769530729",

series = "Proceedings - 2007 International Conference on Computational Intelligence and Security, CIS 2007",

pages = "1053--1057",

booktitle = "Proceedings - 2007 International Conference on Computational Intelligence and Security, CIS 2007",

note = "2007 International Conference on Computational Intelligence and Security, CIS'07 ; Conference date: 15-12-2007 Through 19-12-2007",

}

Dongni, L 2007, A novel cluster-based routing algorithm in ad hoc networks. in Proceedings - 2007 International Conference on Computational Intelligence and Security, CIS 2007., 4415509, Proceedings - 2007 International Conference on Computational Intelligence and Security, CIS 2007, pp. 1053-1057, 2007 International Conference on Computational Intelligence and Security, CIS'07, Harbin, Heilongjiang, China, 15/12/07. https://doi.org/10.1109/CIS.2007.50

A novel cluster-based routing algorithm in ad hoc networks. / Dongni, Li.
Proceedings - 2007 International Conference on Computational Intelligence and Security, CIS 2007. 2007. p. 1053-1057 4415509 (Proceedings - 2007 International Conference on Computational Intelligence and Security, CIS 2007).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A novel cluster-based routing algorithm in ad hoc networks

AU - Dongni, Li

PY - 2007

Y1 - 2007

N2 - Aimed at the stability of clusters and load balancing, a novel cluster-based routing algorithm is proposed in this paper. In order to maintain the stability of clusters, speed and energy of mobile nodes, but not the identity and connectivity, are taken as the basis of cluster-head election. Try to make all the nodes share the role of cluster-head, so as to balance the traffic loads of the network, and to avoid invalidity caused by certain nodes exhausting energy. Based on clustering, the backbone network composed by cluster-heads, gateways, and compound gateways is constructed, which reduces the complexity of maintaining routing information and topology information, and simplifies the routing process in large hierarchical ad hoc networks. Simulation results show that compared to the lowest ID and largest connectivity algorithms, it has better performance on network life duration, energy consumption, and signaling overhead.

AB - Aimed at the stability of clusters and load balancing, a novel cluster-based routing algorithm is proposed in this paper. In order to maintain the stability of clusters, speed and energy of mobile nodes, but not the identity and connectivity, are taken as the basis of cluster-head election. Try to make all the nodes share the role of cluster-head, so as to balance the traffic loads of the network, and to avoid invalidity caused by certain nodes exhausting energy. Based on clustering, the backbone network composed by cluster-heads, gateways, and compound gateways is constructed, which reduces the complexity of maintaining routing information and topology information, and simplifies the routing process in large hierarchical ad hoc networks. Simulation results show that compared to the lowest ID and largest connectivity algorithms, it has better performance on network life duration, energy consumption, and signaling overhead.

UR - https://www.scopus.com/pages/publications/48349131773

U2 - 10.1109/CIS.2007.50

DO - 10.1109/CIS.2007.50

M3 - Conference contribution

AN - SCOPUS:48349131773

SN - 0769530729

SN - 9780769530727

T3 - Proceedings - 2007 International Conference on Computational Intelligence and Security, CIS 2007

SP - 1053

EP - 1057

BT - Proceedings - 2007 International Conference on Computational Intelligence and Security, CIS 2007

T2 - 2007 International Conference on Computational Intelligence and Security, CIS'07

Y2 - 15 December 2007 through 19 December 2007

ER -

A novel cluster-based routing algorithm in ad hoc networks

Abstract

Publication series

Conference

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this