### 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 language | English (US) |
---|---|

Title of host publication | 2005 Workshop on High Performance Switching and Routing, HPSR 2005 |

Pages | 371-375 |

Number of pages | 5 |

State | Published - 2005 |

Event | 2005 Workshop on High Performance Switching and Routing, HPSR 2005 - Hong Kong, China Duration: May 12 2005 → May 14 2005 |

### Other

Other | 2005 Workshop on High Performance Switching and Routing, HPSR 2005 |
---|---|

Country | China |

City | Hong Kong |

Period | 5/12/05 → 5/14/05 |

### Fingerprint

### Keywords

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

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

*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.

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

*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.

}

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 -