A hierarchical virtual-backbone routing approach in Ad hoc networks

Hiranmayi Sreenivas, Hesham H Ali

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

1 Citation (Scopus)

Abstract

This paper presents a hierarchical approach to routing in ad-hoc wireless networks using graph theoretic concepts. Ad hoc wireless networks provide a flexible and quick means of establishing wireless peer-to-peer communications. However, routing remains a challenging problem in an ad hoc network due to its multihop nature and dynamic network topology. In previous work, we have proposed an evolutionary approach, employing genetic algorithms, to constructing a stable connected dominating set that serves as a virtual backbone in an ad hoc wireless network. In this work, we present a two-level hierarchical routing strategy that serves to further improve the efficiency of the evolutionary virtual-backbone-based routing approach. The network is divided into groups of nodes called clusters. Within each cluster, there exists a self-organizing, dynamic virtual backbone that is constructed using a heuristic based on genetic algorithms. Between clusters, information is routed through gateway nodes. The overhead of computing and refreshing the virtual backbone for the entire network would be greatly reduced, particularly as the network size increases. This, in turn, improves the routing performance significantly. Through extensive simulations, we demonstrate the importance of clustering by showing that the clustered protocol outperforms the non-clustered evolutionary protocol especially for large networks.

Original languageEnglish (US)
Title of host publicationThird IASTED International Conference on Communications and Computer Networks, CCN 2005
EditorsM.Y. Sanadidi
Pages81-87
Number of pages7
StatePublished - Dec 1 2005
EventProceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005 - Marina del Rey, CA, United States
Duration: Oct 24 2005Oct 26 2005

Publication series

NameProceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005

Conference

ConferenceProceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005
CountryUnited States
CityMarina del Rey, CA
Period10/24/0510/26/05

Fingerprint

Wireless ad hoc networks
Ad hoc networks
Genetic algorithms
Network protocols
Topology
Communication

Keywords

  • Ad-hoc networks
  • Genetic algorithms
  • Routing
  • Simulation
  • Virtual backbones connected dominating sets

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Sreenivas, H., & Ali, H. H. (2005). A hierarchical virtual-backbone routing approach in Ad hoc networks. In M. Y. Sanadidi (Ed.), Third IASTED International Conference on Communications and Computer Networks, CCN 2005 (pp. 81-87). (Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005).

A hierarchical virtual-backbone routing approach in Ad hoc networks. / Sreenivas, Hiranmayi; Ali, Hesham H.

Third IASTED International Conference on Communications and Computer Networks, CCN 2005. ed. / M.Y. Sanadidi. 2005. p. 81-87 (Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005).

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

Sreenivas, H & Ali, HH 2005, A hierarchical virtual-backbone routing approach in Ad hoc networks. in MY Sanadidi (ed.), Third IASTED International Conference on Communications and Computer Networks, CCN 2005. Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005, pp. 81-87, Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005, Marina del Rey, CA, United States, 10/24/05.
Sreenivas H, Ali HH. A hierarchical virtual-backbone routing approach in Ad hoc networks. In Sanadidi MY, editor, Third IASTED International Conference on Communications and Computer Networks, CCN 2005. 2005. p. 81-87. (Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005).
Sreenivas, Hiranmayi ; Ali, Hesham H. / A hierarchical virtual-backbone routing approach in Ad hoc networks. Third IASTED International Conference on Communications and Computer Networks, CCN 2005. editor / M.Y. Sanadidi. 2005. pp. 81-87 (Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005).
@inproceedings{5090852ebbc64c92b031e5583d6cafcb,
title = "A hierarchical virtual-backbone routing approach in Ad hoc networks",
abstract = "This paper presents a hierarchical approach to routing in ad-hoc wireless networks using graph theoretic concepts. Ad hoc wireless networks provide a flexible and quick means of establishing wireless peer-to-peer communications. However, routing remains a challenging problem in an ad hoc network due to its multihop nature and dynamic network topology. In previous work, we have proposed an evolutionary approach, employing genetic algorithms, to constructing a stable connected dominating set that serves as a virtual backbone in an ad hoc wireless network. In this work, we present a two-level hierarchical routing strategy that serves to further improve the efficiency of the evolutionary virtual-backbone-based routing approach. The network is divided into groups of nodes called clusters. Within each cluster, there exists a self-organizing, dynamic virtual backbone that is constructed using a heuristic based on genetic algorithms. Between clusters, information is routed through gateway nodes. The overhead of computing and refreshing the virtual backbone for the entire network would be greatly reduced, particularly as the network size increases. This, in turn, improves the routing performance significantly. Through extensive simulations, we demonstrate the importance of clustering by showing that the clustered protocol outperforms the non-clustered evolutionary protocol especially for large networks.",
keywords = "Ad-hoc networks, Genetic algorithms, Routing, Simulation, Virtual backbones connected dominating sets",
author = "Hiranmayi Sreenivas and Ali, {Hesham H}",
year = "2005",
month = "12",
day = "1",
language = "English (US)",
isbn = "0889865469",
series = "Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005",
pages = "81--87",
editor = "M.Y. Sanadidi",
booktitle = "Third IASTED International Conference on Communications and Computer Networks, CCN 2005",

}

