Distributed topology control in wireless ad hoc networks using β-skeletons

Manvendu Bhardwaj, Satyajayant Misra, Guoliang Xue

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

5 Citations (Scopus)

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 distributed algorithm that runs on each component of the β-skeleton. It creates a connected structure from the disconnected β-skeleton graph using a distributed leader election algorithm. The running time of this algorithm is O(n log n). The other is a localized algorithm that uses two-hop neighborhood information to generate a connected topology, with a running time of O(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 publication2005 Workshop on High Performance Switching and Routing, HPSR 2005
Pages371-375
Number of pages5
StatePublished - 2005
Event2005 Workshop on High Performance Switching and Routing, HPSR 2005 - Hong Kong, China
Duration: May 12 2005May 14 2005

Other

Other2005 Workshop on High Performance Switching and Routing, HPSR 2005
CountryChina
CityHong Kong
Period5/12/055/14/05

Fingerprint

Wireless ad hoc networks
Topology
Parallel algorithms

Keywords

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

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Bhardwaj, M., Misra, S., & Xue, G. (2005). Distributed topology control in wireless ad hoc networks using β-skeletons. In 2005 Workshop on High Performance Switching and Routing, HPSR 2005 (pp. 371-375)

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

2005 Workshop on High Performance Switching and Routing, HPSR 2005. 2005. p. 371-375.

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

Bhardwaj, M, Misra, S & Xue, G 2005, Distributed topology control in wireless ad hoc networks using β-skeletons. in 2005 Workshop on High Performance Switching and Routing, HPSR 2005. pp. 371-375, 2005 Workshop on High Performance Switching and Routing, HPSR 2005, Hong Kong, China, 5/12/05.
Bhardwaj M, Misra S, Xue G. Distributed topology control in wireless ad hoc networks using β-skeletons. In 2005 Workshop on High Performance Switching and Routing, HPSR 2005. 2005. p. 371-375
Bhardwaj, Manvendu ; Misra, Satyajayant ; Xue, Guoliang. / Distributed topology control in wireless ad hoc networks using β-skeletons. 2005 Workshop on High Performance Switching and Routing, HPSR 2005. 2005. pp. 371-375
@inproceedings{821580ef3fbb4fbeb51f6507f1ecaf4e,
title = "Distributed topology control in wireless ad hoc networks using β-skeletons",
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 distributed algorithm that runs on each component of the β-skeleton. It creates a connected structure from the disconnected β-skeleton graph using a distributed leader election algorithm. The running time of this algorithm is O(n log n). The other is a localized algorithm that uses two-hop neighborhood information to generate a connected topology, with a running time of O(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, Wireless ad hoc networks",
author = "Manvendu Bhardwaj and Satyajayant Misra and Guoliang Xue",
year = "2005",
language = "English (US)",
isbn = "0780389247",
pages = "371--375",
booktitle = "2005 Workshop on High Performance Switching and Routing, HPSR 2005",

}

TY - GEN

T1 - Distributed topology control in wireless ad hoc networks using β-skeletons

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 distributed algorithm that runs on each component of the β-skeleton. It creates a connected structure from the disconnected β-skeleton graph using a distributed leader election algorithm. The running time of this algorithm is O(n log n). The other is a localized algorithm that uses two-hop neighborhood information to generate a connected topology, with a running time of O(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 distributed algorithm that runs on each component of the β-skeleton. It creates a connected structure from the disconnected β-skeleton graph using a distributed leader election algorithm. The running time of this algorithm is O(n log n). The other is a localized algorithm that uses two-hop neighborhood information to generate a connected topology, with a running time of O(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 - Wireless ad hoc networks

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

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

M3 - Conference contribution

AN - SCOPUS:27644528111

SN - 0780389247

SN - 9780780389243

SP - 371

EP - 375

BT - 2005 Workshop on High Performance Switching and Routing, HPSR 2005

ER -