Using β-skeletons for localized topology control in wireless ad hoc networks

Manvendu Bhardwaj, Satyajayant Misra, Guoliang Xue

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

Abstract

We propose a novel approach for sparse topology generation in wireless ad hoc networks based on a graph structure known as β-skeletons. Two efficient algorithms are presented in this paper for creating a connected topology from an underlying β-skeleton. One algorithm is a localized algorithm that uses two-hop neighborhood information to generate a connected topology, with a running time of O(n). The other is a distributed algorithm that runs on each component of the β-skeleton creating a connected structure from the disconnected β-skeleton graph, the running time is O(n log n). Simulations show consistent decrease in node degree in the resulting topology. The observed decrease is greater than 33% in comparison to the Relative Neighborhod Graph (RNG) and greater than 50% in comparison to other topology structures such as, the Gabriel Graph (GG) and the Yao construction on GG.

Original languageEnglish (US)
Title of host publicationConference Proceedings of the IEEE International Performance, Computing, and Communications Conference
EditorsT. Dahlberg, R. Oliver, A. Sen, G. Xue
Pages637-638
Number of pages2
StatePublished - 2005
Event24th IEEE International Performance, Computing, and Communications Conference, IPCCC 2005 - Phoenix, AZ, United States
Duration: Apr 7 2005Apr 9 2005

Other

Other24th IEEE International Performance, Computing, and Communications Conference, IPCCC 2005
CountryUnited States
CityPhoenix, AZ
Period4/7/054/9/05

Fingerprint

Wireless ad hoc networks
Topology
Parallel algorithms

Keywords

  • Bounded degree
  • Distributed algorithm
  • Localized algorithm
  • Topology control
  • Topology control structure
  • Wireless ad hoc networks

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Bhardwaj, M., Misra, S., & Xue, G. (2005). Using β-skeletons for localized topology control in wireless ad hoc networks. In T. Dahlberg, R. Oliver, A. Sen, & G. Xue (Eds.), Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference (pp. 637-638)

Using β-skeletons for localized topology control in wireless ad hoc networks. / Bhardwaj, Manvendu; Misra, Satyajayant; Xue, Guoliang.

Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference. ed. / T. Dahlberg; R. Oliver; A. Sen; G. Xue. 2005. p. 637-638.

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

Bhardwaj, M, Misra, S & Xue, G 2005, Using β-skeletons for localized topology control in wireless ad hoc networks. in T Dahlberg, R Oliver, A Sen & G Xue (eds), Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference. pp. 637-638, 24th IEEE International Performance, Computing, and Communications Conference, IPCCC 2005, Phoenix, AZ, United States, 4/7/05.
Bhardwaj M, Misra S, Xue G. Using β-skeletons for localized topology control in wireless ad hoc networks. In Dahlberg T, Oliver R, Sen A, Xue G, editors, Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference. 2005. p. 637-638
Bhardwaj, Manvendu ; Misra, Satyajayant ; Xue, Guoliang. / Using β-skeletons for localized topology control in wireless ad hoc networks. Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference. editor / T. Dahlberg ; R. Oliver ; A. Sen ; G. Xue. 2005. pp. 637-638
@inproceedings{dbd67c7926bc47d2be7d782e7d00a961,
title = "Using β-skeletons for localized topology control in wireless ad hoc networks",
abstract = "We propose a novel approach for sparse topology generation in wireless ad hoc networks based on a graph structure known as β-skeletons. Two efficient algorithms are presented in this paper for creating a connected topology from an underlying β-skeleton. One algorithm is a localized algorithm that uses two-hop neighborhood information to generate a connected topology, with a running time of O(n). The other is a distributed algorithm that runs on each component of the β-skeleton creating a connected structure from the disconnected β-skeleton graph, the running time is O(n log n). Simulations show consistent decrease in node degree in the resulting topology. The observed decrease is greater than 33{\%} in comparison to the Relative Neighborhod Graph (RNG) and greater than 50{\%} in comparison to other topology structures such as, the Gabriel Graph (GG) and the Yao construction on GG.",
keywords = "Bounded degree, Distributed algorithm, Localized algorithm, Topology control, Topology control structure, Wireless ad hoc networks",
author = "Manvendu Bhardwaj and Satyajayant Misra and Guoliang Xue",
year = "2005",
language = "English (US)",
pages = "637--638",
editor = "T. Dahlberg and R. Oliver and A. Sen and G. Xue",
booktitle = "Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference",

}

TY - GEN

T1 - Using β-skeletons for localized topology control in wireless ad hoc networks

AU - Bhardwaj, Manvendu

AU - Misra, Satyajayant

AU - Xue, Guoliang

PY - 2005

Y1 - 2005

N2 - We propose a novel approach for sparse topology generation in wireless ad hoc networks based on a graph structure known as β-skeletons. Two efficient algorithms are presented in this paper for creating a connected topology from an underlying β-skeleton. One algorithm is a localized algorithm that uses two-hop neighborhood information to generate a connected topology, with a running time of O(n). The other is a distributed algorithm that runs on each component of the β-skeleton creating a connected structure from the disconnected β-skeleton graph, the running time is O(n log n). Simulations show consistent decrease in node degree in the resulting topology. The observed decrease is greater than 33% in comparison to the Relative Neighborhod Graph (RNG) and greater than 50% in comparison to other topology structures such as, the Gabriel Graph (GG) and the Yao construction on GG.

AB - We propose a novel approach for sparse topology generation in wireless ad hoc networks based on a graph structure known as β-skeletons. Two efficient algorithms are presented in this paper for creating a connected topology from an underlying β-skeleton. One algorithm is a localized algorithm that uses two-hop neighborhood information to generate a connected topology, with a running time of O(n). The other is a distributed algorithm that runs on each component of the β-skeleton creating a connected structure from the disconnected β-skeleton graph, the running time is O(n log n). Simulations show consistent decrease in node degree in the resulting topology. The observed decrease is greater than 33% in comparison to the Relative Neighborhod Graph (RNG) and greater than 50% in comparison to other topology structures such as, the Gabriel Graph (GG) and the Yao construction on GG.

KW - Bounded degree

KW - Distributed algorithm

KW - Localized algorithm

KW - Topology control

KW - Topology control structure

KW - Wireless ad hoc networks

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

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

M3 - Conference contribution

AN - SCOPUS:28444461095

SP - 637

EP - 638

BT - Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference

A2 - Dahlberg, T.

A2 - Oliver, R.

A2 - Sen, A.

A2 - Xue, G.

ER -