Efficient clustering-based routing protocol in mobile ad-hoc networks

Chang Wook Ahn, R. S. Ramakrishna, Chung Gu Kang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

This paper proposes a new routing protocol for mobile ad-hoc networks. The proposed routing protocol is a kind of Hybrid Routing Protocol (HRP). It lies somewhere between Proactive Routing Protocol (PRP) and Reactive Routing Protocols (RRP). The former requires every node to maintain the full routing information, while the latter typically relies on the flooding of queries to discover a destination. The proposed routing protocol works on the basis of a virtual cluster, consisting of a collection of only those nodes that are one-hop distance away. The idea is to significantly reduce the control overheads such as route query packets as well as the flooding time for collecting the network topology information at a destination. The key feature of the proposed scheme is that it draws on short packet transfer delay of PRP and the small control overheads performance of RRP. A backup route is intended to further improve the delay performance. A disconnected route can be replaced by backup route, if available. No additional computational overheads are increased for computing the backup route. Computer simulation studies demonstrate the superior performance of the proposed scheme. In particular, it is not sensitive to changing network topology, has shorter transfer delay, reasonable control overheads and appreciable throughput. It exhibits all these desirable characteristics without compromising on other important performance measures.

Original languageEnglish
Title of host publicationIEEE Vehicular Technology Conference
Pages1647-1651
Number of pages5
Volume56
Edition3
Publication statusPublished - 2002
Event56th Vehicular Technology Conference - Vancouver, BC, Canada
Duration: 2002 Sep 242002 Sep 28

Other

Other56th Vehicular Technology Conference
CountryCanada
CityVancouver, BC
Period02/9/2402/9/28

Fingerprint

Mobile ad hoc networks
Routing protocols
Topology
Throughput
Computer simulation

Keywords

  • Ad-hoc networks
  • Routing protocol
  • Virtual cluster

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Ahn, C. W., Ramakrishna, R. S., & Kang, C. G. (2002). Efficient clustering-based routing protocol in mobile ad-hoc networks. In IEEE Vehicular Technology Conference (3 ed., Vol. 56, pp. 1647-1651)

Efficient clustering-based routing protocol in mobile ad-hoc networks. / Ahn, Chang Wook; Ramakrishna, R. S.; Kang, Chung Gu.

IEEE Vehicular Technology Conference. Vol. 56 3. ed. 2002. p. 1647-1651.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ahn, CW, Ramakrishna, RS & Kang, CG 2002, Efficient clustering-based routing protocol in mobile ad-hoc networks. in IEEE Vehicular Technology Conference. 3 edn, vol. 56, pp. 1647-1651, 56th Vehicular Technology Conference, Vancouver, BC, Canada, 02/9/24.
Ahn CW, Ramakrishna RS, Kang CG. Efficient clustering-based routing protocol in mobile ad-hoc networks. In IEEE Vehicular Technology Conference. 3 ed. Vol. 56. 2002. p. 1647-1651
Ahn, Chang Wook ; Ramakrishna, R. S. ; Kang, Chung Gu. / Efficient clustering-based routing protocol in mobile ad-hoc networks. IEEE Vehicular Technology Conference. Vol. 56 3. ed. 2002. pp. 1647-1651
@inproceedings{eed633bc4587499b9eb55a52c94f001a,
title = "Efficient clustering-based routing protocol in mobile ad-hoc networks",
abstract = "This paper proposes a new routing protocol for mobile ad-hoc networks. The proposed routing protocol is a kind of Hybrid Routing Protocol (HRP). It lies somewhere between Proactive Routing Protocol (PRP) and Reactive Routing Protocols (RRP). The former requires every node to maintain the full routing information, while the latter typically relies on the flooding of queries to discover a destination. The proposed routing protocol works on the basis of a virtual cluster, consisting of a collection of only those nodes that are one-hop distance away. The idea is to significantly reduce the control overheads such as route query packets as well as the flooding time for collecting the network topology information at a destination. The key feature of the proposed scheme is that it draws on short packet transfer delay of PRP and the small control overheads performance of RRP. A backup route is intended to further improve the delay performance. A disconnected route can be replaced by backup route, if available. No additional computational overheads are increased for computing the backup route. Computer simulation studies demonstrate the superior performance of the proposed scheme. In particular, it is not sensitive to changing network topology, has shorter transfer delay, reasonable control overheads and appreciable throughput. It exhibits all these desirable characteristics without compromising on other important performance measures.",
keywords = "Ad-hoc networks, Routing protocol, Virtual cluster",
author = "Ahn, {Chang Wook} and Ramakrishna, {R. S.} and Kang, {Chung Gu}",
year = "2002",
language = "English",
volume = "56",
pages = "1647--1651",
booktitle = "IEEE Vehicular Technology Conference",
edition = "3",

}

TY - GEN

T1 - Efficient clustering-based routing protocol in mobile ad-hoc networks

AU - Ahn, Chang Wook

AU - Ramakrishna, R. S.

AU - Kang, Chung Gu

PY - 2002

Y1 - 2002

N2 - This paper proposes a new routing protocol for mobile ad-hoc networks. The proposed routing protocol is a kind of Hybrid Routing Protocol (HRP). It lies somewhere between Proactive Routing Protocol (PRP) and Reactive Routing Protocols (RRP). The former requires every node to maintain the full routing information, while the latter typically relies on the flooding of queries to discover a destination. The proposed routing protocol works on the basis of a virtual cluster, consisting of a collection of only those nodes that are one-hop distance away. The idea is to significantly reduce the control overheads such as route query packets as well as the flooding time for collecting the network topology information at a destination. The key feature of the proposed scheme is that it draws on short packet transfer delay of PRP and the small control overheads performance of RRP. A backup route is intended to further improve the delay performance. A disconnected route can be replaced by backup route, if available. No additional computational overheads are increased for computing the backup route. Computer simulation studies demonstrate the superior performance of the proposed scheme. In particular, it is not sensitive to changing network topology, has shorter transfer delay, reasonable control overheads and appreciable throughput. It exhibits all these desirable characteristics without compromising on other important performance measures.

AB - This paper proposes a new routing protocol for mobile ad-hoc networks. The proposed routing protocol is a kind of Hybrid Routing Protocol (HRP). It lies somewhere between Proactive Routing Protocol (PRP) and Reactive Routing Protocols (RRP). The former requires every node to maintain the full routing information, while the latter typically relies on the flooding of queries to discover a destination. The proposed routing protocol works on the basis of a virtual cluster, consisting of a collection of only those nodes that are one-hop distance away. The idea is to significantly reduce the control overheads such as route query packets as well as the flooding time for collecting the network topology information at a destination. The key feature of the proposed scheme is that it draws on short packet transfer delay of PRP and the small control overheads performance of RRP. A backup route is intended to further improve the delay performance. A disconnected route can be replaced by backup route, if available. No additional computational overheads are increased for computing the backup route. Computer simulation studies demonstrate the superior performance of the proposed scheme. In particular, it is not sensitive to changing network topology, has shorter transfer delay, reasonable control overheads and appreciable throughput. It exhibits all these desirable characteristics without compromising on other important performance measures.

KW - Ad-hoc networks

KW - Routing protocol

KW - Virtual cluster

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

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

M3 - Conference contribution

AN - SCOPUS:0036453014

VL - 56

SP - 1647

EP - 1651

BT - IEEE Vehicular Technology Conference

ER -