Construction of directional virtual backbones with minimum routing cost in wireless networks

Ling Ding, Weili Wu, James K. Willson, Hongjie Du, Wonjun Lee

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

5 Citations (Scopus)

Abstract

It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless networks, we study a special virtual backbone (VB) using directional antennas, requiring that from one node to any other node in the network, there exists at least one directional shortest path all of whose intermediate directions should belong to the VB, named as Minimum rOuting Cost Directional VB (MOC-DVB). In addition, VB has been well studied in Unit Disk Graph (UDG). However, radio wave based communications in wireless networks may be interrupted by obstacles (e.g., buildings and mountains). Thus, in this paper, we model a network as a general directed graph. We prove that construction of a minimum MOC-DVB is an NP-hard problem in a general directed graph and in term of the size of MOC-DVB, there exists an unreachable lower bound of the polynomial-time selected MOC-DVB. Therefore, we propose a distributed approximation algorithm for constructing MOC-DVB with approximation ratio of 1 + lnK + 2lnδD, where K is the number of antennas on each node and D is the maximum direction degree in the network. Extensive simulations demonstrate that our constructed MOC-DVB is much more efficient in the sense of MOC-DVB size and routing cost compared to other VBs.

Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
Pages1557-1565
Number of pages9
DOIs
Publication statusPublished - 2011 Aug 2
EventIEEE INFOCOM 2011 - Shanghai, China
Duration: 2011 Apr 102011 Apr 15

Other

OtherIEEE INFOCOM 2011
CountryChina
CityShanghai
Period11/4/1011/4/15

Fingerprint

Wireless networks
Costs
Directed graphs
Antennas
Radio waves
Approximation algorithms
Parallel algorithms
Computational complexity
Energy utilization
Polynomials
Bandwidth
Communication

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Ding, L., Wu, W., Willson, J. K., Du, H., & Lee, W. (2011). Construction of directional virtual backbones with minimum routing cost in wireless networks. In Proceedings - IEEE INFOCOM (pp. 1557-1565). [5934946] https://doi.org/10.1109/INFCOM.2011.5934946

Construction of directional virtual backbones with minimum routing cost in wireless networks. / Ding, Ling; Wu, Weili; Willson, James K.; Du, Hongjie; Lee, Wonjun.

Proceedings - IEEE INFOCOM. 2011. p. 1557-1565 5934946.

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

Ding, L, Wu, W, Willson, JK, Du, H & Lee, W 2011, Construction of directional virtual backbones with minimum routing cost in wireless networks. in Proceedings - IEEE INFOCOM., 5934946, pp. 1557-1565, IEEE INFOCOM 2011, Shanghai, China, 11/4/10. https://doi.org/10.1109/INFCOM.2011.5934946
Ding, Ling ; Wu, Weili ; Willson, James K. ; Du, Hongjie ; Lee, Wonjun. / Construction of directional virtual backbones with minimum routing cost in wireless networks. Proceedings - IEEE INFOCOM. 2011. pp. 1557-1565
@inproceedings{45424c9df7b743a3a13b1c61af8644c1,
title = "Construction of directional virtual backbones with minimum routing cost in wireless networks",
abstract = "It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless networks, we study a special virtual backbone (VB) using directional antennas, requiring that from one node to any other node in the network, there exists at least one directional shortest path all of whose intermediate directions should belong to the VB, named as Minimum rOuting Cost Directional VB (MOC-DVB). In addition, VB has been well studied in Unit Disk Graph (UDG). However, radio wave based communications in wireless networks may be interrupted by obstacles (e.g., buildings and mountains). Thus, in this paper, we model a network as a general directed graph. We prove that construction of a minimum MOC-DVB is an NP-hard problem in a general directed graph and in term of the size of MOC-DVB, there exists an unreachable lower bound of the polynomial-time selected MOC-DVB. Therefore, we propose a distributed approximation algorithm for constructing MOC-DVB with approximation ratio of 1 + lnK + 2lnδD, where K is the number of antennas on each node and D is the maximum direction degree in the network. Extensive simulations demonstrate that our constructed MOC-DVB is much more efficient in the sense of MOC-DVB size and routing cost compared to other VBs.",
author = "Ling Ding and Weili Wu and Willson, {James K.} and Hongjie Du and Wonjun Lee",
year = "2011",
month = "8",
day = "2",
doi = "10.1109/INFCOM.2011.5934946",
language = "English",
isbn = "9781424499212",
pages = "1557--1565",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Construction of directional virtual backbones with minimum routing cost in wireless networks

AU - Ding, Ling

AU - Wu, Weili

AU - Willson, James K.

AU - Du, Hongjie

AU - Lee, Wonjun

PY - 2011/8/2

Y1 - 2011/8/2

N2 - It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless networks, we study a special virtual backbone (VB) using directional antennas, requiring that from one node to any other node in the network, there exists at least one directional shortest path all of whose intermediate directions should belong to the VB, named as Minimum rOuting Cost Directional VB (MOC-DVB). In addition, VB has been well studied in Unit Disk Graph (UDG). However, radio wave based communications in wireless networks may be interrupted by obstacles (e.g., buildings and mountains). Thus, in this paper, we model a network as a general directed graph. We prove that construction of a minimum MOC-DVB is an NP-hard problem in a general directed graph and in term of the size of MOC-DVB, there exists an unreachable lower bound of the polynomial-time selected MOC-DVB. Therefore, we propose a distributed approximation algorithm for constructing MOC-DVB with approximation ratio of 1 + lnK + 2lnδD, where K is the number of antennas on each node and D is the maximum direction degree in the network. Extensive simulations demonstrate that our constructed MOC-DVB is much more efficient in the sense of MOC-DVB size and routing cost compared to other VBs.

AB - It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless networks, we study a special virtual backbone (VB) using directional antennas, requiring that from one node to any other node in the network, there exists at least one directional shortest path all of whose intermediate directions should belong to the VB, named as Minimum rOuting Cost Directional VB (MOC-DVB). In addition, VB has been well studied in Unit Disk Graph (UDG). However, radio wave based communications in wireless networks may be interrupted by obstacles (e.g., buildings and mountains). Thus, in this paper, we model a network as a general directed graph. We prove that construction of a minimum MOC-DVB is an NP-hard problem in a general directed graph and in term of the size of MOC-DVB, there exists an unreachable lower bound of the polynomial-time selected MOC-DVB. Therefore, we propose a distributed approximation algorithm for constructing MOC-DVB with approximation ratio of 1 + lnK + 2lnδD, where K is the number of antennas on each node and D is the maximum direction degree in the network. Extensive simulations demonstrate that our constructed MOC-DVB is much more efficient in the sense of MOC-DVB size and routing cost compared to other VBs.

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

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

U2 - 10.1109/INFCOM.2011.5934946

DO - 10.1109/INFCOM.2011.5934946

M3 - Conference contribution

AN - SCOPUS:79960876258

SN - 9781424499212

SP - 1557

EP - 1565

BT - Proceedings - IEEE INFOCOM

ER -