TY - GEN

T1 - A hierarchical virtual-backbone routing approach in Ad hoc networks

AU - Sreenivas, Hiranmayi

AU - Ali, Hesham H

PY - 2005/12/1

Y1 - 2005/12/1

N2 - This paper presents a hierarchical approach to routing in ad-hoc wireless networks using graph theoretic concepts. Ad hoc wireless networks provide a flexible and quick means of establishing wireless peer-to-peer communications. However, routing remains a challenging problem in an ad hoc network due to its multihop nature and dynamic network topology. In previous work, we have proposed an evolutionary approach, employing genetic algorithms, to constructing a stable connected dominating set that serves as a virtual backbone in an ad hoc wireless network. In this work, we present a two-level hierarchical routing strategy that serves to further improve the efficiency of the evolutionary virtual-backbone-based routing approach. The network is divided into groups of nodes called clusters. Within each cluster, there exists a self-organizing, dynamic virtual backbone that is constructed using a heuristic based on genetic algorithms. Between clusters, information is routed through gateway nodes. The overhead of computing and refreshing the virtual backbone for the entire network would be greatly reduced, particularly as the network size increases. This, in turn, improves the routing performance significantly. Through extensive simulations, we demonstrate the importance of clustering by showing that the clustered protocol outperforms the non-clustered evolutionary protocol especially for large networks.

AB - This paper presents a hierarchical approach to routing in ad-hoc wireless networks using graph theoretic concepts. Ad hoc wireless networks provide a flexible and quick means of establishing wireless peer-to-peer communications. However, routing remains a challenging problem in an ad hoc network due to its multihop nature and dynamic network topology. In previous work, we have proposed an evolutionary approach, employing genetic algorithms, to constructing a stable connected dominating set that serves as a virtual backbone in an ad hoc wireless network. In this work, we present a two-level hierarchical routing strategy that serves to further improve the efficiency of the evolutionary virtual-backbone-based routing approach. The network is divided into groups of nodes called clusters. Within each cluster, there exists a self-organizing, dynamic virtual backbone that is constructed using a heuristic based on genetic algorithms. Between clusters, information is routed through gateway nodes. The overhead of computing and refreshing the virtual backbone for the entire network would be greatly reduced, particularly as the network size increases. This, in turn, improves the routing performance significantly. Through extensive simulations, we demonstrate the importance of clustering by showing that the clustered protocol outperforms the non-clustered evolutionary protocol especially for large networks.

KW - Ad-hoc networks

KW - Genetic algorithms

KW - Routing

KW - Simulation

KW - Virtual backbones connected dominating sets

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

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

M3 - Conference contribution

SN - 0889865469

SN - 9780889865464

T3 - Proceedings of the Third IASTED International Conference on Communications and Computer Networks, CCN 2005

SP - 81

EP - 87

BT - Third IASTED International Conference on Communications and Computer Networks, CCN 2005

A2 - Sanadidi, M.Y.

ER -